On the critical total power for asymptotic k-connectivity in wireless networks

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2005, Pages 466-476

  Zhang, Honghai ^a   Hou, Jennifer ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Combinatorics; Critical power; Graph theory; Stochastic processes queuing theory; Wireless networks

Indexed keywords

COMBINATORICS; CRITICAL POWER; STOCHASTIC PROCESSES/QUEUEING THEORY; WIRELESS NETWORKS;

ALGORITHMS; POISSON DISTRIBUTION; QUEUEING THEORY; TOPOLOGY; WIRELESS TELECOMMUNICATION SYSTEMS;

TELECOMMUNICATION NETWORKS;

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

References (28)

1. D.M. Blough, M. Leoncini, G. Resta, and P. Santi. On the symmetric range assignment problem in wireless ad hoc networks. In Proc. of the 2nd IFIP International Conference on Theoretical Computer Science, pages 71-82, Montreal, Aug. 2002.
2. G. Calinescu and P-J. Wan. Range assignment for high connectivity in wireless ad hoc networks. In Adhoc-Now, 2003.
3. G. Cǎlinescu, I. L. Mǎndoiu, and A. Zelikovsky. Symmetric connectivity with minimum power consumption in radio networks. In Proc. of 17th IFIP World Computer Congress, pages 119-130, 2002.
4. A. E.F. Clementi, P. Penna, and R. Silvestri. On the power assignment problem in radio networks. Mobile Networks and Applications, 9(2), April 2004.
5. A.E.F. Clementi, P. Penna, and R. Silvestri. Hardness results for the power range assignment problem in packet radio networks. In Proceedings of the 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pages 197-208, 1999.
6. H. Dette and N. Henze. Some peculiar boundary phenomena for extremes of rth nearest neighbor links. Statistics and Probability Letters, 10:381-390, 1990.
7. O. Dousse, P. Thiran, and M. Hasler. Connectivity in ad-hoc and hybrid networks. In Proc. of IEEE Infocom 2002.
8. J. Gomez and A. Campbell. A case for variable-range transmission power control in wireless multihop networks. In Proc. of IEEE Infocom 2004.
9. M. Hajiaghayi, N. Immorlica, and V. S. MIrrokni. Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. In ACM Mobicom 2003, September 2003.
10. P. Hall. Introduction to the Theory of Coverage Processes. John Wiley and Sons, 1988.
11. L. M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc. Power consumption in packet radio networks. Theoretical Computer Science, 243(1-2):289-305, 2000.
12. L. Li, J. Halpern, V. Bahl, Y.M. Wang, and R. Wattenhofer. Analysis of a cone-based distributed topology control algorithm for wireless multihop networks. In Proceedings of ACM Symposium on Principle of Distributed Computing (PODC), pages 264-273, 2001.
13. N. Li and J. Hou. Topology control in heterogeneous wireless networks: problems and solutions. In Proc. of IEEE Infocom 2004, March 2004.
14. N. Li, J. Hou, and L. Sha. Design and analysis of a mst-based topology control algorithm. In Proc. of IEEE Infocom 2003, April 2003.
15. P.R. Kumar P. Gupta. Critical power for asymptotic connectivity in wireless networks. Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, 1998.
16. M. Penrose. Random Geometric Graphs. Oxford University Press, 2003.
17. M.D. Penrose. The longest edge of the random minimal spanning tree. Annals of Applied Probability, 7:340-361, 1997.
18. M.D. Penrose. On k-connectivity for a geometric random graph. Random Structures & Algorithms, 15:145-164, 1999.
19. T. K. Philips, S. S. Panwar, and A. N. Tantawi. Connectivity properties of a packet radio network model. IEEE Transaction on Information Theory, 35(5):1044-1047, 1989.
20. B. Rengarajan, J. Chen, S. Shakkottai, and T. S. Rappaport. Connectivity of sensor networks with power control. In Proc. of 37th Asilomar Conference on Signals, Systems and Computers, November 2003.
21. V. Rodoplu and T. H. Meng. Minimum energy mobile wireless networks. IEEE Journal of Selected Areas in Communications, 17(8):1633-1639, 1999.
22. P. Santi and D. M. Blough. The critical transmitting range for connectivity in sparse wireless ad hoc networks. IEEE transactions on Mobile Computing, 2(1):25-39, 2003.
23. S. Shakkottai, R. Srikant, and N. Shroff. Unreliable sensor grids: Coverage, connectivity and diameter. In Proc. of IEEE Infocom 2003.
24. J. M. Steele. Growth rates of euclidean minimal spanning trees with power weighted edges. The Annals of Probability, 16(4), 1988.
25. P-J. Wan and C. Yi. Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks. In ACM Mobihoc 2004.
26. F. Xue and P.R. Kumar. The number of neighbors needed for connectivity of wireless networks. To appear in Wireless Networks, 2003. URL:http://decision. csl.uiuc.edu/prkumar.
27. J. E. Yukich. Asymptotics for weighted minimal spanning trees on random points. Stochastic Processes and Their Applications, 85:123-128, 2000.
28. H. Zhang and J. Hou. On the critical total power for asymptotic k-connectivity in wireless networks. Technical Report UIUCDCS-R-2004-2454, Computer Science Department, University of Illinois at Urbana, Champaign, http://lion.cs.uiuc.edu/hzhang3/papers/k-connect.tech.ps, July 2004.