Abstract
In this paper we consider a constrained version of the range assignment problem for wireless ad hoc networks, where the value the node transmitting ranges must be assigned in such a way that the resulting communication graph is strongly connected and the energy cost is minimum. We impose the further requirement of symmetry on the resulting communication graph. We also consider a weaker notion of symmetry, in which only the existence of a set of symmetric edges that renders the communication graph connected is required. Our interest in these problems is motivated by the fact that a (weakly) symmetric range assignment can be more easily integrated with existing higher and lower-level protocols for ad hoc networks, which assume that all the nodes have the same transmitting range. We show that imposing symmetry does not change the complexity of the problem, which remains NP-hard in two and three-dimensional networks. We also show that a weakly symmetric range assignment can reduce the energy cost considerably with respect to the homogeneous case, in which all the nodes have the same transmitting range, and that no further (asymptotic) benefit is expected from the asymmetric range assignment. Hence, the results presented in this paper indicate that weak symmetry is a desirable property of the range assignment.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Wireless LAN Medium Access Control and Physical Layer Specifications, Aug. 1999. IEEE 802.11 Standard (IEEE Computer Society LAN MAN Standards Committee).
D. Aldous, J.M. Steele, “Asymptotics for Euclidean Minimal Spanning Trees on Random Points”, Probab. Theory Relat. Fields, Vol. 92, pp. 247–258, 1992.
S. Basagni, D. Bruschi, I. Chlamtac, “A Mobility-Transparent Deterministic Broadcast Mechanism for Ad Hoc Networks”, IEEE Transactions on Networking, Vol. 7, n. 6, pp. 799–807, 1999.
D.M. Blough, P. Santi, “The Random Point Graph Model for Ad Hoc Networks and its Application to the Range Assignment Problem”, Tech. Rep. IMC-B4–0105, Istituto di Matematica Computazionale del CNR, Pisa - Italy, Dec. 2001.
D.M. Blough, M. Leoncini, G. Resta, P. Santi, “On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks”, Tech. Rep. IMC–B4–01–07, Istituto di Matematica Computazionale del CNR, Pisa – Italy, Nov. 2001.
G. Calinescu, I.I. Mandoiu, A Zelikovsky, “Symmetric Connectivity with Minimum Power Consumption in Radio Networks”, to appear in Proc. 2nd IFIP Conf. on Theoretical Computer Science, Montreal, August 2002.
A.E.F. Clementi, P. Penna, R. Silvestri, “Hardness Results for the Power Range Assignment Problem in Packet Radio Networks”, Proc. 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM/APPROX ‘89), LNCS (1671), pp. 197–208, 1999.
A.E.F. Clementi, P. Penna, R. Silvestri, “The Power Range Assignment Problem in Radio Networks on the Plane”, Proc. XVII Symposium on Theoretical Aspects of Computer Science (STAGS 00), LNCS (1770), pp. 651–660, 2000.
A.E.F. Clementi, A. Ferreira, P. Penna, S. Perennes, R. Silvestri, “The Minimum Range Assignment Problem on Linear Radio Networks”, Proc. 8th European Symposium on Algorithms (ESA 2000), LNCS (1879), pp. 143–154, 2000.
L.M. Feeney, M. Nilson, “Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment”, Proc. IEEE INFOCOM 2001, pp. 1548–1557, 2001.
M. Gerla, J. Tzu-Chen Tsai, “Multicluster, Mobile, Multimedia Radio Network”, Wireless Networks, Vol. 1, pp. 255–265, 1995.
E.N. Gilbert, H.O. Pollak, “Steiner Minimal Trees”, SIAM J. Appl. Math., Vol. 16, pp. 1–29, 1968.
M. Grossglauser, D. Tse, “Mobility Increases the Capacity of Ad Hoc Wireless Networks”, Proc. IEEE INFOCOM 2001, pp. 1360–1369, 2001.
P. Gupta, P.R. Kumar, “Critical Power for Asymptotic Connectivity in Wireless Networks”, Stochastic Analysis, Control, Optimization and Applications, Birkhauser, Boston, pp. 547–566, 1998.
P. Gupta, P.R. Kumar, “The Capacity of Wireless Networks”, IEEE Trans. Information Theory, Vol. 46, n. 2, pp. 388–404, 2000.
J. Li, C. Blake, D.S.J. De Couto, H. Imm Lee, R. Morris, “Capacity of Ad Hoc Wireless Networks”, Proc. ACM MOBICOM 2001, pp. 61–69, 2001.
L. Li, J.H. Halpern, P. Bahl, Y. Wang, R. Wattenhofer, “Analysis of a Cone-Based Distributed Topology Control Algorithm for Wireless Multi-hop Networks”, Proc. ACM PODC 2001, 2001.
L.M. Kirousis, E. Kranakis, D. Krizanc, A. Pelc, “Power Consumption in Packet Radio Networks”, Theoretical Computer Science, Vol. 243, pp. 289–305, 2000.
K. Pahlavan, A. Levesque, Wireless Information Networks, John Wiley and Sons, New York, 1995.
P. Panchapakesan, D. Manjunath, “On the Transmission Range in Dense Ad Hoc Radio Networks”, Proc. IEEE SPCOM 2001, 2001.
T.K. Philips, S.S. Panwar, A.N. Tantawi, “Connectivity Properties of a Packet Radio Network Model”, IEEE Trans. Information Theory,Vol. 35, n. 5, pp. 10441047, 1989.
P. Piret, “On the Connectivity of Radio Networks”, IEEE Trans. Information Theory, Vol. 37, n. 5, pp. 1490–1492, 1991.
G.J. Pottie, W.J. Kaiser, “Wireless Integrated Network Sensors”, Communications of the ACM, Vol. 43, n. 5, pp. 51–58, 2000.
R. Ramanathan, R. Rosales-Hain, “Topology Control of Multihop Wireless Networks using Transmit Power Adjustment”, Proc. IEEE Infocom 2000,pp. 404413, 2000.
S. Ramanathan, M. Steenstrup, “A Survey of Routing Techniques for Mobile Communication Networks”, Mobile Networks and Applications, Vol. 1, n. 2, pp. 89–104, 1996.
V. Rodoplu, T.H. Meng, “Minimum Energy Mobile Wireless Networks”, IEEE Journal Selected Areas in Comm., Vol. 17, n. 8, pp. 1333–1344, 1999.
P. Santi, D.M. Blough, F. Vainstein, “A Probabilistic Analysis for the Range Assignment Problem in Ad Hoc Networks”, Proc. ACM MobiHoc01, pp. 212–220, 2001.
J.M. Steele, “Growth Rates of Euclidean Minimal Spanning Trees with Power Weighted Edges”, Annals of Probability, Vol. 16, pp. 1767–1787, 1988.
J.E. Yukich, “Asymptotics for Weighted Minimal Spanning Trees on Random Points”, Stochastic Processes and their Appl., Vol. 85, pp. 123–128, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Blough, D.M., Leoncini, M., Resta, G., Santi, P. (2002). On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks. In: Baeza-Yates, R., Montanari, U., Santoro, N. (eds) Foundations of Information Technology in the Era of Network and Mobile Computing. IFIP — The International Federation for Information Processing, vol 96. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35608-2_7
Download citation
DOI: https://doi.org/10.1007/978-0-387-35608-2_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5275-5
Online ISBN: 978-0-387-35608-2
eBook Packages: Springer Book Archive