TY - GEN

T1 - Recent advances on approximation algorithms for minimum energy range assignment problems in ad-hoc wireless networks

AU - Peleg, David

PY - 2006

Y1 - 2006

N2 - Ad-hoc wireless networks have no wired infrastructure. Instead, they consist of a collection of radio stations S={1,2,...,n} deployed in a given region and connected by wireless links. Each station is assigned a transmission range, and a station t can correctly receive the transmission of another station s if and only if t is within the range of s. The overall range assignment, r: S→R+, determines a (directed) transmission graph Gr. The transmission range of a station depends on the energy invested by the station. In particular, the power Ps required by a station s to correctly transmit data to another station t must satisfy the inequality P s ≥ dist(s, t)α, where dist(s, t) is the Euclidean distance between s and t and α ≥ 1 is the distance-power gradient. The value of α may vary from 1 to more than 6 depending on the environment conditions at the location of the network (see [16]).

AB - Ad-hoc wireless networks have no wired infrastructure. Instead, they consist of a collection of radio stations S={1,2,...,n} deployed in a given region and connected by wireless links. Each station is assigned a transmission range, and a station t can correctly receive the transmission of another station s if and only if t is within the range of s. The overall range assignment, r: S→R+, determines a (directed) transmission graph Gr. The transmission range of a station depends on the energy invested by the station. In particular, the power Ps required by a station s to correctly transmit data to another station t must satisfy the inequality P s ≥ dist(s, t)α, where dist(s, t) is the Euclidean distance between s and t and α ≥ 1 is the distance-power gradient. The value of α may vary from 1 to more than 6 depending on the environment conditions at the location of the network (see [16]).

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

U2 - 10.1007/11922377_1

DO - 10.1007/11922377_1

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:77049096752

SN - 3540488227

SN - 9783540488224

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1

EP - 4

BT - Combinatorial and Algorithmic Aspects of Networking - Third Workshop, CAAN 2006, Revised Papers

T2 - 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2006

Y2 - 2 July 2006 through 2 July 2006

ER -