Location-based associativity routing for MANET

Mobile ad-hoc network (MANET) is a collection of wireless mobile nodes each working as a router and forming a dynamic topology of network. The location-aided routing algorithm of [Ko Young-Bae, and N. H. Vaidya, 2000] makes use of physical location information of destination node to reduce the search space for route discovery only, and not for data delivery. It does not cover route maintenance in case of broken links. The associativity-based routing algorithm of [Chai-Keong Toh, 1996] selects the route, based on node´s associativity states. Therein, the search space used to determine the route to the destination node is equal to the entire network space and due to broadcast, the amount of routing related traffic increases, thereby consuming large portion of bandwidth. In this paper, we combine the ideas of these two papers and propose an algorithm, which is useful to derive bandwidth-efficient and long-lived routes, resulting in the improvement of performance of mobile ad hoc networks. It is supported with complexity analysis.