The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January-March (2003 vol.2)
pp: 25-39
ABSTRACT
<p><b>Abstract</b>—In this paper, we analyze the critical transmitting range for connectivity in wireless ad hoc networks. More specifically, we consider the following problem: Assume <tmath>n</tmath> nodes, each capable of communicating with nodes within a radius of <tmath>r</tmath>, are randomly and uniformly distributed in a <it>d</it>-dimensional region with a side of length <tmath>l</tmath>; how large must the transmitting range <tmath>r</tmath> be to ensure that the resulting network is connected with high probability? First, we consider this problem for stationary networks, and we provide tight upper and lower bounds on the critical transmitting range for one-dimensional networks and nontight bounds for two and three-dimensional networks. Due to the presence of the geometric parameter <tmath>l</tmath> in the model, our results can be applied to dense <it>as well as sparse</it> ad hoc networks, contrary to existing theoretical results that apply only to dense networks. We also investigate several related questions through extensive simulations. First, we evaluate the relationship between the critical transmitting range and the minimum transmitting range that ensures formation of a connected component containing a large fraction (e.g., 90 percent) of the nodes. Then, we consider the mobile version of the problem, in which nodes are allowed to move during a time interval and the value of <tmath>r</tmath> ensuring connectedness for a given fraction of the interval must be determined. These results yield insight into how mobility affects connectivity and they also reveal useful trade offs between communication capability and energy consumption.</p>
INDEX TERMS
Wireless ad hoc networks, sparse ad hoc networks, sensor networks, energy consumption, topology control, critical transmitting range.
CITATION
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. 25-39, January-March 2003, doi:10.1109/TMC.2003.1195149
REFERENCES
[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. 71-82, 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. 119-130, 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. 197-208, 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. 651-660, 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. 143-154, 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. 489-511, 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. 263-270, 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. 547-566, 1998.
[13] P. Gupta and P.R. Kumar, The Capacity of Wireless Networks IEEE Trans. Information Theory, vol. 46, no. 2, pp. 388-404, 2000.
[14] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, Boston: Kluwer Academic, pp. 153-181, 1996.
[15] L.M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc, “Power Consumption in Packet Radio Networks,” Theoretical Computer Science, vol. 243, pp. 289-305, 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 Cone-Based Distributed Topology Control Algorithm for Wireless Multi-Hop 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. 246-260, 1999.
[23] M.D. Penrose, “The Longest Edge of the Random Minimal Spanning Tree,” The Annals of Applied Probability, vol. 7, no. 2, pp. 340-361, 1997.
[24] M.D. Penrose, “Onk-Connectivity for a Geometric Random Graph,” Random Structures and Algorithms. vol. 15, no. 2, pp. 145-164, 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. 1044-1047, 1989.
[26] P. Piret, On the Connectivity of Radio Networks IEEE Trans. Information Theory, vol. 37, pp. 1490-1492, 1991.
[27] G. Pottie and W. Kaiser, "Wireless Integrated Network Sensors," Comm. ACM, vol. 43, no. 5, May 2000, pp. 51-58.
[28] R. Ramanathan and R. Rosales-Hain, Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment Proc. 19th Ann. Joint Conf. IEEE Computer and Comm. Soc. (INFOCOM), pp. 404-413, 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. 1333-1344, 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. 89-98, 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. 212-220, 2001.
[32] L. Schwiebert, S.K.S. Gupta, and J. Weinmann, “Research Challenges in Wireless Networks of Biomedical Sensors,” Proc. ACM Mobicom '01, pp. 151-165, 2001.
[33] A. Sen and M.L. Huson, “A New Model for Scheduling Packet Radio Networks,” Proc. IEEE Infocom '96, pp. 1116-1124, 1996.
[34] M. Srivastava, R. Muntz, and M. Potkonjak, "Smart Kindergarten: Sensor-Based Wireless Networks for Smart Developmental Problem-Solving Environments," Proc. 7th Int'l Conf. Mobile Computing and Networking (MobiCom 2001), ACM Press, New York, 2001, pp. 132-138.
[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. 292-299, 2000.
[36] Y. Xu, J. Heidemann, and D. Estrin, "Geography-Informed Energy Conservation for Ad Hoc Routing," Proc. 7th Ann. ACM/IEEE Int'l Conf. Mobile Computing and Networking (MobiCom), ACM Press, New York, 2001.
25 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool