On optimal TTL sequence-based route discovery in MANETs

In on-demand multi-hop routing protocols for MANETs such as DSR and AODV, a fundamental requirement for peer-to-peer connectivity is to discover routes to a remote node via flooding of route request messages. Historically, such floodings of requests have used a TTL (time-to-live) large enough to reach all nodes in the network to ensure successful route discovery in one round of flooding. Recently (N. Chang et al., 2004), it was shown that the generic minimal cost flooding search problem can be solved via a sequence of floodings with an optimally chosen set of TTLs. The theoretical result, when applied to DSR route discovery, does not take into account optimizations such as route caching and overhearing, which can significantly reduce the frequency and the propagation range of route discovery operations. Equally importantly, the impact of using a sequence of floodings on the packet delivery delay is not clear. In this paper, we study the impact of using the optimal TTL sequence-based route discovery on DSR routing performance. Our results show when caching and overhearing are considered, the route discovery enhanced by an optimal TTL sequence has very similar overhead but higher delay than the basic route discovery mechanism.

[1]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[2]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[3]  Mingyan Liu,et al.  Revisiting the TTL-based controlled flooding search: optimality and randomization , 2004, MobiCom '04.

[4]  Wendi B. Heinzelman,et al.  Flooding Strategy for Target Discovery in Wireless Networks , 2003, MSWIM '03.

[5]  Charles E. Perkins,et al.  Scalability study of the ad hoc on‐demand distance vector routing protocol , 2003, Int. J. Netw. Manag..

[6]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[7]  J. Broch,et al.  Dynamic source routing in ad hoc wireless networks , 1998 .

[8]  Mingyan Liu,et al.  Random waypoint considered harmful , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[9]  Sanjay Jha,et al.  On the Optimization Trade-Offs of Expanding Ring Search , 2004, IWDC.

[10]  M. Gerla,et al.  GloMoSim: a library for parallel simulation of large-scale wireless networks , 1998, Proceedings. Twelfth Workshop on Parallel and Distributed Simulation PADS '98 (Cat. No.98TB100233).

[11]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[12]  Himabindu Pucha,et al.  Performance comparison of scalable location services for geographic ad hoc routing , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[13]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.