TY - GEN

T1 - On the power of uniform power

T2 - 17th Annual European Symposium on Algorithms, ESA 2009

AU - Avin, Chen

AU - Lotker, Zvi

AU - Pignolet, Yvonne Anne

PY - 2009/11/2

Y1 - 2009/11/2

N2 - The throughput capacity of arbitrary wireless networks under the physical Signal to Interference Plus Noise Ratio (SINR) model has received much attention in recent years. In this paper, we investigate the question of how much the worst-case performance of uniform and non-uniform power assignments differ under constraints such as a bound on the area where nodes are distributed or restrictions on the maximum power available. We determine the maximum factor by which a non-uniform power assignment can outperform the uniform case in the SINR model. More precisely, we prove that in one-dimensional settings the capacity of a non-uniform assignment exceeds a uniform assignment by at most a factor of O(logL max ) when the length of the network is L max . In two-dimensional settings, the uniform assignment is at most a factor of O(logP max ) worse than the non-uniform assignment if the maximum power is P max . We provide algorithms that reach this capacity in both cases. Due to lower bound examples in previous work, these results are tight in the sense that there are networks where the lack of power control causes a performance loss in the order of these factors. As a consequence, engineers and researchers may prefer the uniform model due to its simplicity if this degree of performance deterioration is acceptable.

AB - The throughput capacity of arbitrary wireless networks under the physical Signal to Interference Plus Noise Ratio (SINR) model has received much attention in recent years. In this paper, we investigate the question of how much the worst-case performance of uniform and non-uniform power assignments differ under constraints such as a bound on the area where nodes are distributed or restrictions on the maximum power available. We determine the maximum factor by which a non-uniform power assignment can outperform the uniform case in the SINR model. More precisely, we prove that in one-dimensional settings the capacity of a non-uniform assignment exceeds a uniform assignment by at most a factor of O(logL max ) when the length of the network is L max . In two-dimensional settings, the uniform assignment is at most a factor of O(logP max ) worse than the non-uniform assignment if the maximum power is P max . We provide algorithms that reach this capacity in both cases. Due to lower bound examples in previous work, these results are tight in the sense that there are networks where the lack of power control causes a performance loss in the order of these factors. As a consequence, engineers and researchers may prefer the uniform model due to its simplicity if this degree of performance deterioration is acceptable.

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

U2 - 10.1007/978-3-642-04128-0_34

DO - 10.1007/978-3-642-04128-0_34

M3 - Conference contribution

AN - SCOPUS:70350426111

SN - 3642041272

SN - 9783642041273

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

SP - 373

EP - 384

BT - Algorithms - ESA 2009 - 17th Annual European Symposium, Proceedings

Y2 - 7 September 2009 through 9 September 2009

ER -