On the θ-coverage and connectivity of large random networks

IEEE Transactions on Information Theory

Volumn 52, Issue 6, 2006, Pages 2289-2299

  Xue, Feng ^a,b   Kumar, P R ^a  

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

^b INTEL CORPORATION   (United States)

Author keywords

Ad hoc networks; Connectivity; Coverage; Random geometric graphs; Sensor networks; Topology control; Transmission power control; Wireless networks

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; PROBABILITY; RANDOM PROCESSES; SENSOR DATA FUSION; TOPOLOGY;

AD HOC NETWORKS; CONNECTIVITY; COVERAGE; RANDOM GEOMETRIC GRAPHS; SENSOR NETWORKS; TOPOLOGY CONTROL; TRANSMISSION POWER CONTROL; WIRELESS NETWORKS;

COMPUTER NETWORKS;

EID: 33745143555     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.874384     Document Type: Article

References (30)

1. L. Kleinrock and J. A. Silvester, "Optimum transmission radii for packet radio networks or why six is a magic number," in Proc. IEEE Nat. Telecommun. Conf., Dec. 1978, pp. 4.3.1-4.3.5.
2. H. Takagi and L. Kleinrock, "Optimal transmission ranges for randomly distributed packet radio terminals," IEEE Trans. Commun., vol. 32, pp. 246-257, 1984.
3. T. Hou and V. Li, "Transmission range control in multihop packet radio networks," IEEE Trans. Commun., vol. 34, pp. 38-44, 1986.
4. R. Mathar and J. Mattfeldt, "Analyzing routing strategy NFP in multihop packet radio network on a line," IEEE Trans. Commun., vol. 43, pp. 977-988, 1995.
5. E. N. Gilbert, "Random plane networks," J. SIAM, vol. 9, pp. 533-543, Dec. 1961.
6. M. D. Penrose, "The longest edge of the random minimal spanning tree," Ann. Prob., vol. 7, no. 2, pp. 340-361, 1997.
7. P. Gupta and P. R. Kumar, "Critical power for asymptotic connectivity in wireless networks," in Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W. H. Fleming, W. M. McEneany, G. Yin, and Q. Zhang, Eds. Boston, MA: Birkhauser, 1998, pp. 657-566.
8. F. Xue and P. R. Kumar, "The number of neighbors needed for connectivity of wireless networks," Wireless Netw., vol. 10, pp. 169-181, 2004.
9. P.Wan and C.W. Yi, "Asymtotic critical transmission radius and critical neighbor for κ-connectivity in wireless ad hoc networks," in Proc. Fifth ACM Int. Symp. Mobile Ad-Hoc Networking and Computing (MobiHoc '04), Roppongi, Japan, May 24-26, 2004.
10. A. Balister, B. Bollobas, A. Sarkar, and M. Walters, "Connectivity of random κ-nearest neighbor graphs," Advances in Applied Probability, vol. 37, no. 1, pp. 1-24, 2005.
11. R. Wattenhofer, L. Li, P. Bahl, and Y. M. Wang, "Distributed topology control for power efficient operation in multi-hop wireless ad hoc networks," in Proc. IEEE INFOCOM 2001, Apr. 2001, pp. 1388-1397.
12. L. Li, J. Y. Halpern, V. Bahl, Y. M. Wang, and R. Wattenhofer, "Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks," in Proc. ACM Symp. Principles Distrib. Comput. (PODC), Newport, RI, Aug. 2001, pp. 264-273.
13. X.-Y. Li, "Topology control in wireless ad hoc networks," in Ad Hoc Networking, S. Basagni, M. Conti, S. Giordano, and I. Stojmenovic, Eds. Piscataway, NJ: IEEE Press, 2003.
14. R. Rajaraman, "Topology control and routing in ad hoc networks: A survey," SIGACT News, vol. 33, pp. 60-73, 2002.
15. A. Yao, "On constructing minimum spanning trees in κ-dimensional spaces and related problems," SIAM J. Comput., vol. 11, no. 4, pp. 721-736, 1982.
16. X.-Y. Li, P.-J. Wan, and Y. Wang, "Power efficient and sparse spanner for wireless ad hoc networks," in Proc. IEEE Int. Conf. Comput. Commun. Netw. (ICCCN '01), 2001, pp. 564-567.
17. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol. 46, pp. 388-404, Mar. 2000.
18. L.-L. Xie and P. R. Kumar, "A network information theory for wireless communication: Scaling laws and optimal operation," IEEE Trans. Inf. Theory, vol. 50, pp. 748-767, 2004.
19. M. Franceschetti, O. Dousse, D. Tse, and P. Thira, "Closing the gap in the capacity of random wireless networks," in Proc. IEEE Int. Symp. Inf. Theory (ISIT 2004), Chicago, IL, 27 Jun.-2 Jul. 2004, p. 438.
20. M. Penrose, Random Geometric Graphs. Cambridge, U.K.: Cambridge University Press, 2003.
21. H. Kesten, Percolation Theory for Mathematicians. Boston, MA: Birkhauser, 1982.
22. R. Meester and R. Roy, Continuum Percolation. Cambridge, U.K.: Cambridge University Press, 1996.
23. F. P. Preparata and M. I. Shamos, Computational Geometry. New York: Springer-Verlag, 1985.
24. B. Bollobas, Random Graphs, second ed. Cambridge, U.K.: Cambridge University Press, 2001.
25. G. Finn, "Routing and Addressing Problems in Large Metropolitan-Scale Internetworks," Inst. for Scientific Information, Tech. Rep. ISI Res. Rep. ISU/RR-87-180, 1987.
26. B. Karp and H. T. Kung, "GPSR: Greedy perimeter stateless routing for wireless networks," in Proc. Sixth Annu. Int. Conf. Mobile Comput. Netw. (MobiCom '00), 2000, pp. 243-254.
27. R. Jain, A. Puri, and R. Sengupta, "Geographical routing using partial information for wireless ad hoc networks," IEEE Pers. Commun., pp. 48-57, Feb. 2001.
28. F. Kuhn, R.Wattenhofer, and A. Zollinger, "Worst-case optimal and average-case efficient geometric ad-hoc routing," in Proc. Fourth ACM Int. Symp. Mobile Ad-Hoc Netw. Comput. (MobiHoc '03), 2003.
29. D. M. Blough, M. Leoncini, G. Resta, and P. Santi, "The K-neigh protocol for symmetric topology control in ad hoc networks," in Proc. Fourth ACM Int. Symp. Mobile Ad-Hoc Netw. Comput. (MobiHoc '03), Annapolis, MD, Jun. 1-3, 2003.
30. S. Kumar, T. H. Lai, and J. Balogh, "On k-coverage in a mostly sleeping sensor network," in Proc. Tenth Annual Int. Conf. on Mobile Computing and Networking (MobiCom '04), Philadephia, PA, 26 Sep.-1 Oct. 2004.