Statistical estimation of route expiry times in on-demand ad hoc routing protocols

On-demand routing protocols discover routes only when the source node has a packet to send to the destination. These protocols cache previously discovered routes in order to reduce the routing overheads as well as to decrease the route discovery latency. Mobility of the nodes in ad hoc wireless networks impact the performance of the routing protocols significantly. Mobility alters the validity and lifetime of routes cached by the nodes. However, due to the on-demand nature of the routing protocol, the link status will not get updated until it is used. For example, even if a link is up, some of the routes associated with this link may still be invalid because of other failed links in their paths. In this context, route expiry time plays a critical role in determining the performance of the routing protocol. Inefficient choice of route expiry time results in stale routes or early expired routes which degrade the overall performance of the protocol. The route expiry time should be chosen in such a way that it reduces the control overhead caused by the route discovery process. This paper presents a statistical model for estimating route expiry time adaptively, that results in reduced control traffic in on-demand ad hoc networks

[1]  Ahmed Helmy,et al.  Modeling path duration distributions in MANETs and their impact on reactive routing protocols , 2004, IEEE Journal on Selected Areas in Communications.

[2]  R. Pendse,et al.  Energy aware routing protocol (EARP) for ad-hoc wireless sensor networks , 2004, IEEE Global Telecommunications Conference Workshops, 2004. GlobeCom Workshops 2004..

[3]  Yuguang Fang,et al.  Predictive Caching Strategy for On-Demand Routing Protocols in Wireless Ad Hoc Networks , 2002, Wirel. Networks.

[4]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[5]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[6]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[7]  Chai-Keong Toh,et al.  Ad Hoc Mobile Wireless Networks , 2002 .

[8]  Zygmunt J. Haas,et al.  The zone routing protocol (zrp) for ad hoc networks" intemet draft , 2002 .

[9]  S. D. Kwon,et al.  A New Route Cache Scheme in On-Demand Routing Protocols for MANET , 2002 .

[10]  Ravi Pendse,et al.  Self-learning ad-hoc routing protocol , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[11]  Pietro Manzoni,et al.  Determination of Critical Transmission Range in Ad-Hoc Networks , 1999 .

[12]  J. Broach,et al.  The dynamic source routing protocol for mobile ad-hoc networks , 1998 .

[13]  R. Pendse,et al.  Control traffic analysis of on-demand routing protocols in ad-hoc wireless networks , 2005, VTC-2005-Fall. 2005 IEEE 62nd Vehicular Technology Conference, 2005..

[14]  Mario Gerla,et al.  GloMoSim: a library for parallel simulation of large-scale wireless networks , 1998 .

[15]  Xin Yu,et al.  A distributed adaptive cache update algorithm for the dynamic source routing protocol , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[16]  Mahesh K. Marina,et al.  Performance of route caching strategies in Dynamic Source Routing , 2001, Proceedings 21st International Conference on Distributed Computing Systems Workshops.

[17]  Zygmunt J. Haas,et al.  Optimizing route-cache lifetime in ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[18]  Leonard Kleinrock,et al.  Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals , 1984, IEEE Trans. Commun..

[19]  K. Namuduri,et al.  Traffic Analysis of On-Demand Routing Protocols in Ad-hoc Wireless Networks , 2007 .