Selfish Node Detection using Game Theory in MANET
Akansha Vij, Vishnu Sharma, Parma Nand · 2018 International Conference on Advances in Computing, Communication Control and Networking (ICACCCN) · 2018
Mobile Ad-hoc networks are type of wireless networks that have various characteristics like dynamic topology, limited resources, absence of central controller etc. Considering all the features of manet, nodes in manet work on the principle of co-operating with other nodes in network to help in various activities of the network like successful propagation data from source to destination. Some nodes in the network take advantage of co-operation and pretend to be co-operating with other nodes however they are saving on their resources like battery and drop the data whenever they receive it without sending it to the required destination or intermediate nodes to the destination. In this paper we discuss a game theoretic model to identify and isolate such nodes from the network. Since these nodes affect the functioning of entire network and bring delays to data propagation. Also, we make use of ESSDSR algorithm which transfers data basis the battery energy percentage present in the node. So, we have proposed a solution to isolate selfish nodes from the network. Our proposed algorithm first involves suspecting the selfish nodes and then verifying whether they are selfish nodes or not.