Skip to main content
SpringerLink
Log in

RIS: A Reciprocal Incentive Scheme in Selfish Opportunistic Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Data dissemination in opportunistic networks has been extensively studied in recent years. In the resource-constrained opportunistic networks (e.g., the buffer size, the communication bandwidth and the energy of nodes are scarce), the nodes usually behave selfishly. In other words, the nodes only store data objects they are interested in and are not willing to contribute their own resource to store and forward data objects for other nodes. Their selfish behaviors significantly decrease the data dissemination performance of opportunistic networks. In this paper, a Reciprocal Incentive Scheme (RIS) is put forward, which can create a win-win situation for the Internet Service Provider, A-type nodes (the nodes which can freely download a large amount of content from the Internet) and B-type nodes (the nodes which must pay much money to the ISP for downloading data objects from the Internet by direct connection). When RIS is deployed in a selfish opportunistic network, we analyze in detail how these selfish nodes select data objects for their limited buffer to maximize their revenue. Furthermore, this paper investigates the relationship between the decisions made by the nodes and the scope of network information they maintain. Extensive trace-driven simulations based on MIT trace are conducted to evaluate the data dissemination performance of the whole system when all nodes try to maximize their revenue during the process of data dissemination. The results demonstrate that RIS could increase the average delivery ratio of each channel by 18 % and reduce the average receiving delay of each channel by 40 %. Moreover, B-type nodes only need to pay much less money for each subscribed data object than the situation where no incentive scheme is adopted in the system. The simulation results also show that the larger scope of network information the nodes maintain, the better performance RIS can achieve.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Pelusi L., Passarella A., Conti M. (2006) Opportunistic net-working: Data forwarding in disconnected mobile ad hoc networks. IEEE Communication Magazine. 44(11): 134–141

    Article  Google Scholar 

  2. Vahdat, A., & Becker, D., (2000). Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University, April.

  3. Lindgren, A., Doria, A., et al. (2004). Probabilistic routing in intermittently connected networks. In Proceedings of SAPIR.

  4. Spyropoulos T., Psounis K., Raghavendra C.S. (2008) Efficient routing in intermittently connected mobile networks: The multiple-copy case. IEEE/ACM Transactions on Network 16(1): 77–90

    Article  Google Scholar 

  5. Daly, E., & Haahr, M. (2007). Social network analysis for routing in disconnected delay-tolerant MANETs. In Proceedings of the MobiHoc 2007 (pp. 32–40). Montreal: ACM Press.

  6. Juang, P., Oki, H., Wang Yong, et al. (2002). Energy efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet[C]. In Proceedings of the 10th international conference on architectural support for programming languages and operating systems (pp. 96–107). New York: ACM.

  7. Motani, M., Srinivasan, V., & Nuggehalli, P. (2005). PeopleNet: Engineering a wireless virtual social network. In Proceedings of MobiCom (pp. 243–257).

  8. Hui, P., Chaintreau, A., Scott, J., Gass, R., Crowcroft, J., & Diot, C. (2005). Pocket switched networks and human mobility in conference environments. SIGCOMM Workshops

  9. Boldrini, C., Conti, M., & Passarella, A. (2008). ContentPlace: Social-aware data dissemination in opportunistic networks. In Proceedings of MSWiM (pp. 203–210).

  10. Yoneki, E., Hui, P., Chan, S., & Crowcroft, J., (2007). A socio-aware overlay for publish/subscribe communication in delay tolerant networks. In Proceedings of the 10th ACM symposium on modeling, analysis, and simulation of wireless and mobile systems (MSWiM ’07) (pp. 225–234). New York, NY, USA: ACM.

  11. Boldrini, C., Conti, M., & Passarella, A. (2008). Context and resource awareness in opportunistic network data dissemination. In Proceedings of IEEE AOC.

  12. Huang, Y., & Garcia-Molina, H. (2001). Publish/subscribe in a mobile environment. In Proceedings of the 2nd ACM international workshop on data engineering fowireless and mobile access (MobiDE’01) (pp. 27–34).

  13. Demmer, M., Fall, K., Koponen, T., & Shenker, S. (2007). Towards a modern communications API. In Proceedings of the 6th workshop on hot topics in networks (HotNets-VI), Atlanta, GA, November.

  14. Lenders, V., Karlsson, G., & May, M. (2007). Wireless Ad hoc podcasting. In Proceedings of IEEE SECON.

  15. Panagakis, A., Vaios, A., & Stavrakakis, I.(2007). On the effects of cooperation in DTNs. In Proceedings of COMSWARE (pp. 1–6).

  16. Li, Q., Zhu, S., & Cao, G. (2010). Routing in socially selfish delay tolerant networks. In Proceedings of IEEE INFOCOM (pp. 1–9).

  17. Resta, G., & Santi, P. (2009). The effects of node cooperation level on routing performance in delay tolerant networks. In Proceedings of IEEE SECON (pp. 1–9).

  18. Shevade, U., Song, H., Qiu, L., & Zhang, Y. (2008). Incentive-aware routing in DTNs. In Proceedings of IEEE ICNP (pp. 238–247).

  19. Chen B., & Chan, M. C. (2010). MobiCent: A credit-based incentive system for disruption tolerant network. In Proceedings of INFOCOM (pp. 1–9).

  20. Fall, K. (2003). A delay-tolerant network architecture for challenged internets. In Proceedings of SIGCOMM (pp. 27–34).

  21. Papadopouli, M., & Schulzrinne, H. (2001). Effects of power conservation, wireless coverage and cooperation on data dissemination among mobile devices. In Proceedings of ACM MobiHoc.

  22. Costa P., Mascolo C., Musolesi M., Picco G. P. (2008) Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoe networks. IEEE Journal of Selected Areas in Communication. 26(5): 748–760

    Article  Google Scholar 

  23. Greifenberg, J., & Kutscher, D. (2008). Efficient publish/subscribe-based multicast for opportunistic networking with self-organized resource utilization. In Proceedings of the 22nd international conference on advanced information networking and applications workshops (pp. 1708–1714), Washington, DC, USA: IEEE Computer Society.

  24. Ning T., Yang Z., Xie X., Wu H. (2011) Incentive-aware data dissemination in delay-tolerant mobile networks. SECON, Bangalore, pp 539–547

    Google Scholar 

  25. Buttyán L., Dóra L., Félegyházi M., Vajda I. (2010) Barter trade improves message delivery in opportunistic networks. Ad Hoc Networks 8(1): 1–14

    Article  Google Scholar 

  26. Dawande M., Kalagnanam J., Keskinocak P., Ravi R., Salman F. (2000) Approximation algorithms for the multiple knapsack problem with assignment restrictions. Journal of Combinatorial Optimization 4: 171–186

    Article  MathSciNet  MATH  Google Scholar 

  27. Ioannidis, S., Chaintreau, A., & Massoulie, L. (2009). Optimal and scalable distribution of content updates over a mobile social network. Proceedings of INFOCOM.

  28. Ross S.M. (2006) Introduction to probability models. Academic Press, London

    MATH  Google Scholar 

  29. Hsu, W., & Helmy, A. (2006). On nodal encounter patterns in wireless LAN traces. In IEEE proceedings of WiNMee ’06.

  30. Dong, Z., Song, G., Xie, K., & Wang J. (2009). An experimental study of large-scale mobile social network. In 18th international world wide web conference (WWW2009). April 20–24, USA.

  31. Milgram S. (1967) The small world problem. Psychology Today. 1: 60–67

    Google Scholar 

  32. Eagle N., Pentland A., Lazer D. (2009) Inferring social network structure using mobile phone data. Proceedings of the National Academy of Sciences 106(36): 15274–15278

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Command Automation, PLA University of Science and Technology, Nanjing, 210007, China

    Guangsong Zhao, Ming Chen & Xianglin Wei

Authors
  1. Guangsong Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ming Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xianglin Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guangsong Zhao.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhao, G., Chen, M. & Wei, X. RIS: A Reciprocal Incentive Scheme in Selfish Opportunistic Networks. Wireless Pers Commun 70, 1711–1734 (2013). https://doi.org/10.1007/s11277-012-0776-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-012-0776-2

Keywords

Search

Navigation