Abstract
We study the power assignment problem in radio networks, where each radio station can transmit in one of two possible power levels, corresponding to two ranges – short and long. We show that this problem is NP-hard, and present a polynomial-time assignment algorithm, such that the number of transmitters that are assigned long range by the algorithm is at most (11/6) times the number of transmitters that are assigned long range by an optimal algorithm.
Research by P. Carmi is partially supported by a Kreitman Foundation doctoral fellowship. Research by M. Katz is partially supported by grant No. 2000160 from the U.S.-Israel Binational Science Foundation.
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.
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)
Althaus, E., Cǎlinescu, G., Mǎndoiu, I.I., Prasad, S., Tchervenski, N., Zelikovsky, A.: Power Efficient Range Assignment in Ad-hoc Wireless Networks. In: Proc. IEEE Wireless Communications and Networking Conference (WCNC), pp. 1889–1894 (2003)
Blough, D.M., Leoncini, M., Resta, G., Santi, P.: On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks. In: Proc. 2nd IFIP Int. Conf. Theoretical Computer Science, pp. 71–82 (2002)
Cǎlinescu, G., Mǎndoiu, I.I., Zelikovsky, A.Z.: Symmetric Connectivity with Minimum Power Consumption in Radio Networks. In: Proc. 2nd IFIP Int. Conf. Theoretical Computer Science, pp. 119–130 (2002)
Clementi, E.F., Crescenzi, P., Penna, P., Silvestri, R.: On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. In: Sympos. Theoretical Aspects of Computer Science (STACS), pp. 121–131 (2001)
Clementi, E.F., Ferreira, A., Penna, P., Perennes, S., Silvestri, R.: The Minimum Range Assignment Problem on Linear Radio Networks. In: European Sympos. on Algorithms (ESA), pp. 143–154 (2000)
Clementi, E.F., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.C.: On the Approximation Ratio of the MST-Based Heuristic for the Energy-Efficient Broadcast Problem in Static Ad-Hoc Radio Networks. In: Int. Parallel and Distributed Processing Sympos, IPDPS (2003)
Clementi, E.F., Penna, P., Silvestri, R.: On the Power Assignment Problem in Radio Networks. Electronic Colloquium on Computational Complexity (2000)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
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, pp. 363–374. Springer, Heidelberg (1997)
Liang, W.: Constructing Minimum-Energy Broadcast Trees in Wireless Ad Hoc Networks. In: Proc. 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 112–122 (2002)
Papadimitriou, I., Georgiadis, L.: Energy-aware Broadcasting in Wireless Networks. In: Proc. Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), pp. 267–277 (2003)
Valiant, L.: Universality Considerations in VLSI Circuits. IEEE Trans. computers 30, 135–140 (1981)
Wan, P.-J., Cǎlinescu, G., Li, X.-Y., Frieder, O.: Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks. ACM Wireless Networks 8, 607–617 (2002)
Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks. In: IEEE INFOCOM, pp. 585–594 (2000)
Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: Algorithms for Energy- Efficient Multicasting in Static Ad Hoc Wireless Networks. ACM Mobile Networks and Applications (MONET) 6, 251–263 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carmi, P., Katz, M.J. (2004). Power Assignment in Radio Networks with Two Power Levels. In: Hagerup, T., Katajainen, J. (eds) Algorithm Theory - SWAT 2004. SWAT 2004. Lecture Notes in Computer Science, vol 3111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27810-8_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-27810-8_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22339-9
Online ISBN: 978-3-540-27810-8
eBook Packages: Springer Book Archive