IDEAS home Printed from https://ideas.repec.org/a/igg/jitn00/v1y2009i2p66-81.html
   My bibliography  Save this article

User-Based Channel Assignment Algorithm in a Load-Balanced IEEE 802.11 WLAN

Author

Listed:
  • Mohamad Haidar

    (Ecole de Technolgie Superieure, Canada)

  • Hussain Al-Rizzo

    (University of Arkansas at Little Rock, USA)

  • Yupo Chan

    (University of Arkansas at Little Rock, USA)

  • Robert Akl

    (University of North Texas, USA)

Abstract

A new load balancing algorithm is presented based on power management of Access Points (APs) to reduce congestion at hot spots in Wireless Local Area Networks (WLANs) and to assign channels to APs The algorithm first finds the Most Congested Access Point (MCAP), then decreases its transmitted power in discrete steps, and the process continues until the users’ assignment which leads to a high balance index is reached. A new mathematical programming formulation is then applied to assign channels to the APs such that the Signal-to-Interference Ratio (SIR) at the users’ level is maximized. Results show that the algorithm is capable of reducing the overall congestion at hot spots in a WLAN and increases the SIR significantly for cases involving relatively large WLANs. In the process, network throughput is increased.

Suggested Citation

  • Mohamad Haidar & Hussain Al-Rizzo & Yupo Chan & Robert Akl, 2009. "User-Based Channel Assignment Algorithm in a Load-Balanced IEEE 802.11 WLAN," International Journal of Interdisciplinary Telecommunications and Networking (IJITN), IGI Global, vol. 1(2), pages 66-81, April.
    • Handle: RePEc:igg:jitn00:v:1:y:2009:i:2:p:66-81
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jitn.2009040105
    Download Restriction: no
    ---><---

    More about this item

    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:igg:jitn00:v:1:y:2009:i:2:p:66-81. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.