Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

An Incentive-Based Scheme for Mitigating Node Selfishness in Smart Opportunistic Mobile Networks

  • 225 Accesses

  • 1 Citations

Abstract

Smart Opportunistic Mobile Networks (SoMNs) are sparse mobile networks in which there may not exist complete end-to-end path between a pair of nodes. In view of the limited connectivity, SoMNs uses store-carry-and-forward approach for message forwarding. The study of behavior of nodes in such networks have been considered as a promising research area by many of the researchers. Due to limited resources and frequent network disconnections, nodes may not always behave rationally and in a cooperative manner for message forwarding. Some of the nodes may act selfishly due to want of resources, such as buffer space or energy, and reluctant to forward the message further in the network, which will degrade the overall routing performance. In this paper, we have proposed an incentive-based scheme to achieve cooperation among nodes by forming coalitions and stimulating the selfish nodes with reward points to actively participate in message forwarding. The proposed scheme uses coalitional game theory for relay selection and Shapley value for distributing the total reward points generated by the coalition among nodes. Experimental results using both synthetic and real-world traces show that the proposed method outperforms some of the existing protocols by in terms of higher delivery ratio, lower overhead ratio, lower delivery delay and lower energy dissipation.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

References

  1. 1.

    Boldrini, C., Conti, M., & Passarella, A. (2008). Context and resource awareness in opportunistic network data dissemination. In 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks, 2008. WoWMoM 2008. pp. 1–6. IEEE.

  2. 2.

    Chaintreau, A., Hui, P., Crowcroft, J., Diot, C., Gass, R., & Scott, J. (2007). Impact of human mobility on opportunistic forwarding algorithms. IEEE Transactions on Mobile Computing, 6(6), 606–620.

  3. 3.

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

  4. 4.

    Digital trends 2017 (2017). Accessed 3 Feb 2017. https://thenextweb.com/insights/2017/01/24/digital-trends-2017-report-internet.

  5. 5.

    Domingo, M. C. (2012). An overview of the internet of underwater things. Journal of Network and Computer Applications, 35(6), 1879–1890.

  6. 6.

    Eagle, N., & Pentland, A. S. (2006). Reality mining: Sensing complex social systems. Personal and Ubiquitous Computing, 10(4), 255–268.

  7. 7.

    Grasic, S., & Lindgren, A. (2014). Revisiting a remote village scenario and its dtn routing objective. Computer Communications, 48, 133–140.

  8. 8.

    Jim Lambers, Lecture 16 (2017) Accessed 3 Feb 2017. http://mathfaculty.fullerton.edu/mathews/numerical/gl.html.

  9. 9.

    Kazemeyni, F., Johnsen, E.B., Owe, O., & Balasingham, I. (2011) Group selection by nodes in wireless sensor networks using coalitional game theory. In 2011 16th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS), pp. 253–262. IEEE.

  10. 10.

    Keränen, A., Ott, J., & Kärkkäinen, T. (2009) The one simulator for dtn protocol evaluation. In Proceedings of the 2nd International Conference on Simulation Tools and Techniques, p. 55. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)

  11. 11.

    Lindgren, A., Doria, A., & Schelén, O. (2003). Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review, 7(3), 19–20.

  12. 12.

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

  13. 13.

    Ning, T., Yang, Z., Xie, X., & Wu, H. (2011). Incentive-aware data dissemination in delay-tolerant mobile networks. In 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON), pp. 539–547. IEEE.

  14. 14.

    Niyato, D., Wang, P., Saad, W., & Hjorungnes, A. (2010). Coalition formation games for improving data delivery in delay tolerant networks. In 2010 IEEE Global Telecommunications Conference (GLOBECOM 2010), pp. 1–5. IEEE.

  15. 15.

    Oualhaj, O.A., Kobbane, A., Elmachkour, M., Sabir, E., & Ben-Othman, J. (2015) A coalitional-game-based incentive mechanism for content caching in heterogeneous delay tolerant networks. In Wireless Communications and Mobile Computing Conference (IWCMC), 2015 International, pp. 987–992. IEEE.

  16. 16.

    Saad, W., Han, Z., Debbah, M., Hjorungnes, A., & Basar, T. (2009). Coalitional game theory for communication networks. IEEE Signal Processing Magazine, 26(5), 77–97.

  17. 17.

    Sobin, C., Raychoudhury, V., Marfia, G., & Singla, A. (2016). A survey of routing and data dissemination in delay tolerant networks. Journal of Network and Computer Applications, 67, 128–146.

  18. 18.

    Statista report (2017). Accessed 3 Feb 2017. https://www.statista.com/statistics/325706/global-internet-user-penetration.

  19. 19.

    Trono, E.M., Fujimoto, M., Suwa, H., Arakawa, Y., Takai, M., & Yasumoto, K. (2016) Disaster area mapping using spatially-distributed computing nodes across a dtn. In 2016 IEEE International Conference on Pervasive Computing and Communication Workshops (PerCom Workshops), pp. 1–6. IEEE.

  20. 20.

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

  21. 21.

    Viani, F., Robol, F., Polo, A., & Giarola, E. (2016). Wildlife road-crossing monitoring system: Advances and test-site validation. In 2016 10th European Conference on Antennas and Propagation (EuCAP), pp. 1–4. IEEE.

  22. 22.

    Wu, Y., Yang, Z., & Zhang, Q. (2015). A novel dtn routing algorithm in the geo-relaying satellite network. In 2015 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN), pp. 264–269. IEEE.

  23. 23.

    Zhu, H., Du, S., Gao, Z., Dong, M., & Cao, Z. (2014). A probabilistic misbehavior detection scheme toward efficient trust establishment in delay-tolerant networks. IEEE Transactions on Parallel and Distributed Systems, 25(1), 22–32.

  24. 24.

    Zhu, Y., Xu, B., Shi, X., & Wang, Y. (2013). A survey of social-based routing in delay tolerant networks: Positive and negative social effects. IEEE Communications Surveys & Tutorials, 15(1), 387–401.

Download references

Author information

Correspondence to C. C. Sobin.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Sobin, C.C., Raychoudhury, V. & Saha, S. An Incentive-Based Scheme for Mitigating Node Selfishness in Smart Opportunistic Mobile Networks. Wireless Pers Commun 96, 3533–3551 (2017). https://doi.org/10.1007/s11277-017-4139-x

Download citation

Keywords

  • Opportunistic networks
  • Incentive-based scheme
  • Coalition game theory
  • Shapley value