The Community for Technology Leaders
Subscribe
Issue No.03 - March (2012 vol.11)
pp: 504-517
Richard J. La , University of Maryland, College Park
Eunyoung Seo , University of Maryland, College Park
ABSTRACT
We investigate the communication range of the nodes necessary for network connectivity, which we call bidirectional connectivity, in a simple setting. Unlike in most of existing studies, however, the locations or mobilities of the nodes may be correlated through group mobility: nodes are broken into groups, with each group comprising the same number of nodes, and lie on a unit circle. The locations of the nodes in the same group are not mutually independent, but are instead conditionally independent given the location of the group. We examine the distribution of the smallest communication range needed for bidirectional connectivity, called the critical transmission range (CTR), when both the number of groups and the number of nodes in a group are large. We first demonstrate that the CTR exhibits a parametric sensitivity with respect to the space each group occupies on the unit circle. Then, we offer an explanation for the observed sensitivity by identifying what is known as a very strong threshold and asymptotic bounds for CTR.
INDEX TERMS
Mobile communication systems; wireless communication networks; network connectivity.
CITATION
Richard J. La, Eunyoung Seo, "Network Connectivity with a Family of Group Mobility Models", IEEE Transactions on Mobile Computing, vol.11, no. 3, pp. 504-517, March 2012, doi:10.1109/TMC.2011.37
REFERENCES
 [1] M.J.B. Appel and R.P. Russo, “The Connectivity of a Graph on Uniform Points on $[0, 1]^d$ ,” Statistics and Probability Letters, vol. 60, pp. 351-357, 2002. [2] F. Bai, N. Sadagopan, and A. Helmy, “IMPORTANT: A Framework to Systematically Analyze the Impact of Mobility on Performance of Routing Protocols for Adhoc Networks,” Proc. IEEE INFOCOM, Mar. 2003. [3] C. Bettstetter, “Mobility Modeling in Wireless Networks: Categorization, Smooth Movement, Border Effects,” ACM Mobile Computing and Comm. Rev., vol. 5, no. 3, pp. 55-67, July 2001. [4] B. Bollobás, Modern Graph Theory. Springer-Verlag, 1998. [5] T. Camp, J. Boleng, and V. Davies, “A Survey of Mobility Models for Ad Hoc Network Research,” Wireless Comm. and Mobile Computing, vol. 2, no. 5, pp. 483-502, Aug. 2002. [6] J. Diaz, D. Mitsche, and X. Pérez-Giménez, “Large Connectivity for Dynamic Random Geometric Graphs,” IEEE Trans. Mobile Computing, vol. 8, no. 6, pp. 821-835, June 2009. [7] P. Erdös and A. Rényi, “On Random Graphs, I,” Publicationes Mathematicae, vol. 6, pp. 290-297, 1959. [8] P. Erdös and A. Rényi, “The Evolution of Random Graphs,” Magyar Tud. Akad. Mat. Kutató Int. Közl, vol. 5, pp. 17-61, 1960. [9] G. Grimmett and D. Stirzaker, Probability and Random Processes, third ed. Oxford Univ., 2001. [10] P. Gupta and P.R. Kumar, “Critical Power for Asymptotic Connectivity in Wireless Networks,” Stochastic Analysis, Control, Optimization and Applications, pp. 547-566, 1998. [11] P. Gupta and P.R. Kumar, “The Capacity of Wireless Networks,” IEEE Trans. Information Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000. [12] G. Han, “Connectivity Analysis of Wireless Ad-Hoc Networks,” PhD dissertation, Dept. of Electrical and Computer Eng., Univ. of Maryland, College Park, 2007. [13] G. Han and A.M. Makowski, “Very Sharp Transitions in One-Dimensional MANETs,” Proc. IEEE Int'l Conf. Comm., vol. 1, pp. 217-222, June 2006. [14] G. Han and A.M. Makowski, “A Very Strong Zero-One Law for Connectivity in One-Dimensional Geometric Random Graphs,” IEEE Comm. Letters, vol. 11, no. 1, pp. 55-57, Jan. 2007. [15] X. Hong, M. Gerla, G. Pei, and C.C. Chiang, “A Group Mobility Model for Ad Hoc Wireless Networks,” Proc. Second ACM Int'l Workshop Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM '99), pp. 53-60, Aug. 1999. [16] A. Kashyap, S. Khuller, and M. Shayman, “Relay Placement for Higher Order Connectivity in Wireless Sensor Networks,” Proc. IEEE INFOCOM, pp. 1-12, 2006. [17] C.H. Kim, C.-H. Lee, and Y.C. Chung, “Bidirectional WDM Self-Healing Ring Network Based on Simple Bidirectional Add/Drop Amplifier Modules,” IEEE Photonics Technology Letters, vol. 10, no. 9, pp. 1340-1342, Sept. 1998. [18] F. Kuhn, R. Wattenhofer, and A. Zollinger, “Ad-Hoc Networks beyond Unit Disk Graphs,” Wireless Networks, vol. 14, no. 5, pp. 715-729, July 2007. [19] S.S. Kunniyur and S.S. Venkatesh, “Connectivity, Devolution, and Lacunae in Geometric Random Digraphs,” Proc. Workshop Information Theory and Applications, Feb. 2006. [20] G.L. McColm, “Threshold Functions for Random Graphs on a Line Segment,” Combinatorics, Probability and Computing, vol. 13, no. 3, pp. 373-387, May 2004. [21] P. Nain, D. Towsley, B. Liu, and Z. Liu, “Properties of Random Direction Models,” Proc. IEEE INFOCOM, Mar. 2005. [22] M.D. Penrose, Random Geometric Graphs. Oxford Univ., 2003. [23] M.D. Penrose, “A Strong Law for the Longest Edge of the Minimal Spanning Tree,” The Annals of Probability, vol. 27, no. 1, pp. 246-260, 1999. [24] T.S. Rappaport, Wireless Communications: Principles and Practice, second ed. Prentice Hall PTR, 2002. [25] P. Santi, “The Critical Transmitting Range for Connectivity In Mobile Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 4, no. 3, pp. 310-317, May/June 2005. [26] C. Scheideler, A.W. Richa, and P. Santi, “An O(log n) Dominating Set Protocol for Wireless Ad-Hoc Networks under the Physical Interference Model,” Proc. Ninth ACM Int'l Symp. Mobile Ad-Hoc Networking and Computing, pp. 91-100, 2008. [27] S.S. Venkatesh, “Connectivity of Metric Random Graphs,” http://www.seas.upenn.edu/~venkatespublications_chronological. html , 2011. [28] H. Zhang and J.C. Hou, “Asymptotic Critical Total Power for K-Connectivity of Wireless Networks,” IEEE/ACM Trans. Networking, vol. 16, no. 2, pp. 347-358, Apr. 2008.