The message delay in mobile ad hoc networks

A stochastic model is introduced that accurately models the message delay in mobile ad hoc networks where nodes relay messages and the networks are sparsely populated. The model has only two input parameters: the number of nodes and the parameter of an exponential distribution which describes the time until two random mobiles come within communication range of one another. Closed-form expressions are obtained for the Laplace-Stieltjes transform of the message delay, defined as the time needed to transfer a message between a source and a destination. From this we derive both a closed-form expression and an asymptotic approximation (as a function of the number of nodes) of the expected message delay. As an additional result, the probability distribution function is obtained for the number of copies of the message at the time the message is delivered. These calculations are carried out for two protocols: the two-hop multicopy and the unrestricted multicopy protocols. It is shown that despite its simplicity, the model accurately predicts the message delay for both relay strategies for a number of mobility models (the random waypoint, random direction and the random walker mobility models).

[1]  Mostafa H. Ammar,et al.  Message ferrying: proactive routing in highly-partitioned wireless ad hoc networks , 2003, The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems, 2003. FTDCS 2003. Proceedings..

[2]  Zhen Liu,et al.  Capacity, delay and mobility in wireless ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  Qun Li,et al.  Sending messages to mobile users in disconnected ad-hoc wireless networks , 2000, MobiCom '00.

[4]  R.A. Guerin,et al.  Channel occupancy time distribution in a cellular radio system , 1987, IEEE Transactions on Vehicular Technology.

[5]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[6]  Ravi Mazumdar,et al.  Scaling laws for capacity and delay in wireless ad hoc networks with random mobility , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[7]  Philippe Flajolet,et al.  An introduction to the analysis of algorithms , 1995 .

[8]  E. Altman,et al.  Relaying in Mobile Ad Hoc Networks , 2004 .

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

[10]  GroeneveltR.,et al.  Relaying in mobile ad hoc networks , 2006 .

[11]  Christian Bettstetter,et al.  Mobility modeling in wireless networks: categorization, smooth movement, and border effects , 2001, MOCO.

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

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

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

[15]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

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

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

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

[19]  Hari Balakrishnan,et al.  Integrated Routing and Storage for Messaging Applications in Mobile Ad Hoc Networks , 2004, Mob. Networks Appl..