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. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Carmi, P., & Katz, M. J. (2004). Power assignment in radio networks with two power levels. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3111, 431–441. https://doi.org/10.1007/978-3-540-27810-8_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
