On the properties of giant component in wireless multi-hop networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2009, Pages 2556-2560

  Ta, Xiaoyuan ^a   Mao, Guoqiang ^a   Anderson, Brian D O ^b  

^a UNIVERSITY OF SYDNEY   (Australia)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC BEHAVIORS; CLOSED-FORM ANALYTICAL FORMULAE; DESIGN AND ANALYSIS; ENERGY SAVING; EUCLIDEAN DISTANCE; TRANSMISSION RANGES; UPPER BOUND; WIRELESS MULTI-HOP NETWORK;

AD HOC NETWORKS; ASYMPTOTIC ANALYSIS; ENERGY CONSERVATION; WIRELESS AD HOC NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS SENSOR NETWORKS;

EID: 70349663854     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5062186     Document Type: Conference Paper

References (14)

1. P. Gupta and P. Kumar, "Critical power for asymptotic connectivity in wireless networks," Stochastic Analysis, Control, Optimization and Applications, pp. 547-566, 1998.
2. C. Bettstetter, "On the Minimum Node Degree and Connectivity of a Wireless Multihop Network," in 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing, Lausanne, 2002, pp. 80-91.
3. F. Xue and P. Kumar, "The number of neighbors needed for connectivity of wireless networks," Wireless Networks, vol. 10, no. 2, pp. 169-181, 2004.
4. P. Santi and D. M. Blough, "The Critical Transimitting Range for Connectivity in Sparse Wireless Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 2, no. 1, pp. 25-39, 2003.
5. 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.
6. U. N. Raghavan, H. P. Thadakamalla, and S. Kumara, "Phase Transition and Connectivity in Distributed Wireless Sensor Networks," in 13th International Conference on Advanced Computing and Communications, Coimbatore, India, December, 2005.
7. B. Bollobas, Random Graphs. Academic Press, 1985.
8. G. Németh and G. Vattay, "Giant Clusters in Random Ad Hoc Networks," Physical Review E, vol. 67, no. 3, March, 2003.
9. M. Bradonjić, A. Hagberg, and A. G. Percus, "Giant Component and Connectivity in Geographical Threshold Graphs," in Algorithms and Models for the Web-Graph (WAW 2007), San Diego, CA USA, December, 2007, pp. 209-216.
10. M. Penrose, Random Geometric Graphs, 1st ed. Oxford: Oxford University Press, 2003.
11. E. Godehardt and J. Jaworski, "On the Connectivity of a Random Interval Graph," Random Structures and Algorithms, vol. 9, no. 1 and 2, pp. 137-161, 1996.
12. R. Meester and R. Roy, Continuum Percolation. Cambridge, UK: Cambridge University Press, 1996.
13. G. Han and A. M. Makowski, "Poisson convergence can yield very sharp transitions in geometric random graphs," in the Inaugural Workshop, Information Theory and Applications, San Diego (CA), February, 2006.
14. Online, "http://www.ee.usyd.edu.au/~guoqiang/papers/Ta09The. pdf".