Link expiration times in mobile ad hoc networks

Mobile ad hoc networks are self configuring wireless networks without any fixed infrastructure. The members within such a network move independently from each other and their movements are not restricted in any case (in car to car ad-hoc networks nodes partly drive in the same direction). Hence, it is impossible to predict routes, link expiration or link failure times. We describe a simplified scenario with two stationary terminals and one terminal in motion. This simple approach allows a statistical derivation to forecast the average distance the moving relay is within the scope of the two other nodes. With these statistical calculations, predictions about the average link expiration times and deviations for different node velocities are possible, independent from the nodes' radio transmission ranges and the distances between each other.

[1]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

[2]  Christian Bettstetter,et al.  Smooth is better than sharp: a random mobility model for simulation of wireless networks , 2001, MSWIM '01.

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

[4]  R. H. Myers,et al.  Probability and Statistics for Engineers and Scientists , 1978 .

[5]  Taieb Znati,et al.  A path availability model for wireless ad-hoc networks , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[6]  Sung-Ju Lee,et al.  Mobility prediction in wireless networks , 2000, MILCOM 2000 Proceedings. 21st Century Military Communications. Architectures and Technologies for Information Superiority (Cat. No.00CH37155).