Power Assignment in Radio Networks with Two Power Levels

  • Authors:

  • Paz Carmi;Matthew J. Katz

  • Affiliations:

  • Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel;Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel

  • Venue:
  • Algorithmica
  • Year:
  • 2007

  • Min-power strong connectivity

    APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques

  • On min-power steiner tree

    ESA'12 Proceedings of the 20th Annual European conference on Algorithms

Quantified Score

Hi-index 0.00

Visualization

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 we present an O(n2)-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. We also present a (9/5)-approximation algorithm for this problem whose running time is considerably higher.