GNDA: Detecting Good Neighbor Nodes in Adhoc Routing Protocol

With the popularization of Internet and formation of wireless technologies provide significant impact on Internet and Communication Technologies. These technologies have support of one of famous technique known as Adhoc Network. Adhoc Networks are assortment of mobile nodes connected by wireless links and also receiving attention in the scientific community. In adhoc networks, routes may be disconnected due to dynamic movement of nodes. So, route selection and topology combination is very difficult and challenging issue. Such networks are more vulnerable to both internal and external attacks due to presence of bad neighbor nodes. Observed problem affects performance of routing protocol in adhoc networks. In this paper, impact of bad neighbor nodes in adhoc routing is briefly discussed and proposed a method (GNDA) for identifying good neighbor nodes in the network. Besides, this approach is extended by adding extra parameters i.e. signal strength, flow capacity and relative position of a node in to the account. Proposed method optimizes the routing issues by using AODV. The result of this paper is an appropriate solution against neighbor attacks.