Performance analysis in comparison of conventional AODV and GNDA

Ad hoc Networks are variety of mobile nodes connected wireless without base station. In ad hoc networks, routes may be disconnected due to movement of nodes so route and topology are very difficult and challenging issues. In this paper, the effect of bad neighbor nodes in ad hoc routing is discussed and a method called Good Neighbor node Detection Algorithm (GNDA) is studied and reviewed. Ad hoc on-demand Distance Vector (AODV) supported with GNDA and conventional AODV are compared based on important performance metrics such as delay,throughput, packet delivery ratio and routing load. Finally suitable results are obtained in different scenarios and the significant performance enhancement achieved.