[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

An Equivalent Exchange Based Data Forwarding Incentive Scheme for Socially Aware Networks

  • Published:
Journal of Signal Processing Systems Aims and scope Submit manuscript

Abstract

As nodes have limited resources in the socially aware networks, they will have strong selfish behaviors, such as not forwarding messages and losing packets, which will lead to poor network performance. Thus, an equivalent-exchange-based data forwarding incentive scheme (EEIS) will be proposed in this paper. It is main that messages forwarding will be abstracted into a transaction in EEIS. The buyer and seller respectively make a price about the message according to its own resource state and negotiate twice the pricing both side until they agree, then the buyer will send the message and pay a certain virtual currency to the seller. Otherwise, the next message will continue to be traded. Meanwhile, both parties’ resource status, wealth status and the price of messages must be open and transparent to prevent the nodes from making false pricing during the transaction. Ultimately, the experimental results show the delivery ratio about messages is improved significantly and verify the effectiveness of EEIS.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Figure. 1
Figure 2
Figure. 3
Figure. 4
Figure. 5
Figure. 6
Figure. 7
Figure. 8

Similar content being viewed by others

References

  1. Gai, K., Qiu, M., & Zhao, H. (2017). Privacy-preserving data encryption strategy for big data in Mobile cloud computing. IEEE Transactions on Big Data, 1–1.

  2. Qiu, M., Jia, Z., Xue, C., Shao, Z., & Sha, E. H. M. (2007). Voltage assignment with guaranteed probability satisfying timing constraint for real-time Multiproceesor DSP. Journal of VLSI Signal Processing, 46(1), 55–73.

    Article  Google Scholar 

  3. Xia, F., Liu, L., Li, J., Ma, J., & Vasilakos, A. V. (2015). Socially aware networking: A survey. IEEE Systems Journal, 9(3), 904–921.

    Article  Google Scholar 

  4. Xia, F., Liu, L., Li, J., Ahmed, A. M., Yang, L. T., & Ma, J. (2015). BEEINFO: Interest-based forwarding using artificial bee colony for socially aware networking. IEEE Transactions on Vehicular Technology, 64(3), 1188–1200.

    Article  Google Scholar 

  5. Ning, Z., Liu, L., Xia, F., Jedari, B., Lee, I., & Zhang, W. (2017). CAIS: A copy adjustable incentive scheme in community-based socially aware networking. IEEE Trans. Vehicular Technology, 66(4), 3406–3419.

    Article  Google Scholar 

  6. Guo, Y., Zhuge, Q., Hu, J., Yi, J., Qiu, M., & Sha, E. H. M. (2013). Data placement and duplication for embedded multicore systems with scratch pad memory. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 32(6), 809–817.

    Article  Google Scholar 

  7. Xu, F., Xu, Q., Xiong, Z., Xiao, N., Xie, Y., Deng, M., & Hao, H. (2019). Intelligent distributed routing scheme based on social similarity for mobile social networks. Future Generation Computer Systems, 96, 472–480.

    Article  Google Scholar 

  8. Yürür, Ö., Liu, C. H., Sheng, Z., et al. (2016). Context-awareness for mobile sensing: A survey and future directions. IEEE Communications Surveys & Tutorials, 18(1), 68–93.

    Article  Google Scholar 

  9. Xu, F., Xiao, N., Deng, M., Xie, Y., Xiong, Z., & Xu, Q. (2019). Efficient opportunistic routing with social context awareness for distributed mobile social networks. Concurrency and Computation: Practice and Experience, 5, e5524.

    Google Scholar 

  10. Bisio, I., Lavagetto, F., Sciarrone, A., Penner, T., & Guirguis, M. (2017). Context-awareness over transient cloud in D2D networks: Energy performance analysis and evaluation. Transactions on Emerging Telecommunications Technologies, 28(2), e3002.

    Article  Google Scholar 

  11. Song, Y., Li, Y., Jia, L., & Qiu, M. (2020). Retraining strategy-based domain adaption network for intelligent fault diagnosis. IEEE Transactions on Industrial Informatics, 16(9), 6163–6171.

    Article  Google Scholar 

  12. M. Qiu, K. Zhang, M. Huang. An empirical study of web interface design on small display devices. IEEE/WIC/ACM International Conference on Web Intelligence.ACM, 2004:29–35.

  13. Chen, M., Zhang, Y., Qiu, M., Guizani, N., & Hao, Y. (2018). SPHA: Smart personal health advisor based on deep analytics. IEEE Communications Magazine, 56(3), 164–169.

    Article  Google Scholar 

  14. Li, Q., Zhu, S., & Cao, G. (2010). Routing in Socially Selfish Delay Tolerant Networks. Infocom IEEE International Conference on Computer Communications. IEEE, 1–9.

  15. Boldrini, C., Conti, M., & Passarella, A. (2010). Design and performance evaluation of ContentPlace, a social-aware data dissemination system for opportunistic networks. Computer Networks, 54(4), 589–604.

    Article  Google Scholar 

  16. Ma, X., Zheng, T., & Li, M. (2019). Analysis and regulation of effects of selfishness on opportunistic network. Acta Electronica Sinica, 47(04), 837–847.

    Google Scholar 

  17. Lv, J., Song, H., He Z., Pan, D.(2017). Survey of research on node’s selfish behavior in opportunistic networks. Computer Engineering and Applications, 53(18):7–16+50.

  18. Ren, Z., Chen, M., Kang, J., & Li, X. (2020). Opportunistic network selfish node detection algorithm combined with probabilistic routing. Journal of Chinese Computer Systems, 41(05), 1047–1052.

    Google Scholar 

  19. Nobahary, S., Garakani, H. G., Khademzadeh, A., & Rahmani, A. M. (2019). Selfish node detection based on hierarchical game theory in IoT. EURASIP Journal on Wireless Communications and Networking, 1, 1–15.

    Google Scholar 

  20. Marti, S. (2000). Mitigating routing misbehavior in mobile ad hoc networks. International Conference on Mobile Computing and Networking. ACM, 255–265.

  21. Bigwood, G., & Henderson, T. (2011). IRONMAN: Using social networks to add incentives and reputation to opportunistic networks. IEEE Third International Conference on Privacy, Security, Risk and Trust. IEEE, 65–72.

  22. Lenin, G. D., Esteve, P. S., Ahmad, M. M., & Jordi, F. (2019). A novel dynamic reputation-based source routing protocol for mobile ad hoc networks. EURASIP Journal on Wireless Communications and Networking, 1, 1–14.

    Google Scholar 

  23. Li, N., & Das, S. K. (2010). RADON: Reputation-Assisted Data Forwarding in Opportunistic Networks. International Workshop on Mobile Opportunistic Networking. ACM, 8–14.

  24. Mei, A., & Stefa, J. (2012). Give2get: Forwarding in social mobile wireless networks of selfish individuals. IEEE Transactions on Dependable and Secure Computing, 9(4), 369–382.

    Article  Google Scholar 

  25. Chen, B. B., & Chan, M. C. (2010). MobiCent: A credit-based incentive system for disruption tolerant network. IEEE Infocom. IEEE, 14–19.

  26. Zhu, H., Lin, X., Lu, R., et al. (2009). Smart: A secure multilayer credit-based incentive scheme for delay-tolerant networks. IEEE Transactions on Vehicular Technology, 58(8), 4628–4639.

    Article  Google Scholar 

  27. Lu, R., Lin, X., Zhu, H., Shen, X., & Preiss, B. (2010). Pi: A practical incentive protocol for delay tolerant networks. IEEE Transactions on Wireless Communications, 9(4), 1483–1493.

    Article  Google Scholar 

  28. Shevade, U., Song, H. H., Qiu, L., et al. (2008). Incentive-aware routing in DTNs. International Conference on Network Protocols. IEEE, 238–247.

  29. Buttyan, L., Dora, L., Felegyhazi, M., et al. (2010). Barter trade improves message delivery in opportunistic networks. Ad Hoc Networks, 8(1), 1–14.

    Article  Google Scholar 

  30. Wu, E., Chen, T., Zhong, S., et al. (2010). A bargaining-based approach for incentive-compatible message forwarding in opportunistic networks. 2012 IEEE International Conference on Communications (ICC). IEEE, 789–793.

  31. Wu, F., Chen, T., Zhong, S., Qiao, C., & Chen, G. (2013). A game-theoretic approach to stimulate cooperation for probabilistic routing in opportunistic networks. IEEE Transactions on Wireless Communications, 12(4), 1573–1583.

    Article  Google Scholar 

  32. Wang, E. K., Chen, C. M., Yiu, S. M., et al. (2020). Incentive evolutionary game model for opportunistic social networks. Future Generation Computer Systems, 1, 14–29.

    Article  Google Scholar 

  33. Dai, W., Qiu, L., Wu, A., & Qiu, M. (2018). Cloud infrastructure resource allocation for big data applications. IEEE Transactions on Big Data, 4(3), 313–324.

    Article  Google Scholar 

  34. Li, Y., Yu, J., & You, X. (2013). An incentive protocol for opportunistic networks with resources constraint. Chinese Journal of Computers, 36(5), 947–956.

    Article  Google Scholar 

  35. Liu, Q., Liu, M., & Li, Y. (2015). Novel game-based incentive strategy for opportunistic networks. Application Research of Computers, 32(07), 2128–2132.

    Google Scholar 

  36. Lindgren, A., Doria, A., Olov, S. (2003). Probabilistic Routing in Intermittently Connected Networks. 7(3):19–20.

  37. Keränen, A., Ott, J., & Kärkkäinen, T. (2009). The ONE Simulator for DTN Protocol Evaluation. International Conference on Simulation Tools & Techniques. ICST, 1–10.

Download references

Acknowledgments

This work was supported by the National Natural Science Foundation of China (No. 61972136), MOE (Ministry of Education in China) Project of Humanities and Social Sciences (No.20YJAZH112), Hubei Provincial Department of Education Outstanding Youth Scientific Innovation Team Support Foundation (T2020017, T201410), Hubei Province Higher Education Teaching Research Project (No.2018432), the National Natural Science Foundation of China (No.61971339).

Author information

Authors and Affiliations

  1. School of Computer and Information Science, Hubei Engineering University, Xiaogan, 432000, Hubei, China

    Zenggang Xiong, Nan Xiao, Fang Xu, Xuemin Zhang, Qiong Xu & Conghuan Ye

  2. School of Computer Science and Information Engineering, Hubei University, Wuhan, 430062, Hubei, China

    Zenggang Xiong, Nan Xiao, Fang Xu & Qiong Xu

  3. School of Electronics and Information, Xian Polytechnic University, Xian Shanxi, 710048, China

    Kaibin Zhang

Authors
  1. Zenggang Xiong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nan Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fang Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xuemin Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Qiong Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Kaibin Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Conghuan Ye
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fang Xu.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xiong, Z., Xiao, N., Xu, F. et al. An Equivalent Exchange Based Data Forwarding Incentive Scheme for Socially Aware Networks. J Sign Process Syst 93, 249–263 (2021). https://doi.org/10.1007/s11265-020-01610-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11265-020-01610-6

Keywords

Search

Navigation