This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Critical Transmitting Range for Connectivity in Mobile Ad Hoc Networks
May/June 2005 (vol. 4 no. 3)
pp. 310-317
ASCII Text
x 
 
Paolo Santi, "The Critical Transmitting Range for Connectivity in Mobile Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 4, no. 3, pp. 310-317, May/June, 2005.
 
 
BibTex
x
 
@article{ 10.1109/TMC.2005.45,
author = {Paolo Santi},
title = {The Critical Transmitting Range for Connectivity in Mobile Ad Hoc Networks},
journal ={IEEE Transactions on Mobile Computing},
volume = {4},
number = {3},
issn = {1536-1233},
year = {2005},
pages = {310-317},
doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2005.45},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Mobile Computing
TI - The Critical Transmitting Range for Connectivity in Mobile Ad Hoc Networks
IS - 3
SN - 1536-1233
SP310
EP317
EPD - 310-317
A1 - Paolo Santi,
PY - 2005
KW - Critical transmitting range
KW - connectivity
KW - random waypoint model
KW - mobility modeling
KW - ad hoc networks.
VL - 4
JA - IEEE Transactions on Mobile Computing
ER -
 
In this paper, we study the critical transmitting range (CTR) for connectivity in mobile ad hoc networks. We prove that r_{\cal M}=c\sqrt{{\ln n\over \pi n}} for some constant c\ge 1, where r_{\cal M} is the CTR in the presence of {\cal M}{\hbox{-}}\rm like node mobility and n is the number of network nodes. Our result holds for an arbitrary mobility model {\cal M} such that: 1) {\cal M} is obstacle free and 2) nodes are allowed to move only within a certain bounded area. We also investigate in detail the case of random waypoint mobility, which is the most common mobility model used in the simulation of ad hoc networks. Denoting with r_p^w the CTR with random waypoint mobility when the pause time is set to p and node velocity is set to v, we prove that r_p^w= {p+ {0.521405\over v}\over p}\sqrt{{\ln n\over \pi n}} if p>0 and that r_0^w \gg \sqrt{{\ln n\over n}}. The results of our simulations also suggest that if n is large enough (n\ge 50), r_0^w is well approximated by {r\over 4}\ln n, where r is the critical range in case of uniformly distributed nodes. The results presented in this paper provide a better understanding of the behavior of a fundamental network parameter in the presence of mobility and can be used to improve the accuracy of mobile ad hoc network simulations.

