This Article 
 Bibliographic References 
 Add to: 
On the Phase Transition Width of K-Connectivity in Wireless Multihop Networks
July 2009 (vol. 8 no. 7)
pp. 936-949
Xiaoyuan Ta, The University of Sydney and National ICT Australia, Australia
Guoqiang Mao, The University of Sydney and National ICT Australia, Australia
Brian D.O. Anderson, The Australian National University, Canberra and National ICT Australia, Australia
In this paper, we study the phase transition behavior of k-connectivity (k=1,2,\ldots) in wireless multihop networks where a total of n nodes are randomly and independently distributed following a uniform distribution in the unit cube [0,1]^{d} (d=1,2,3), and each node has a uniform transmission range r(n). It has been shown that the phase transition of k-connectivity becomes sharper as the total number of nodes n increases. In this paper, we investigate how fast such phase transition happens and derive a generic analytical formula for the phase transition width of k-connectivity for large enough n and for any fixed positive integer k in d-dimensional space by resorting to a Poisson approximation for the node placement. This result also applies to mobile networks where nodes always move randomly and independently. Our simulations show that to achieve a good accuracy, n should be larger than 200 when k=1 and d=1; and n should be larger than 600 when k\le 3 and d=2,\ 3. The results in this paper are important for understanding the phase transition phenomenon; and it also provides valuable insight into the design of wireless multihop networks and the understanding of its characteristics.

