Research Article
Game Theoretic Model for Selfish Node Avoidance in Ad Hoc Networks
@INPROCEEDINGS{10.1007/978-3-642-27299-8_49, author={Upasana Dohare and D. Lobiyal and Sushil Kumar}, title={Game Theoretic Model for Selfish Node Avoidance in Ad Hoc Networks}, proceedings={Advances in Computer Science and Information Technology. Networks and Communications. Second International Conference, CCSIT 2012, Bangalore, India, January 2-4, 2012. Proceedings, Part I}, proceedings_a={CCSIT PART I}, year={2012}, month={11}, keywords={Game Theory Nash Equilibria Cooperation Selfish Node Ad Hoc Network}, doi={10.1007/978-3-642-27299-8_49} }- Upasana Dohare
D. Lobiyal
Sushil Kumar
Year: 2012
Game Theoretic Model for Selfish Node Avoidance in Ad Hoc Networks
CCSIT PART I
Springer
DOI: 10.1007/978-3-642-27299-8_49
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.
