Minimum node degree and k-connectivity of a wireless multihop network in bounded area

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2007, Pages 1296-1301

  Qing, Ling ^a   Zhi, Tian ^a  

^a Michigan Technological University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTIVITY; TRANSMISSION RANGE; WIRELESS MULTIHOP NETWORK;

DATA COMMUNICATION SYSTEMS; PARAMETER ESTIMATION; STATISTICAL METHODS; TWO DIMENSIONAL;

WIRELESS SENSOR NETWORKS;

EID: 39349105966     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2007.249     Document Type: Conference Paper

References (10)

1. C. Bettstetter (2002): On the minimum node degree and connectivity of a wireless multihop network. In: Proceedings of ACM MOBICOM. 80-91
2. R. Rajaraman (2002): Topology control and routing in ad hoc networks: a survey. ACM SIGACT News. 33:60-73
3. P. Santi (2005): Topology control in wireless ad hoc and sensor networks. ACM Computing Surveys. 37:164-194
4. M. Penrose (1999): On k-connectivity for a geometric random graph. Random Structures and Algorithms. 15:145-164
5. P. Gupta, P. Kumar (1998): Critical power for asymptotic connectivity in wireless networks. In: Stochastic Analysis, Control, Optimization and Application. McEneaney W, Yin G, Zhang Q (Eds.). 547-566
6. C. Bettstetter (2002): On the connectivity of wireless multihop networks with homogeneous and inhomogeneous range assignment. In: Proceedings of IEEE Vehicular Technology Conference. 1706-1710
7. H. Zhang, J. Hou (2005): On the critical total power for asymptotic k-connectivity in wireless networks. In: Proceedings of IEEE INFOCOM. 466-476
8. P. Wan, C. Yi (2004): Asymptotic critical transmission radius and critical neighbor Number for k-connectivity in wireless ad hoc networks. In: Proceedings of ACM MOBICOM. 1-8
9. C. Bettstetter (2004): On the connectivity of ad hoc networks. The Computer Journal. 47:432-447
10. E. Ginsberg, D. Zaborowski (1975): The dilogarithm function of a real argument. Communications of the ACM. 18:200-202