[1] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A Survey on Sensor Networks,” IEEE Comm. Magazine, pp.102-114, Aug. 2002.
[2] R. Hekmat and P.V. Mieghem, “Connectivity in Wireless Ad-Hoc Networks with a Log-Normal Radio Model,” Mobile Networks and Applications, vol. 11, no. 3, pp.351-360, June 2006.
[3] C. Bettstetter, “On the Minimum Node Degree and Connectivity of a Wireless Multihop Network,” Proc. Third ACM Int'l Symp. Mobile Ad Hoc Networking and Computing, pp.80-91, 2002.
[4] V. Ravelomanana, “Extremal Properties of Three-Dimensional Sensor Networks with Applications,” IEEE Trans. Mobile Computing, vol. 3, no. 3, pp.246-257, July 2004.
[5] A. Tang, C. Florens, and S.H. Low, “An Empirical Study on the Connectivity of Ad Hoc Networks,” Proc. IEEE Aerospace Conf. vol. 3, pp.1333-1338, Mar. 2003.
[6] J. Aspnes, T. Eren, D.K. Goldenberg, A.S. Morse, W. Whiteley, Y.R. Yang, B.D.O. Anderson, and P.N. Belhumeur, “A Theory of Network Localization,” IEEE Trans. Mobile Computing, vol. 5, no. 12, pp.1663-1678, Dec. 2006.
[7] B.D.O. Anderson, P.N. Belhumeur, T. Eren, D.K. Goldenberg, and A.S. Morse, “Graphical Properties of Easily Localizable Sensor Networks,” Wireless Networks, Apr. 2007, doi:10.1007/s11276-007-0034-9.
[8] O. Younis, S. Fahmy, and P. Santi, “An Architecture for Robust Sensor Network Communications,” Int'l J. Distributed Sensor Networks vol. 1, nos. 3/4, pp.305-327, July 2005.
[9] M. Bahramgiri, M.T. Hajiaghayi, and V.S. Mirrokni, “Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorighms in Wireless Multi-Hop Networks,” Proc. IEEE Int'l Conf. Computer Comm. and Networks (ICCCN '02), pp.392-397, 2002.
[10] X.-Y. Li, P.-J. Wan, Y. Wang, and C.-W. Yi, “Fault Tolerant Deployment and Topology Control in Wireless Networks,” Proc. ACM MobiHoc, pp.117-128, June 2003.
[11] B. Krishnamachari, S.B. Wicker, and R. Bejar, “Phase Transition Phenomena in Wireless Ad Hoc Networks,” Proc. IEEE GLOBECOM, vol. 5, pp.2921-2925, 2001.
[12] G. Han and A.M. Makowski, “Poisson Convergence Can Yield Very Sharp Transitions in Geometric Random Graphs,” Proc. Inaugural Workshop, Information Theory and Applications, Feb. 2006.
[13] B. Krishnamachari, S. Wicker, R. Bejar, and C. Fernandez, “On the Complexity of Distributed Self-Configuration in Wireless Networks,” Telecomm. Systems, vol. 22, nos. 1-4, pp.33-59, 2003.
[14] P. Gupta and P. Kumar, “The Capacity of Wireless Networks,” IEEE Trans. Information Theory, vol. 46, no. 2, pp.388-404, 2000.
[15] P. Gupta and P. Kumar, “Critical Power for Asymptotic Connectivity in Wireless Networks,” Stochastic Analysis, Control, Optimization and Applications, pp.547-566, 1998.
[16] P.-J. Wan and C.-W. Yi, “Asymptotic Critical Transmission Radius and Critical Neighbor Number for k-Connectivity in Wireless AdHoc Networks,” Proc. ACM MobiHoc, pp.1-8, May 2004.
[17] X. Ta, G. Mao, and B.D.O. Anderson, “Evaluation of the Probability of K-Hop Connection in Homogeneous Wireless Sensor Networks,” Proc. IEEE GLOBECOM, pp.1279-1284, Nov. 2007.
[18] M. Penrose, “On K-Connectivity for a Geometric Random Graph,” Random Structures and Algorithms, vol. 15, pp.145-164, 1999.
[19] M. Desai and D. Manjunath, “On the Connectivity in Finite AdHoc Networks,” IEEE Comm. Letters, vol. 6, no. 10, pp.437-439, Oct. 2002.
[20] C.H. Foh and B.S. Lee, “A Closed Form Network Connectivity Formula for One-Dimensional Manets,” Proc. IEEE Int'l Conf. Comm. (ICC '04), vol. 6, pp.3739-3742, June 2004.
[21] G. Korniss, C.J. White, P.A. Rikvold, and M.A. Novotny, “Dynamic Phase Transition, Universality, and Finite-Size Scaling in the Two-Dimensional Kinetic Using Model in an Oscillating Field,” Physical Rev. E, vol. 63, no. 15, p. 016120, 2001.
[22] R. Cerf and E.N.M. Cirillo, “Finite Size Scaling in Three-Dimensional Bootstrap Percolation,” The Annals of Probability, vol. 27, no. 4, pp.1837-1850, 1999.
[23] M. Penrose, Random Geometric Graphs, first ed. Oxford University Press, 2003.
[24] P. Hall, Introduction to the Theory of Coverage Processes. Birkhauser, 1988.
[25] C. Bettstetter, “On the Connectivity of Ad Hoc Networks,” The Computer J., vol. 47, no. 4, pp.432-447, 2004.
[26] A. Nain, D. Towsley, B. Liu, and Z. Liu, “Properties of Random Direction Models,” Proc. IEEE INFOCOM, vol. 3, pp.1897-1907, Mar. 2005.
[27] B. Bollobas, Random Graphs. Academic Press, 1985.
[28] E. Friedgut and G. Kalai, “Every Monotone Graph Property Has a Sharp Threshold,” The Am. Math. Soc., vol. 124, pp.2993-3002, 1996.
[29] U.N. Raghavan, H.P. Thadakamalla, and S. Kumara, “Phase Transition and Connectivity in Distributed Wireless Sensor Networks,” Proc. 13th Int'l Conf. Advanced Computing and Comm., Dec. 2005.
[30] A. Goel, S. Rai, and B. Krishnamachari, “Sharp Threshold for Monothone Properties In Random Geometric Graphs,” Proc. ACM Symp. Theory of Computing (STOC '04), June 2004.
[31] X. Ta, G. Mao, and B.D.O. Anderson, “On the Probability of K-Hop Connection in Wireless Sensor Networks,” IEEE Comm. Letters, vol. 11, no. 8, pp.662-664, Aug. 2007.
[32] S. Janson, T. Luczak, and A. Rucinski, Random Graphs, first ed. John Wiley and Sons, 2000.
[33] F. Buckley and M. Lewinter, A Friendly Introduction to Graph Theory, first ed. Pearson Education, Inc., 2003.
[34] N.G.D. Bruijn, Asymptotic Methods in Analysis, second ed. Dover Publications, Inc., 1981.
[35] P. Santi and D.M. Blough, “The Critical Transimitting Range for Connectivity in Sparse Wireless Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 2, no. 1, pp.25-39, Jan.-Mar. 2003.
[36] B. Jackson and T. Jordan, “Connected Rigidity Matroids and Unique Realizations of Graphs,” J. Combinatorial Theory B, vol. 94, pp.1-29, 2005.
[37] C. Bettstetter and J. Zangl, “How to Achieve a Connected Ad Hoc Network with Homogeneous Range Asignment: An Analytical Study with Consideration of Border Effects,” Proc. Fourth IEEE Int'l Conf. Mobile and Wireless Comm. Networks (MWCN '02), pp.125-129, 2002.
[38] E. Godehardt and J. Jaworski, “On the Connectivity of a Random Interval Graph,” Random Structures and Algorithms, vol. 9, nos. 1-2, pp.137-161, 1996.
[39] 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. Networks (MWCN '01), pp.20-27, Aug. 2001.
[40] N.A.C. Cressie, Statistics for Spatial Data. John Wiley and Sons, 1991.
[41] C. Bettstetter and C. Hartmann, “Connectivity of Wireless Multihop Networks in a Shadow Fading Environment,” Wireless Networks, vol. 11, no. 5, pp.571-579, Sept. 2005.
[42] O. Dousse, F. Baccelli, and P. Thiran, “Impact of Interferences on Connectivity in Ad Hoc Networks,” Proc. IEEE INFOCOM, pp.1724-1733, Apr. 2003.

Index Terms:
Phase transition width, k-connectivity, connectivity, wireless multihop networks, transmission range, average node degree, random geometric graph.
Xiaoyuan Ta, Guoqiang Mao, Brian D.O. Anderson, "On the Phase Transition Width of K-Connectivity in Wireless Multihop Networks," IEEE Transactions on Mobile Computing, vol. 8, no. 7, pp. 936-949, July 2009, doi:10.1109/TMC.2008.170
Usage of this product signifies your acceptance of the Terms of Use.