Power assignment in radio networks with two power levels

Paz Carmi; Matthew J. Katz

doi:10.1007/s00453-006-1230-1

Power assignment in radio networks with two power levels

Paz Carmi, Matthew J. Katz

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

27 Scopus citations

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(n ²)-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.

Original language	English
Pages (from-to)	183-201
Number of pages	19
Journal	Algorithmica
Volume	47
Issue number	2
DOIs	https://doi.org/10.1007/s00453-006-1230-1
State	Published - 1 Feb 2007

Keywords

Approximation algorithm
NP-hardness
Radio networks
Range assignment

ASJC Scopus subject areas

General Computer Science
Computer Science Applications
Applied Mathematics

Access to Document

10.1007/s00453-006-1230-1

Cite this

@article{5e50ccf59eb540fb80fd9cdee096fb88,

title = "Power assignment in radio networks with two power levels",

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(n 2)-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.",

keywords = "Approximation algorithm, NP-hardness, Radio networks, Range assignment",

author = "Paz Carmi and Katz, {Matthew J.}",

year = "2007",

month = feb,

day = "1",

doi = "10.1007/s00453-006-1230-1",

language = "English",

volume = "47",

pages = "183--201",

journal = "Algorithmica",

issn = "0178-4617",

publisher = "Springer New York",

number = "2",

}

TY - JOUR

T1 - Power assignment in radio networks with two power levels

AU - Carmi, Paz

AU - Katz, Matthew J.

PY - 2007/2/1

Y1 - 2007/2/1

N2 - 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(n 2)-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.

AB - 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(n 2)-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.

KW - Approximation algorithm

KW - NP-hardness

KW - Radio networks

KW - Range assignment

UR - http://www.scopus.com/inward/record.url?scp=33846865842&partnerID=8YFLogxK

U2 - 10.1007/s00453-006-1230-1

DO - 10.1007/s00453-006-1230-1

M3 - Article

AN - SCOPUS:33846865842

SN - 0178-4617

VL - 47

SP - 183

EP - 201

JO - Algorithmica

JF - Algorithmica

IS - 2

ER -

Power assignment in radio networks with two power levels

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this