Power Assignment in Radio Networks with Two Power Levels

Research output: Contribution to journalConference articlepeer-review

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 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 an (9/5)-approximation algorithm for this problem whose running time is considerably higher.

Original languageEnglish
JournalDagstuhl Seminar Proceedings
Volume6481
StatePublished - 1 Jan 2007
EventGeometric Networks and Metric Space Embeddings 2006 - Wadern, Germany
Duration: 26 Nov 20061 Dec 2006

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Control and Systems Engineering

Fingerprint

Dive into the research topics of 'Power Assignment in Radio Networks with Two Power Levels'. Together they form a unique fingerprint.

Cite this