Hardness Results for the Power Range Assignment Problem in Packet Radio Networks
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.
KeywordsTransmission Range Vertex Cover Hardness Result Communication Graph Multihop Radio Network
Unable to display preview. Download preview PDF.
- 1.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)Google Scholar
- 4.Berman, P., Karpinski, M.: On some tighter inapproximability results. Electronic Colloquium on Computational Complexity 29 (1998)Google Scholar
- 5.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)Google Scholar
- 7.Garey, M.R., Johnson, D.S.: Computers and Intractability - A Guide to the Theory of NP-Completness. Freeman and Co., New York (1979)Google Scholar
- 10.Pahlavan, K., Levesque, A.: Wireless Information Networks. Wiley-Interscince, New York (1995)Google Scholar
- 14.Ramaswami, R., Parhi, K.: Distributed scheduling of broadcasts in radio network. in: INFOCOM, pp. 497–504 (1989)Google Scholar