[1] C. Bettstetter, “On the Minimum Node Degree and Connectivity of a Wireless Multihop Network,” Proc. ACM MobiHoc Conf., pp. 80-91, 2002.
[2] C. Bettstetter, “Mobility Modeling in Wireless Networks: Categorization, Smooth Movement, and Border Effects,” ACM Mobile Computer and Comm. Rev., vol. 5, no. 3, 2001.
[3] C. Bettstetter, G. Resta, and P. Santi, “The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 2, no. 3, pp. 257-269, July-Sept. 2003.
[4] C. Bettstetter and O. Krause, “On Border Effects in Modeling and Simulation of Wireless Ad Hoc Networks,” Proc. IEEE Int'l Conf. Mobile and Wireless Comm. Network (MWCN), 2001.
[5] C. Bettstetter and C. Wagner, “The Spatial Node Distribution of the Random Waypoint Model,” Proc. First German Workshop Mobile Ad Hoc Networks (WMAN), 2002.
[6] C. Bettstetter, “Smooth Is Better than Sharp: A Random Mobility Model for Simulation of Wireless Networks,” Proc. ACM Int'l Workshop Modeling, Analysis, and Simulation of Wireless and Mobile Systems (MSWiM), pp. 19-27, July 2001.
[7] C. Bettstetter, “Topology Properties of Ad Hoc Networks with Random Waypoint Mobility,” Proc. ACM MobiHoc Conf., 2003.
[8] D.M. Blough, G. Resta, and P. Santi, “A Statistical Analysis of the Long-Run Node Spatial Distribution in Mobile Ad Hoc Networks,” Proc. ACM Int'l Workshop Modeling, Analysis, and Simulation of Wireless and Mobile Systems (MSWiM), 2002.
[9] T. Camp, J. Boleng, V. Davies, “Mobility Models for Ad Hoc Network Simulations,” Wireless Comm. & Mobile Computing (WCMC), special issue on mobile ad hoc networking, 2002.
[10] J. Diaz, M.D. Penrose, J. Petit, and M. Serna, “Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs,” Combinatorics, Probability, and Computing, no. 6, pp. 489-511, 2000.
[11] P. Gupta and P.R. Kumar, “Critical Power for Asymptotic Connectivity in Wireless Networks,” Stochastic Analysis, Control, Optimization and Applications, pp. 547-566, 1998.
[12] P. Gupta and P.R. Kumar, “The Capacity of Wireless Networks,” IEEE Trans. Information Theory, vol. 46, no. 2, pp. 388-404, 2000.
[13] A. Jardos, E.M. Belding-Royer, K. Almeroth, and S. Suri, “Towards Realistic Mobility Models for Mobile Ad Hoc Networks,” Proc. ACM MobiCom Conf., pp. 217-229, 2003.
[14] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, pp. 153-181, 1996.
[15] S. Narayanaswamy, V. Kawadia, R.S. Sreenivas, and P.R. Kumar, “Power Control in Ad Hoc Networks: Theory, Architecture, Algorithm and Implementation of the COMPOW Protocol,” Proc. European Wireless Conf. 2002, pp. 156-162, 2002.
[16] P. Panchapakesan and D. Manjunath, “On the Transmission Range in Dense Ad Hoc Radio Networks,” Proc. IEEE Conf. Signal Processing and Comm., 2001.
[17] M.D. Penrose, “A Strong Law for the Largest Nearest Neighbour Link Between Random Points,” J. London Math. Soc., vol. 60, pp. 951-960, 1999.
[18] M.D. Penrose, “A Strong Law for the Longest Edge of the Minimal Spanning Tree,” Annals of Probability, vol. 27, no. 1, pp. 246-260, 1999.
[19] M.D. Penrose, “The Longest Edge of the Random Minimal Spanning Tree,” Annals of Applied Probability, vol. 7, no. 2, pp. 340-361, 1997.
[20] M.D. Penrose, “On k-Connectivity for a Geometric Random Graph,” Random Structures and Algorithms, vol. 15, no. 2, pp. 145-164, 1999.
[21] G. Resta and P. Santi, “An Analysis of the Node Spatial Distribution of the Random Waypoint Model for Ad Hoc Networks,” Proc. ACM Workshop Principles of Mobile Computing (POMC), pp. 44-50, Oct. 2002.
[22] E.M. Royer, P.M. Melliar-Smith, and L.E. Moser, “An Analysis of the Optimum Node Density for Ad Hoc Mobile Networks,” Proc. IEEE Int'l Conf. Comm. (ICC), June 2001.
[23] M. Sanchez, P. Manzoni, and Z.J. Haas, “Determination of Critical Transmitting Range in Ad Hoc Networks,” Proc. Multiaccess, Mobility and Teletraffic for Wireless Comm. Conf., 1999
[24] P. Santi and D.M. Blough, “The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 2, no. 1, pp. 25-39, Jan.-Mar. 2003.
[25] J. Yoon, M. Liu, and B. Noble, “Random Waypoint Considered Harmful,” Proc. IEEE Infocom Conf., Apr. 2003.
[26] J. Yoon, M. Liu, and B. Noble, “Sound Mobility Models,” Proc. ACM MobiCom Conf., pp. 205-216, Sept. 2003.

Index Terms:
Critical transmitting range, connectivity, random waypoint model, mobility modeling, ad hoc networks.
Citation:
Paolo Santi, "The Critical Transmitting Range for Connectivity in Mobile Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 4, no. 3, pp. 310-317, May-June 2005, doi:10.1109/TMC.2005.45
Usage of this product signifies your acceptance of the Terms of Use.