Abstract
The minimum range assignment problem consists of assigning transmission ranges to the stations of a multi-hop packet radio network so as to minimize the total power consumption provided that the transmission range assigned to the stations ensures the strong connectivity of the network (i.e. each station can communicate with any other station by multi-hop transmission). The complexity of this optimization problem was studied by Kirousis, Kranakis, Krizanc, and Pelc (1997). In particular, they proved that, when the stations are located in a 3-dimensional Euclidean space, the problem is NP-hard and admits a 2-approximation algorithm. On the other hand, they left the complexity of the 2-dimensional case as an open problem.
As for the 3-dimensional case, we strengthen their negative result by showing that the minimum range assignment problem is APX-complete, so, it does not admit a polynomial-time approximation scheme unless P=NP.
We also solve the open problem discussed by Kirousis et al. by proving that the 2-dimensional case remains NP-hard.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alimonti, P., Kann, V.: Hardness of approximating problems on cubic graphs. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds.) CIAC 1997. LNCS, vol. 1203, pp. 288–298. Springer, Heidelberg (1997)
Arikan, E.: Some complexity results about packet radio networks. IEEE Transactions on Information Theory IT-30, 456–461 (1984)
Baker, B.S.: Approximation algorithms for np-complete problems on planar graphs. Journal of ACM 41, 153–180 (1994)
Berman, P., Karpinski, M.: On some tighter inapproximability results. Electronic Colloquium on Computational Complexity 29 (1998)
Eades, P., Symvonis, A., Whitesides, S.: Two algorithms for three dimensional orthogonal graph drawing. In: Graph Drawing 1996. LNCS, vol. 1190, pp. 139–154 (1996)
Ephemides, A., Truong, T.: Scheduling broadcast in multihop radio networks. IEEE Transactions on Communications 30, 456–461 (1990)
Garey, M.R., Johnson, D.S.: Computers and Intractability - A Guide to the Theory of NP-Completness. Freeman and Co., New York (1979)
Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica. Special Issue on Graph Drawing 16, 4–32 (1996) (Extended Abstract in 33-th IEEE FOCS (1992))
Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200. Springer, Heidelberg (1997)
Pahlavan, K., Levesque, A.: Wireless Information Networks. Wiley-Interscince, New York (1995)
Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and com- plexity classes. J. Comput. System Science 43, 425–440 (1991)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley Publishing Company, Inc., Reading (1994)
Ramanathan, S., Lloyd, E.: Scheduling boradcasts in multi-hop radio networks. IEEE/ACM Transactions on Networking 1, 166–172 (1993)
Ramaswami, R., Parhi, K.: Distributed scheduling of broadcasts in radio network. in: INFOCOM, pp. 497–504 (1989)
Valiant, L.: Universality considerations in vlsi circuits. IEEE Transactions on Computers C-30, 135–140 (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Clementi, A.E.F., Penna, P., Silvestri, R. (1999). Hardness Results for the Power Range Assignment Problem in Packet Radio Networks. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds) Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques. RANDOM APPROX 1999 1999. Lecture Notes in Computer Science, vol 1671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48413-4_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-48413-4_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66329-4
Online ISBN: 978-3-540-48413-4
eBook Packages: Springer Book Archive