TY - GEN

T1 - Minimum power energy spanners in wireless ad hoc networks

AU - Abu-Affash, A. Karim

AU - Aschner, Rom

AU - Carmi, Paz

AU - Katz, Matthew J.

PY - 2010/6/15

Y1 - 2010/6/15

N2 - A power assignment is an assignment of transmission power to each of the nodes of a wireless network, so that the induced communication graph has some desired properties. The cost of a power assignment is the sum of the powers. The energy of a transmission path from node u to node v is the sum of the squares of the distances between adjacent nodes along the path. For a constant t > 1, an energy t-spanner is a graph G′, such that for any two nodes u and v, there exists a path from u to v in G′, whose energy is at most t times the energy of a minimum-energy path from u to v in the complete Euclidean graph. In this paper, we study the problem of finding a power assignment, such that (i) its induced communication graph is a 'good' energy spanner, and (ii) its cost is 'low'. We show that for any constant t > 1, one can find a power assignment, such that its induced communication graph is an energy t-spanner, and its cost is bounded by some constant times the cost of an optimal power assignment (where the sole requirement is strong connectivity of the induced communication graph). This is a very significant improvement over the best current result due to Shpungin and Segal [1], presented in last year's conference.

AB - A power assignment is an assignment of transmission power to each of the nodes of a wireless network, so that the induced communication graph has some desired properties. The cost of a power assignment is the sum of the powers. The energy of a transmission path from node u to node v is the sum of the squares of the distances between adjacent nodes along the path. For a constant t > 1, an energy t-spanner is a graph G′, such that for any two nodes u and v, there exists a path from u to v in G′, whose energy is at most t times the energy of a minimum-energy path from u to v in the complete Euclidean graph. In this paper, we study the problem of finding a power assignment, such that (i) its induced communication graph is a 'good' energy spanner, and (ii) its cost is 'low'. We show that for any constant t > 1, one can find a power assignment, such that its induced communication graph is an energy t-spanner, and its cost is bounded by some constant times the cost of an optimal power assignment (where the sole requirement is strong connectivity of the induced communication graph). This is a very significant improvement over the best current result due to Shpungin and Segal [1], presented in last year's conference.

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

U2 - 10.1109/INFCOM.2010.5462068

DO - 10.1109/INFCOM.2010.5462068

M3 - Conference contribution

AN - SCOPUS:77953302441

SN - 9781424458363

T3 - Proceedings - IEEE INFOCOM

BT - 2010 Proceedings IEEE INFOCOM

T2 - IEEE INFOCOM 2010

Y2 - 14 March 2010 through 19 March 2010

ER -