IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-0-387-30165-5_33.html

Load Balancing in Cellular Wireless Networks

In: Handbook of Optimization in Telecommunications

Author

Listed:
  • Sem Borst

    (Lucent Technologies, Bell Laboratories)

  • Georg Hampel

    (Lucent Technologies, Bell Laboratories)

  • Iraj Saniee

    (Lucent Technologies, Bell Laboratories)

  • Phil Whiting

    (Lucent Technologies, Bell Laboratories)

Abstract

We present a linear-programming approach for dynamic load balancing in CDMA networks. The linear program characterizes the minimum achievable base station load for a given configuration of mobiles at each time interval, and gives a useful benchmark for the potential gains from optimizing the power assignment. The solution of the linear program also offers valuable insight to the qualitative properties of the optimal power allocation. In particular, the structure of the optimal assignment reflects the critical notion that power allocation should not just be based on signal strength values but also on shadow prices which arise from load considerations. We develop a dual-ascent scheme for solving the linear program in a (mostly) distributed fashion with low communication overhead. Extensive numerical experiments demonstrate that there is scope for significant gains from balancing base station loads in typical scenarios.

Suggested Citation

  • Sem Borst & Georg Hampel & Iraj Saniee & Phil Whiting, 2006. "Load Balancing in Cellular Wireless Networks," Springer Books, in: Mauricio G. C. Resende & Panos M. Pardalos (ed.), Handbook of Optimization in Telecommunications, chapter 33, pages 941-978, Springer.
    • Handle: RePEc:spr:sprchp:978-0-387-30165-5_33
    DOI: 10.1007/978-0-387-30165-5_33
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-0-387-30165-5_33. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.