GNDA: Good Neighbor Node Detection for Selfish node Identification in Mobile Ad Hoc Networks

Abstract- There has been a growing research activity on wireless mobile ad hoc networks (MANETs) over the past years due to their potential useful civilian and military applications. The overhead of route discovery cannot be neglected due to high mobility of nodes in mobile ad hoc networks (MANETs) which leads to frequent path failures. NCPR (Neighbor Coverage-based probabilistic Rebroadcast protocol) is used to reduce routing overhead based on neighbor coverage knowledge and rebroadcast probability. There may be a chance of node selfishness which causes data loss throughout the network and reduces the packet delivery ratio. Node failure in network tends to high end-to-end delay. GNDA is proposed for this problem to identify the good neighbour nodes based on signal strength and flow capacity. The proposed approach decreases end-to-end delay and decreases packet delivery ratio to the greater extent by identifying the selfish nodes. And improves performance of routing protocol in terms of good communication and stable route. Index Terms- Mobile ad hoc networks, GNDA, signal strength, flow capacity, relative position, selfishnes