TY - GEN
T1 - A linear downlink power control algorithm for wireless networks
AU - Mirsky, Yisroel
AU - Haddad, Yoram
PY - 2013/9/9
Y1 - 2013/9/9
N2 - In order to optimize its capacity, a cellular radio system can use a power control algorithm to provide the best overall carrier-to-interference ratio to all of its links. Unfortunately, the optimum algorithm has an impractical exponential complexity of O(2n). However, an approach to the problem has been overlooked. By taking advantage of propagation effects it is possible to split up a large problem into overlapping smaller ones. Doing so can achieve virtually identical results to that of the optimum algorithm in O(n) time (having a stable system). Moreover, this proposed algorithm is suitable as a distributed power control algorithm, whereas the optimum algorithm is a centralized one. This makes the proposed algorithm more suitable for today's cellular network architectures. Furthermore, it is also very easy to parallelize the proposed algorithm over multiple threads and cores offering a great added hardware advantage. In this paper we introduce this algorithm, prove its linear complexity and provide numerical results from simulations.
AB - In order to optimize its capacity, a cellular radio system can use a power control algorithm to provide the best overall carrier-to-interference ratio to all of its links. Unfortunately, the optimum algorithm has an impractical exponential complexity of O(2n). However, an approach to the problem has been overlooked. By taking advantage of propagation effects it is possible to split up a large problem into overlapping smaller ones. Doing so can achieve virtually identical results to that of the optimum algorithm in O(n) time (having a stable system). Moreover, this proposed algorithm is suitable as a distributed power control algorithm, whereas the optimum algorithm is a centralized one. This makes the proposed algorithm more suitable for today's cellular network architectures. Furthermore, it is also very easy to parallelize the proposed algorithm over multiple threads and cores offering a great added hardware advantage. In this paper we introduce this algorithm, prove its linear complexity and provide numerical results from simulations.
UR - http://www.scopus.com/inward/record.url?scp=84883401230&partnerID=8YFLogxK
U2 - 10.1109/WTS.2013.6566241
DO - 10.1109/WTS.2013.6566241
M3 - Conference contribution
AN - SCOPUS:84883401230
SN - 9781467350136
T3 - Wireless Telecommunications Symposium
BT - 2013 Wireless Telecommunications Symposium, WTS 2013
T2 - 12th Annual Wireless Telecommunications Symposium: Global Wireless Communications - Future Directions, WTS 2013
Y2 - 17 April 2013 through 19 April 2013
ER -