
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Paolo Santi, Douglas M. Blough, "The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 2, no. 1, pp. 2539, JanuaryMarch, 2003.  
BibTex  x  
@article{ 10.1109/TMC.2003.1195149, author = {Paolo Santi and Douglas M. Blough}, title = {The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks}, journal ={IEEE Transactions on Mobile Computing}, volume = {2}, number = {1}, issn = {15361233}, year = {2003}, pages = {2539}, doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2003.1195149}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Mobile Computing TI  The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks IS  1 SN  15361233 SP25 EP39 EPD  2539 A1  Paolo Santi, A1  Douglas M. Blough, PY  2003 KW  Wireless ad hoc networks KW  sparse ad hoc networks KW  sensor networks KW  energy consumption KW  topology control KW  critical transmitting range. VL  2 JA  IEEE Transactions on Mobile Computing ER   
Abstract—In this paper, we analyze the critical transmitting range for connectivity in wireless ad hoc networks. More specifically, we consider the following problem: Assume
[1] C. Bettstetter, On the Minimum Node Degree and Connectivity of a Wireless Multihop Network Proc. ACM Int'l. Symp. Mobile Ad Hoc Netw. and Comp. (MobiHoc), June 2002.
[2] D.M. Blough, M. Leoncini, G. Resta, and P. Santi, “On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks,” Proc. IFIP Conf. Theoretical Computer Science, pp. 7182, Aug. 2002.
[3] B. Bollobas, Random Graphs. London: Academic Press, 1985.
[4] G. Calinescu, I.I. Mandoiu, and A. Zelikovsky, “Symmetric Connectivity with Minimum Power Consumption in Radio Networks,” Proc. Second IFIP Conf. Theoretical Computer Science, pp. 119130, Aug. 2002.
[5] A.E.F. Clementi, P. Penna, and R. Silvestri, “Hardness Results for the Power Range Assignment Problem in Packet Radio Networks,” Proc. Second Int'l Workshop Approximation Algorithms for Combinatorial Optimization Problems (RANDOM/APPROX '99), pp. 197208, 1999.
[6] A.E.F. Clementi, P. Penna, and R. Silvestri, “The Power Range Assignment Problem in Radio Networks on the Plane,” Proc. XVII Symp. Theoretical Aspects of Computer Science (STACS '00), pp. 651660, 2000.
[7] A.E.F. Clementi, A. Ferreira, P. Penna, S. Perennes, and R. Silvestri, “The Minimum Range Assignment Problem on Linear Radio Networks,” Proc. Eighth European Symp. Algorithms (ESA 2000), pp. 143154, 2000.
[8] J. Diaz, M.D. Penrose, J. Petit, and M. Serna, “Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs,” Combinatorics, Probability, and Computing, no. 6, pp. 489511, 2000.
[9] O. Dousse, P. Thiran, and M. Hasler, “Connectivity in Ad Hoc and Hybrid Networks,” Proc. IEEE Infocom '02, 2002.
[10] D. Estrin, R. Govindan, J. Heidemann, and S. Kumar, “Next Century Challenges: Scalable Coordination in Sensor Networks,” Proc. Mobile Computing MOBICOM, pp. 263270, 1999.
[11] W. Feller, An Introduction to Probability Theory and Its Applications. New York: John Wiley and Sons, 1950.
[12] P. Gupta and P.R. Kumar, “Critical Power for Asymptotic Connectivity in Wireless Networks,” Stochastic Analysis, Control, Optimization and Applications, Boston: Birkhauser, pp. 547566, 1998.
[13] P. Gupta and P.R. Kumar, The Capacity of Wireless Networks IEEE Trans. Information Theory, vol. 46, no. 2, pp. 388404, 2000.
[14] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, Boston: Kluwer Academic, pp. 153181, 1996.
[15] L.M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc, “Power Consumption in Packet Radio Networks,” Theoretical Computer Science, vol. 243, pp. 289305, 2000.
[16] V.F. Kolchin, B.A. Sevast'yanov, and V.P. Chistyakov, Random Allocations. Washington, D.C.: H. Winston and Sons, 1978.
[17] L. Li, J.H. Halpern, P. Bahl, Y. Wang, and R. Wattenhofer, “Analysis of a ConeBased Distributed Topology Control Algorithm for Wireless MultiHop Networks,” Proc. ACM ACM Symp. Principles of Distributed Computing (PODC '01), 2001.
[18] A.W. Marshall and I. Olkin, Inequalities: Theory of Majorization and Its Applications. New York: Academic Press, 1979.
[19] R. Meester and R. Roy, Continuum Percolation. Cambridge, Mass.: Cambridge Univ. Press, 1996.
[20] E.M. Palmer, Graphical Evolution. New York: John Wiley and Sons, 1985.
[21] P. Panchapakesan and D. Manjunath, “On the Transmission Range in Dense Ad Hoc Radio Networks,” Proc. IEEE SPCOM '01, 2001.
[22] M.D. Penrose, “A Strong Law for the Longest Edge of the Minimal Spanning Tree,” The Annals of Probability, vol. 27, no. 1, pp. 246260, 1999.
[23] M.D. Penrose, “The Longest Edge of the Random Minimal Spanning Tree,” The Annals of Applied Probability, vol. 7, no. 2, pp. 340361, 1997.
[24] M.D. Penrose, “OnkConnectivity for a Geometric Random Graph,” Random Structures and Algorithms. vol. 15, no. 2, pp. 145164, 1999.
[25] T.K. Philips, S.S. Panwar, and A.N. Tantawi, Connectivity Properties of a Packet Radio Network Model IEEE Trans. Information Theory, vol. 35, pp. 10441047, 1989.
[26] P. Piret, On the Connectivity of Radio Networks IEEE Trans. Information Theory, vol. 37, pp. 14901492, 1991.
[27] G. Pottie and W. Kaiser, "Wireless Integrated Network Sensors," Comm. ACM, vol. 43, no. 5, May 2000, pp. 5158.
[28] R. Ramanathan and R. RosalesHain, Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment Proc. 19th Ann. Joint Conf. IEEE Computer and Comm. Soc. (INFOCOM), pp. 404413, Mar. 2000.
[29] V. Rodoplu and T.H. Meng, “Minimum Energy Mobile Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 17, no. 8, pp. 13331344, Aug. 1999.
[30] P. Santi and D.M. Blough, “An Evaluation of Connectivity in Mobile Wireless Ad Hoc Networks,” Proc. Int'l Conf. Dependable Systems and Networks (DSN '02), pp. 8998, 2002.
[31] P. Santi, D.M. Blough, and F. Vainstein, “A Probabilistic Analysis for the Range Assignment Problem in Ad Hoc Networks,” Proc. ACM MobiHoc '01, pp. 212220, 2001.
[32] L. Schwiebert, S.K.S. Gupta, and J. Weinmann, “Research Challenges in Wireless Networks of Biomedical Sensors,” Proc. ACM Mobicom '01, pp. 151165, 2001.
[33] A. Sen and M.L. Huson, “A New Model for Scheduling Packet Radio Networks,” Proc. IEEE Infocom '96, pp. 11161124, 1996.
[34] M. Srivastava, R. Muntz, and M. Potkonjak, "Smart Kindergarten: SensorBased Wireless Networks for Smart Developmental ProblemSolving Environments," Proc. 7th Int'l Conf. Mobile Computing and Networking (MobiCom 2001), ACM Press, New York, 2001, pp. 132138.
[35] D.C. Steere, A. Baptista, D. McNamee, C. Pu, and J. Walpole, “Research Challenges in Environmental Observation and Forecasting Systems,” Proc. ACM Mobicom '00, pp. 292299, 2000.
[36] Y. Xu, J. Heidemann, and D. Estrin, "GeographyInformed Energy Conservation for Ad Hoc Routing," Proc. 7th Ann. ACM/IEEE Int'l Conf. Mobile Computing and Networking (MobiCom), ACM Press, New York, 2001.