
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Xiaoyuan Ta, Guoqiang Mao, Brian D.O. Anderson, "On the Phase Transition Width of KConnectivity in Wireless Multihop Networks," IEEE Transactions on Mobile Computing, vol. 8, no. 7, pp. 936949, July, 2009.  
BibTex  x  
@article{ 10.1109/TMC.2008.170, author = {Xiaoyuan Ta and Guoqiang Mao and Brian D.O. Anderson}, title = {On the Phase Transition Width of KConnectivity in Wireless Multihop Networks}, journal ={IEEE Transactions on Mobile Computing}, volume = {8}, number = {7}, issn = {15361233}, year = {2009}, pages = {936949}, doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2008.170}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Mobile Computing TI  On the Phase Transition Width of KConnectivity in Wireless Multihop Networks IS  7 SN  15361233 SP936 EP949 EPD  936949 A1  Xiaoyuan Ta, A1  Guoqiang Mao, A1  Brian D.O. Anderson, PY  2009 KW  Phase transition width KW  kconnectivity KW  connectivity KW  wireless multihop networks KW  transmission range KW  average node degree KW  random geometric graph. VL  8 JA  IEEE Transactions on Mobile Computing ER   
[1] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A Survey on Sensor Networks,” IEEE Comm. Magazine, pp.102114, Aug. 2002.
[2] R. Hekmat and P.V. Mieghem, “Connectivity in Wireless AdHoc Networks with a LogNormal Radio Model,” Mobile Networks and Applications, vol. 11, no. 3, pp.351360, 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.8091, 2002.
[4] V. Ravelomanana, “Extremal Properties of ThreeDimensional Sensor Networks with Applications,” IEEE Trans. Mobile Computing, vol. 3, no. 3, pp.246257, 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.13331338, 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.16631678, 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/s1127600700349.
[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.305327, July 2005.
[9] M. Bahramgiri, M.T. Hajiaghayi, and V.S. Mirrokni, “FaultTolerant and 3Dimensional Distributed Topology Control Algorighms in Wireless MultiHop Networks,” Proc. IEEE Int'l Conf. Computer Comm. and Networks (ICCCN '02), pp.392397, 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.117128, 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.29212925, 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 SelfConfiguration in Wireless Networks,” Telecomm. Systems, vol. 22, nos. 14, pp.3359, 2003.
[14] P. Gupta and P. Kumar, “The Capacity of Wireless Networks,” IEEE Trans. Information Theory, vol. 46, no. 2, pp.388404, 2000.
[15] P. Gupta and P. Kumar, “Critical Power for Asymptotic Connectivity in Wireless Networks,” Stochastic Analysis, Control, Optimization and Applications, pp.547566, 1998.
[16] P.J. Wan and C.W. Yi, “Asymptotic Critical Transmission Radius and Critical Neighbor Number for kConnectivity in Wireless AdHoc Networks,” Proc. ACM MobiHoc, pp.18, May 2004.
[17] X. Ta, G. Mao, and B.D.O. Anderson, “Evaluation of the Probability of KHop Connection in Homogeneous Wireless Sensor Networks,” Proc. IEEE GLOBECOM, pp.12791284, Nov. 2007.
[18] M. Penrose, “On KConnectivity for a Geometric Random Graph,” Random Structures and Algorithms, vol. 15, pp.145164, 1999.
[19] M. Desai and D. Manjunath, “On the Connectivity in Finite AdHoc Networks,” IEEE Comm. Letters, vol. 6, no. 10, pp.437439, Oct. 2002.
[20] C.H. Foh and B.S. Lee, “A Closed Form Network Connectivity Formula for OneDimensional Manets,” Proc. IEEE Int'l Conf. Comm. (ICC '04), vol. 6, pp.37393742, June 2004.
[21] G. Korniss, C.J. White, P.A. Rikvold, and M.A. Novotny, “Dynamic Phase Transition, Universality, and FiniteSize Scaling in the TwoDimensional 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 ThreeDimensional Bootstrap Percolation,” The Annals of Probability, vol. 27, no. 4, pp.18371850, 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.432447, 2004.
[26] A. Nain, D. Towsley, B. Liu, and Z. Liu, “Properties of Random Direction Models,” Proc. IEEE INFOCOM, vol. 3, pp.18971907, 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.29933002, 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 KHop Connection in Wireless Sensor Networks,” IEEE Comm. Letters, vol. 11, no. 8, pp.662664, 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.2539, Jan.Mar. 2003.
[36] B. Jackson and T. Jordan, “Connected Rigidity Matroids and Unique Realizations of Graphs,” J. Combinatorial Theory B, vol. 94, pp.129, 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.125129, 2002.
[38] E. Godehardt and J. Jaworski, “On the Connectivity of a Random Interval Graph,” Random Structures and Algorithms, vol. 9, nos. 12, pp.137161, 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.2027, 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.571579, Sept. 2005.
[42] O. Dousse, F. Baccelli, and P. Thiran, “Impact of Interferences on Connectivity in Ad Hoc Networks,” Proc. IEEE INFOCOM, pp.17241733, Apr. 2003.