Abstract
In this paper we study the problem of assigning transmission ranges to the nodes of a multi-hop packet radio network so as to minimize the total power consumed under the constraint that adequate power is provided to the nodes to ensure that the network is strongly connected (i.e., each node can communicate along some path in the network to every other node). Such assignment of transmission ranges is called complete. We also consider the problem of achieving strongly connected bounded diameter networks.
For the case of n+1 colinear points at unit distance apart (the unit chain) we give a tight asymptotic bound for the minimum cost of a range assignment of diameter h when h is a fixed constant and when h ∈ Ω(log n). When the distances between the colinear points are arbitrary, we give an O(n4) time dynamic programming algorithm for finding a minimum cost complete range assignment.
For points in three dimensions we show that the problem of deciding whether a complete range assignment of a given cost exists, is NP-hard. For the same problem we give an O(n2) time approximation algorithm which provides a complete range assignment with cost within a factor of two of the minimum. The complexity of this problem in two dimensions remains open, while the approximation algorithm works in this case as well.
Research supported in part by NSERC (Natural Sciences and Engineering Research Council of Canada) grant.
Preview
Unable to display preview. Download preview PDF.
References
E. Arikan, “Some Complexity Results about Packet Radio Networks,” IEEE Transactions on Information Theory, IT-30 (1984), pp. 681–685.
A. Ephremides and T. Truong, “Scheduling broadcasts in multihop radio networks,” IEEE Transactions on Communications, 30 (1990), pp. 456–461.
M.R. Garey and D.S. Johnson, “Computers and Intractability — A Guide to the Theory of NP-Completeness”, Freeman and Co., New York, 1979.
R. Kahn, S. Gronemeyer, J. Burchfiel and R. Kunzelman, “Advances in packet-radio technology,” Proceedings of the IEEE, 66 (1978), pp. 1468–1496.
K. Pahlavan and A. Levesque, “Wireless Information Networks,” Wiley-Interscience, New York, 1995.
S. Ramanathan and E. Lloyd, “Scheduling broadcasts in multi-hop radio networks,” IEEE/ACM Transactions on Networking, 1 (1993), pp. 166–172.
R. Ramaswami and K. Parhi, “Distributed scheduling of broadcasts in a radio network,” INFOCOM, 1989, pp. 497–504.
A. Sen and M. Huson, “A New Model for Scheduling Packet Radio Networks,” INFOCOM, 1996, pp. 1116–1124.
H. Takagi and L. Kleinrock, “Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals,” IEEE Transactions on Communications, COM-32 (1984), pp. 246–257.
L. Valiant, “Universality considerations in VLSI circuits,” IEEE Transactions on Computers, C-30 (1981), pp. 135–140.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A. (1997). Power consumption in packet radio networks. In: Reischuk, R., Morvan, M. (eds) STACS 97. STACS 1997. Lecture Notes in Computer Science, vol 1200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023473
Download citation
DOI: https://doi.org/10.1007/BFb0023473
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62616-9
Online ISBN: 978-3-540-68342-1
eBook Packages: Springer Book Archive