NEIGHBOUR-AWARE ROUTING PROTOCOL IN MANET TO MINIMIZE ROUTING OVERHEAD

Abstract

Mobile ad hoc networks (MANETs) are collections of wireless mobile nodes, constructed dynamically without the use of any existing network infrastructure or centralized administration. Due to the limited transmission range of wireless network interfaces, multiple hops may be needed for one node to exchange data with another one across the network. MANETs are characterized by limited power resource, limited transmission range, high mobility and limited bandwidth. Routing in MANETs can be accomplished through either single-path or multiple paths. Due to unpredictable behavior of wireless mobile nodes, frequent route failure occurs in the MANET, which results in performance degradation. In existing mechanisms of routing protocol, due to special control messages, route request storm, inefficient route discovery and duplicate packet processing, it generates many control packets in the network which leads to increase in overall routing overhead of the network. An efficient routing mechanism is needed to improve the performance of the network by reducing the routing overhead during route discovery process. Particular attention can be given on routing table size of intermediate nodes in dynamic route discovery mechanism.