International Journal of Knowledge Based Computer System

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Isolating Selfish Nodes and Analyzing Performance of Ad-Hoc Network Using Perfect Information Game Theory


Affiliations
1 Department of Information Science and Engineering, J.N.N. College of Engineering, Shimoga, Karnataka, India
     

   Subscribe/Renew Journal


Base stations are not required for the flow of information between different nodes. Nodes spontaneously get connected for transfer of information in the Ad-hoc network. Energy is the important resource used in the transfer of information from the one node to the other node. To preserve the energy, the nodes behave selfishly. These selfish nodes will stop the forwarding the information to the next node in the network by which the performance of the entire network degrades. To identify selfish nodes and isolate them from the network, perfect information game theory is used. Performance of the network is found out with and without using game theory approach for static and dynamic Ad-hoc network. The parameters considered to measure performance are throughput and End-to-End delay. Ns2 simulator is used for implementation.

Keywords

End-to-End Delay, Energy, Ns2 Simulator, Packet Delivery Ratio, Perfect Information Game Theory, Selfish Nodes.
Subscription Login to verify subscription
User
Notifications
Font Size


  • P. Patil, “Good neighbour node detection technique in Manets using QOS GNDA,” International Journal of Innovative Research in Engineering and Management (IJIREM), vol. 2, no. 3, pp. 43-48, May 2015.

  • C. E. Perkins, and E. M. Royer, “Ad-hoc on demand distance vector routing,” Second IEEE Workshop on Mobile Computing Systems and Applications, pp. 90-100, IEEE, 1999.

  • U. Singh, B. V. R. Reddy, and M. N. Hoda, “GNDA: Detecting good neighbor nodes in Adhoc routing protocol,” Second International Conference on Emerging Applications of Information Technology (EAIT), pp. 235-238, IEEE, 2011.

  • T. R. Reddy, and N. Sobharani, “Selective on-demand protocol for finding reliable nodes to form stable paths in ADHOC networks,” International Journal of Advanced Research in Computer Engineering and Technology (IJARCET), vol. 1, no. 5, pp. 21-24, 2012.

  • S. Gupta, C. K. Nagpal, and C. Singla, “Impact of selfish node concentration in MANETs,” International Journal of Wireless and Mobile Networks (IJWMN), vol. 3, no. 2, pp. 29-37, April 2011.

  • R. S. Komali, A. B. MacKenzie, and R. P. Gilles, “Effect of selfish node behavior on efficient topology design,” IEEE Transactions on Mobile Computing, vol. 7, no. 9, pp. 1057-1070, September 2008.

  • Md. A. K. Akhtar, and G. Sahoo, “Mathematical model for the detection of selfish nodes in MANETs,” International Journal of Computer Science and Informatics (IJCSI), vol. 1, no. 3, pp. 25-28, n.d.

  • G. Soni, and K. Chandravanshi, “A nobel defence scheme against selfish node attack in MANET,” International Journal on Computational Science and Applications (IJCSA), 2013. Available: arXiv:1307.3638

  • T. V. P. Sundararajan, and A. Shanmugam, “Performance analysis of selfish node aware routing protocol for mobile ad hoc networks,” Computer Networks and Internet Research Journal, vol. 9, no. 1, pp. 1-9, Delaware, USA, July 2009.

  • S. Zhong, J. Chen, and Y. R. Yang, “Sprite: A simple, cheat-proof, credit-based system for mobile ad-hoc networks,” Proc. INFOCOM, March-April 2003.


Abstract Views: 229

PDF Views: 0




  • Isolating Selfish Nodes and Analyzing Performance of Ad-Hoc Network Using Perfect Information Game Theory

Abstract Views: 229  |  PDF Views: 0

Authors

Samara Mubeen
Department of Information Science and Engineering, J.N.N. College of Engineering, Shimoga, Karnataka, India

Abstract


Base stations are not required for the flow of information between different nodes. Nodes spontaneously get connected for transfer of information in the Ad-hoc network. Energy is the important resource used in the transfer of information from the one node to the other node. To preserve the energy, the nodes behave selfishly. These selfish nodes will stop the forwarding the information to the next node in the network by which the performance of the entire network degrades. To identify selfish nodes and isolate them from the network, perfect information game theory is used. Performance of the network is found out with and without using game theory approach for static and dynamic Ad-hoc network. The parameters considered to measure performance are throughput and End-to-End delay. Ns2 simulator is used for implementation.

Keywords


End-to-End Delay, Energy, Ns2 Simulator, Packet Delivery Ratio, Perfect Information Game Theory, Selfish Nodes.

References