Neighbor Monitoring Mechanism to Solve Unidirectional Link Problem in MANET

Abstract

Mobile ad hoc network (MANET) is a multihop wireless network formed by a collection of mobile nodes communicating through radio links characterized by the absence of any preexisting infrastructure. Many of the proposed on-demand routing algorithms for MANET assume that the given network is an undirected graph. Some modifications or new algorithms have been proposed to solve the unidirectional link problems. Those methods eliminate unidirectional links from the route computation procedure or cost overhead very much. This paper proposes a new scheme called NMM (neighbor monitoring mechanism) to solve the problems. The paper introduces the NMM mechanism, analyzes its performance and is compared with hello and blacklisting mechanism. Results show that the NMM mechanism is more effective than blacklisting mechanism and costs less overhead than hello mechanism.