• DocumentCode
    623074
  • Title

    A linear downlink power control algorithm for wireless networks

  • Author

    Mirsky, Yisroel ; Haddad, Yoram

  • Author_Institution
    Comput. Sci. & Networks Dept., Jerusalem Coll. of Technol., Jerusalem, Israel
  • fYear
    2013
  • fDate
    17-19 April 2013
  • Firstpage
    1
  • Lastpage
    7
  • Abstract
    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.
  • Keywords
    cellular radio; communication complexity; power control; radio links; carrier-to-interference ratio; cellular network architecture; cellular radio system; distributed power control algorithm; exponential complexity; linear complexity; linear downlink power control algorithm; wireless network; Approximation algorithms; Approximation methods; Complexity theory; Numerical models; Power control; Principal component analysis; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Telecommunications Symposium (WTS), 2013
  • Conference_Location
    Phoenix, AZ
  • ISSN
    1934-5070
  • Print_ISBN
    978-1-4673-5011-2
  • Type

    conf

  • DOI
    10.1109/WTS.2013.6566241
  • Filename
    6566241