Aging rules: what does the past tell about the future in mobile ad-hoc networks?

The study in mobile ad-hoc networks (MANET) is facing challenges brought by recent discovery of non-exponential behavior of the inter-contact time distribution of mobile nodes. In this paper, we analyze various characteristics of the relative mobility of a random pair of nodes in MANET to show that they produce inter-contact time with different aging properties. First, by fixing one node and resorting to the random walks on directed graphs, we mathematically prove that under four classes of stochastic mobility patterns, the resulting inter-contact times have constant/decreasing/increasing failure rate and new-better-than-used property. Then, we consider the case when both nodes are mobile and use simulation results to uncover the aging property of their inter-contact times under random waypoint models and random walk mobility models. This aging property tells us how to correctly relate the past experience of mobile nodes with their future behavior, thereby allowing tremendous opportunities brought by the memory structure in the non-exponential inter contact time, which would be impossible under the widely assumed exponentially distributed (memoryless) inter-contact time. As an application of our results, we establish for the first time that the approach based on exponential inter-contact time assumption can either under-estimate or over-estimate the actual system performance, under different stochastic mobility patterns indexed by their aging properties. Our results on aging properties also provide theoretic guidelines on how to exploit the memory structure toward better design of protocols under general mobility.

[1]  H. Bakht.  Routing protocols for mobile ad hoc networks , 2005 .

[2]  Donald F. Towsley,et al.  Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing , 2007, MobiCom '07.

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

[4]  D. West.  Introduction to Graph Theory , 1995 .

[5]  Martin Vetterli,et al.  Locating nodes with EASE: last encounter routing in ad hoc networks through mobility diffusion , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[6]  Zoltan Papp,et al.  Probabilistic reliability engineering , 1995 .

[7]  Pan Hui,et al.  Pocket Switched Networks and the Consequences of Human Mobility in Conference Environments , 2005, SIGCOMM 2005.

[8]  Tristan Henderson,et al.  The changing usage of a mature campus-wide wireless network , 2004, MobiCom '04.

[9]  Adriana Hornikova,et al.  Stochastic Ageing and Dependence for Reliability , 2007, Technometrics.

[10]  Donald F. Towsley,et al.  Properties of random direction models , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[11]  K. Psounis,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[12]  J. Keilson.  Markov Chain Models--Rarity And Exponentiality , 1979 .

[13]  Masaaki Kijima,et al.  Markov processes for stochastic modeling , 1997 .

[14]  Do Young Eun,et al.  Crossing over the bounded domain: from exponential to power-law inter-meeting time in MANET , 2007, MobiCom '07.

[15]  Stratis Ioannidis,et al.  A Brownian Motion Model for Last Encounter Routing , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[16]  Carl D. Meyer,et al.  Matrix Analysis and Applied Linear Algebra , 2000 .

[17]  David J. Aldous,et al.  Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .

[18]  Do Young Eun,et al.  Toward stochastic anatomy of inter-meeting time distribution under general mobility models , 2008, MobiHoc '08.

[19]  Vanessa Ann Davies,et al.  EVALUATING MOBILITY MODELS WITHIN AN AD HOC NETWORK , 2000 .

[20]  Bartosz Mielczarek,et al.  Scenario-based performance analysis of routing protocols for mobile ad-hoc networks , 1999, MobiCom.

[21]  Pan Hui,et al.  Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[23]  Jean-Yves Le Boudec,et al.  Power Law and Exponential Decay of Intercontact Times between Mobile Devices , 2010, IEEE Trans. Mob. Comput..

[24]  Ravi R. Mazumdar,et al.  Delay and Capacity Trade-o in Wireless Ad Hoc Networks with Random Mobility , 2004 .

[25]  Cauligi S. Raghavendra,et al.  Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

[26]  Vikram Srinivasan,et al.  Understanding Urban Interactions from Bluetooth Phone Contact Traces , 2007, PAM.

[27]  David G. Kendall,et al.  Unitary Dilations of One-Parameter Semigroups of Markov Transition Operators, and the Corresponding Integral Representations for Markov Processes with a Countable Infinity of States , 1959 .

[28]  Konstantinos Psounis,et al.  Performance analysis of epidemic routing under contention , 2006, IWCMC '06.

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

[30]  T. Spyropoulos,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[31]  Jean-Yves Le Boudec,et al.  Perfect simulation and stationarity of a class of mobility models , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[32]  Pan Hui,et al.  Pocket switched networks and human mobility in conference environments , 2005, WDTN '05.

[33]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[34]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[35]  Michele Garetto,et al.  Analysis of random mobility models with PDE's , 2006, MobiHoc '06.

[36]  Matthias Grossglauser,et al.  Age matters: efficient route discovery in mobile ad hoc networks using encounter ages , 2003, MobiHoc '03.

[37]  Zygmunt J. Haas,et al.  A new networking model for biological applications of ad hoc sensor networks , 2006, IEEE/ACM Transactions on Networking.

[38]  Matthias Grossglauser,et al.  Last Encounter Routing under Random Waypoint Mobility , 2004, NETWORKING.

[39]  Ger Koole,et al.  Message delay in MANET , 2005, SIGMETRICS '05.

[40]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.