LOOP FREE MULTIPATH LOCATION-AIDED ROUTING (LAR) IN MOBILE AD HOC NETWORKS

Abstract

Mobile Ad-hoc NETworks (MANETs) [1] are infrastructure-free networks of mobile nodes that communicate with each other wirelessly. The primary applications of such networks have been in disaster relief operations, military use, conferencing and environment sensing. There are several ad hoc routing schemes that have been proposed and extensively simulated or implemented as well. Some of them utilize position information (usually in two dimensional terms) to make routing decisions at each node. Our goal is to utilize two-dimensional (2D) position information to provide more efficient routing. for certain applications. Location-Aided Routing (LAR) [2], one of the protocol which uses the location information, limits the search space for a new route to a smaller "request zone" of the ad hoc network. This results in a significant reduction in the number of routing messages. We propose a new technique called "Loop Free Multipath Location Aided Routing" based on Location-Aided Routing (LAR) by Ko and Vaidya [2]. LMLAR is a loop free multipath routing algorithm which finds route for a given destination without any loops and minimizes the end-to-end delay by selecting the best path having minimum traffic among the existing ones. We have implemented LMLAR and validated through simulation using Glonmosim and studied its efficiency, scalability and other properties. We have used a random. waypoint mobility model and compare our LMLAR approach versus existing LAR in 2D for a range of traffic and mobility scenarios. Our simulation results demonstrate the performance benefits of LMLAR over LAR