Distribution of Path Durations in Mobile Ad Hoc Networks and Path Selection

We investigate the issue of path selection in multihop wireless networks with the goal of identifying a scheme that can select a path with the largest expected duration. To this end, we first study the distribution of path duration. We show that, under a set of mild conditions, when the hop count along a path is large, the distribution of path duration can be well approximated by an exponential distribution even when the distributions of link durations are dependent and heterogeneous. Second, we investigate the statistical relation between a path duration and the durations of the links along the path. We prove that the parameter of the exponential distribution, which determines the expected duration of the path, is related to the link durations only through their means and is given by the sum of the inverses of the expected link durations. Based on our analytical results, we propose a scheme that can be implemented with existing routing protocols and select the paths with the largest expected durations. We evaluate the performance of the proposed scheme using ns-2 simulation.

[1]  Tracy Camp,et al.  Stationary distributions for the random waypoint mobility model , 2004, IEEE Transactions on Mobile Computing.

[2]  C C. Chiang,et al.  Routing in Clustered Multihop, Mobile Wireless Networks With Fading Channel , 1997 .

[3]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[4]  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.

[5]  Leandros Tassiulas,et al.  Energy conserving routing in wireless 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).

[6]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[7]  Paolo Santi,et al.  The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

[8]  Christian Wagner,et al.  The Spatial Node Distribution of the Random Waypoint Mobility Model , 2002, WMAN.

[9]  Kevin C. Almeroth,et al.  Towards realistic mobility models for mobile ad hoc networks , 2003, MobiCom '03.

[10]  Panagiotis Papadimitratos,et al.  Path set selection in mobile ad hoc networks , 2002, MobiHoc '02.

[11]  Jean-Yves Le Boudec.  Understanding the simulation of mobility models with Palm calculus , 2007, Perform. Evaluation.

[12]  H. Robbins.  A Stochastic Approximation Method , 1951 .

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

[14]  Guevara Noubir,et al.  Mobility models for ad hoc network simulation , 2004, IEEE INFOCOM 2004.

[15]  R.J. La,et al.  Maximizing Path Durations in Mobile Ad-Hoc Networks , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[16]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[17]  Daniel P. Heyman,et al.  Stochastic models in operations research , 1982 .

[18]  Malcolm R Leadbetter,et al.  On extreme values in stationary sequences , 1974 .

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

[20]  Ahmed Helmy,et al.  PATHS: analysis of PATH duration statistics and their impact on reactive MANET routing protocols , 2003, MobiHoc '03.

[21]  J. J. Garcia-Luna-Aceves,et al.  A routing protocol for packet radio networks , 1995, MobiCom '95.

[22]  Teresa H. Meng,et al.  Minimum energy mobile wireless networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[23]  Mario Gerla,et al.  A simulation study of table-driven and on-demand routing protocols for mobile ad hoc networks , 1999, IEEE Netw..

[24]  Sean P. Meyn,et al.  The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning , 2000, SIAM J. Control. Optim..

[25]  Xiaoyan Hong,et al.  A group mobility model for ad hoc wireless networks , 1999, MSWiM '99.

[26]  Jian Tang,et al.  Interference-aware routing in multihop wireless networks using directional antennas , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[27]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[28]  G. S. Watson,et al.  Extreme Values in Samples from $m$-Dependent Stationary Stochastic Processes , 1954 .

[29]  Jeffrey L. Arthur.  Stochastic Models in Operations Research, Volume I. (Daniel P. Heyman and Matthew J. Sobel) , 1983 .

[30]  Dimitri P. Bertsekas,et al.  Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology , 1981, IEEE Trans. Commun..

[31]  Malcolm R Leadbetter,et al.  Extremes and local dependence in stationary sequences , 1983 .

[32]  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).

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

[34]  Roy D. Yates,et al.  Probability and stochastic processes , 1998 .

[35]  Jian Tang,et al.  Interference-aware topology control and QoS routing in multi-channel wireless mesh networks , 2005, MobiHoc '05.

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

[37]  Ivan Stojmenovic,et al.  Ad hoc Networking , 2004 .

[38]  Hongqiang Zhang.  A NUMERICAL STUDY OF LINK AND PATH DURATIONS IN MOBILE AD HOC NETWORKS , 2006 .

[39]  Baruch Awerbuch,et al.  High Throughput Route Selection in Multi-rate Ad Hoc Wireless Networks , 2004, WONS.

[40]  Avideh Zakhor,et al.  Path Selection for Multi-Path Streaming in Wireless Ad Hoc Networks , 2006, 2006 International Conference on Image Processing.

[41]  Distribution of path durations in mobile ad-hoc networks - Palm's Theorem to the rescue , 2006, Comput. Networks.

[42]  Zygmunt J. Haas,et al.  A new routing protocol for the reconfigurable wireless networks , 1997, Proceedings of ICUPC 97 - 6th International Conference on Universal Personal Communications.