Abstract
In this paper, a Game Theoretic Model for selfish node avoidance routing is presented. A mathematical framework for rational node that maximizes its credits has been developed. Using game theory, it is verified that that this proposed model is robust and can achieve full cooperation among nodes. The proposed model is simulated using network simulator ns-2 The simulation results show that game theoretic model improves packet delivery ratio with the increase in number of the routes in the network. It is shown that game theoretic model with AODV can achieve higher packet delivery ratio for heavy traffic network in the presence of selfish nodes as compared to the original AODV. Further, it is observed that the packet delivery ratio of cooperative nodes decreases proportionally when the number of selfish nodes increases. Furthermore, it is also shown that game theoretic model with AODV gives low routing overheads.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggelou, G.: Mobile Ad Hoc Networks: from wireless LANs to 4G networks. Tata McGraw-Hills (2009)
Yang, J., Klein, A.G., Richard Brown III, D.: Natural Cooperation in Wireless Networks. IEEE Signal Processing Magazine 26(5), 98–106 (2009)
Song, C., Zhang, Q.: Protocol for stimulating packet forwarding in wireless ad hoc networks. IEEE Wireless Communication 17(5), 50–55 (2010)
Srinivasan, V., Nuggehalli, P., Chiasserini, C.F., Rao, R.R.: Cooperation in Wireless Ad Hoc Networks. In: IEEE INFOCOM, vol. 2, pp. 808–817 (March 2003)
Jaramillo, J.J., Srikant, R.: A game theory based reputation mechanism to incentivize cooperation in wireless ad hoc networks. Ad Hoc Networks 8(4) (June 2010)
Felegyhazi, M., Hubaux, J.-P., Buttyan, L.: Nash equilibria of packet forwarding strategies in wireless ad hoc networks. IEEE Trans. Mobile Computing 5, 463–476 (2006)
Liu, F., Dong, R., Liu, J., Xu, X.: A Reputation Mechanism to Stimulate Node Cooperation in Ad Hoc Networks. In: Third International Conference on Genetic and Evolutionary Computing (2009)
Michiardi, P., Molva, R.: CORE: a collaborative reputation mechanism to enforce node cooperation in mobile ad-hoc networks. In: Proceedings of the 6th IFIP Conference on Security Communications, and Multimedia, pp. 1–15. CMS (2002)
Anantvalee, T., Wu, J.: Reputation-based System for Encouraging the Cooperation of Nodes in Mobile Ad Hoc Networks. In: IEEE International Conference on Communications (2007)
Jerzy, K., Rafal, O.: A framework for detection of selfishness in multihop mobile ad hoc networks. Journal of Telecommunications and Information Technology (2), 34–40 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Dohare, U., Lobiyal, D.K., Kumar, S. (2012). Game Theoretic Model for Selfish Node Avoidance in Ad Hoc Networks. In: Meghanathan, N., Chaki, N., Nagamalai, D. (eds) Advances in Computer Science and Information Technology. Networks and Communications. CCSIT 2012. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 84. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27299-8_49
Download citation
DOI: https://doi.org/10.1007/978-3-642-27299-8_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27298-1
Online ISBN: 978-3-642-27299-8
eBook Packages: Computer ScienceComputer Science (R0)