Cell breathing techniques for load balancing in wireless LANs

Yigal Bejerano, Seung Jae Han

Research output: Contribution to journalArticle

141 Citations (Scopus)

Abstract

Maximizing network throughput while providing fairness is one of the key challenges in wireless LANs (WLANs). This goal is typically achieved when the load of access points (APs) is balanced. Recent studies on operational WLANs, however, have shown that AP load Is often substantially uneven. To alleviate such imbalance of load, several load balancing schemes have been proposed. These schemes commonly require proprietary software or hardware at the user side for controlling the user-AP association. In this paper we present a new load balancing technique by controlling the size of WLAN cells (i.e., AP's coverage range), which is conceptually similar to cell breathing in cellular networks. The proposed scheme does not require any modification to the users neither the IEEE 802.11 standard. It only requires the ability of dynamically changing the transmission power of the AP beacon messages. We develop a set of polynomial time algorithms that find the optimal beacon power settings which minimize the load of the most congested AP. We also consider the problem of network-wide mln-max load balancing. Simulation results show that the performance of the proposed method is comparable with or superior to the best existing association-based methods.

Original languageEnglish
Article number4796200
Pages (from-to)735-749
Number of pages15
JournalIEEE Transactions on Mobile Computing
Volume8
Issue number6
DOIs
Publication statusPublished - 2009 Jun 1

Fingerprint

Local area networks
Resource allocation
Power transmission
Throughput
Polynomials
Hardware

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{a5d0659999004dea9e7c33c1fa509007,
title = "Cell breathing techniques for load balancing in wireless LANs",
abstract = "Maximizing network throughput while providing fairness is one of the key challenges in wireless LANs (WLANs). This goal is typically achieved when the load of access points (APs) is balanced. Recent studies on operational WLANs, however, have shown that AP load Is often substantially uneven. To alleviate such imbalance of load, several load balancing schemes have been proposed. These schemes commonly require proprietary software or hardware at the user side for controlling the user-AP association. In this paper we present a new load balancing technique by controlling the size of WLAN cells (i.e., AP's coverage range), which is conceptually similar to cell breathing in cellular networks. The proposed scheme does not require any modification to the users neither the IEEE 802.11 standard. It only requires the ability of dynamically changing the transmission power of the AP beacon messages. We develop a set of polynomial time algorithms that find the optimal beacon power settings which minimize the load of the most congested AP. We also consider the problem of network-wide mln-max load balancing. Simulation results show that the performance of the proposed method is comparable with or superior to the best existing association-based methods.",
author = "Yigal Bejerano and Han, {Seung Jae}",
year = "2009",
month = "6",
day = "1",
doi = "10.1109/TMC.2009.50",
language = "English",
volume = "8",
pages = "735--749",
journal = "IEEE Transactions on Mobile Computing",
issn = "1536-1233",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

Cell breathing techniques for load balancing in wireless LANs. / Bejerano, Yigal; Han, Seung Jae.

In: IEEE Transactions on Mobile Computing, Vol. 8, No. 6, 4796200, 01.06.2009, p. 735-749.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Cell breathing techniques for load balancing in wireless LANs

AU - Bejerano, Yigal

AU - Han, Seung Jae

PY - 2009/6/1

Y1 - 2009/6/1

N2 - Maximizing network throughput while providing fairness is one of the key challenges in wireless LANs (WLANs). This goal is typically achieved when the load of access points (APs) is balanced. Recent studies on operational WLANs, however, have shown that AP load Is often substantially uneven. To alleviate such imbalance of load, several load balancing schemes have been proposed. These schemes commonly require proprietary software or hardware at the user side for controlling the user-AP association. In this paper we present a new load balancing technique by controlling the size of WLAN cells (i.e., AP's coverage range), which is conceptually similar to cell breathing in cellular networks. The proposed scheme does not require any modification to the users neither the IEEE 802.11 standard. It only requires the ability of dynamically changing the transmission power of the AP beacon messages. We develop a set of polynomial time algorithms that find the optimal beacon power settings which minimize the load of the most congested AP. We also consider the problem of network-wide mln-max load balancing. Simulation results show that the performance of the proposed method is comparable with or superior to the best existing association-based methods.

AB - Maximizing network throughput while providing fairness is one of the key challenges in wireless LANs (WLANs). This goal is typically achieved when the load of access points (APs) is balanced. Recent studies on operational WLANs, however, have shown that AP load Is often substantially uneven. To alleviate such imbalance of load, several load balancing schemes have been proposed. These schemes commonly require proprietary software or hardware at the user side for controlling the user-AP association. In this paper we present a new load balancing technique by controlling the size of WLAN cells (i.e., AP's coverage range), which is conceptually similar to cell breathing in cellular networks. The proposed scheme does not require any modification to the users neither the IEEE 802.11 standard. It only requires the ability of dynamically changing the transmission power of the AP beacon messages. We develop a set of polynomial time algorithms that find the optimal beacon power settings which minimize the load of the most congested AP. We also consider the problem of network-wide mln-max load balancing. Simulation results show that the performance of the proposed method is comparable with or superior to the best existing association-based methods.

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

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

U2 - 10.1109/TMC.2009.50

DO - 10.1109/TMC.2009.50

M3 - Article

AN - SCOPUS:65349107231

VL - 8

SP - 735

EP - 749

JO - IEEE Transactions on Mobile Computing

JF - IEEE Transactions on Mobile Computing

SN - 1536-1233

IS - 6

M1 - 4796200

ER -