TY - GEN

T1 - Distributed power control in the SINR model

AU - Lotker, Zvi

AU - Parter, Merav

AU - Peleg, David

AU - Pignolet, Yvonne Anne

PY - 2011

Y1 - 2011

N2 - The power control problem for wireless networks in the SINR model requires determining the optimal power assignment for a set of communication requests such that the SINR threshold is met for all receivers. If the network topology is known to all participants, then it is possible to compute an optimal power assignment in polynomial time. In realistic environments, however, such global knowledge is usually not available to every node. In addition, protocols that are based on global computation cannot support mobility and hardly adapt when participants dynamically join or leave the system. In this paper we present and analyze a fully distributed power control protocol that is based on local information. For a set of communication pairs, each consisting of a sender node and a designated receiver node, the algorithm enables the nodes to converge to the optimal power assignment (if there is one under the given constraints) quickly with high probability. Two types of bounded resources are considered, namely, the maximal transmission energy and the maximum distance between any sender and receiver. It is shown that the restriction to local computation increases the convergence rate by only a multiplicative factor of O(log n + log log ψ max), where ψmax is the maximal power constraint of the network. If the diameter of the network is bounded by L max then the increase in convergence rate is given by O(log n + log log Lmax).

AB - The power control problem for wireless networks in the SINR model requires determining the optimal power assignment for a set of communication requests such that the SINR threshold is met for all receivers. If the network topology is known to all participants, then it is possible to compute an optimal power assignment in polynomial time. In realistic environments, however, such global knowledge is usually not available to every node. In addition, protocols that are based on global computation cannot support mobility and hardly adapt when participants dynamically join or leave the system. In this paper we present and analyze a fully distributed power control protocol that is based on local information. For a set of communication pairs, each consisting of a sender node and a designated receiver node, the algorithm enables the nodes to converge to the optimal power assignment (if there is one under the given constraints) quickly with high probability. Two types of bounded resources are considered, namely, the maximal transmission energy and the maximum distance between any sender and receiver. It is shown that the restriction to local computation increases the convergence rate by only a multiplicative factor of O(log n + log log ψ max), where ψmax is the maximal power constraint of the network. If the diameter of the network is bounded by L max then the increase in convergence rate is given by O(log n + log log Lmax).

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

U2 - 10.1109/infcom.2011.5935077

DO - 10.1109/infcom.2011.5935077

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

AN - SCOPUS:79960878775

SN - 9781424499212

T3 - Proceedings - IEEE INFOCOM

SP - 2525

EP - 2533

BT - 2011 Proceedings IEEE INFOCOM

T2 - IEEE INFOCOM 2011

Y2 - 10 April 2011 through 15 April 2011

ER -