Location-aided routing (LAR) in mobile ad hoc networks

Abstract

A mobile ad hoc network consists of wireless hosts that may move often. Movement of hosts results in a change in routes, requiring some mechanism for determining new routes. Several routing protocols have already been proposed for ad hoc networks. This paper suggests an approach to utilize location information (for instance, obtained using the global positioning system) to improve performance of routing protocols for ad hoc networks.By using location information, the proposed Location-Aided Routing (LAR) protocols limit the search 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 present two algorithms to determine the request zone, and also suggest potential optimizations to our algorithms.

A spatiotemporal communication protocol for wireless sensor networks

“…Geographic distance routing (GEDIR) [20] guarantees loop-free delivery in a collision-free network. LAR [13] by Ko and Vaidya improves the efficiency of the on-demand routing algorithms by restricting packet flooding in a specified "request zone. " Basagni et.…”

Location-Based Routing Scheme with Adaptive Request Zone in Mobile Ad Hoc Networks

“…However, some nodes may not locate in the path between the source and destination nodes have to process those packets thereby increasing the routing overhead and power consumption. To reduce the routing overhead, the location-based routing schemes have been proposed [4]- [8]. Those schemes use the concept of setting the expected zone and request zone for limiting the route searching area thereby decreasing route discovery packet.…”

“…Those schemes use the concept of setting the expected zone and request zone for limiting the route searching area thereby decreasing route discovery packet. The authors in [4] and [5] propose the request zones by using the rectangular shapes. The request zone in [6]- [8] is pro- posed by considering the triangular request zone that smaller size than those of [4] and [5].…”

On extracting consistent graphs in wireless sensor networks

“…The success of WSNs in these applications depends on the various services like routing, location discovery and time synchronisation. Extensive research on distributed algorithms for routing (Hong et al, 2002;Ko and Vaidya, 1998;Yu et al, 2001), location discovery (Bahl and Padmanabhan, 2000;Fang et al, 2005;He et al, 2003;Hightower and Borriello, 2001;Priyantha et al, 2000;Ray et al, 2003) and time synchronisation (Elson and Estrin, 2001;Ganeriwal et al, 2003) has already been done. Since the term 'mote' is still not an industry standard, we will refer to all such small, low power and autonomous sensing devices as 'nodes'.…”