Open Access   Article Go Back

Min-Max and Limited Knowledge Algorithmic Approach for Load Balancing

Rishikesh B. Pansare1 , I.R.Shaikh 2

Section:Research Paper, Product Type: Journal Paper
Volume-2 , Issue-11 , Page no. 50-59, Nov-2014

Online published on Nov 30, 2014

Copyright © Rishikesh B. Pansare , I.R.Shaikh . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Rishikesh B. Pansare , I.R.Shaikh, “Min-Max and Limited Knowledge Algorithmic Approach for Load Balancing,” International Journal of Computer Sciences and Engineering, Vol.2, Issue.11, pp.50-59, 2014.

MLA Style Citation: Rishikesh B. Pansare , I.R.Shaikh "Min-Max and Limited Knowledge Algorithmic Approach for Load Balancing." International Journal of Computer Sciences and Engineering 2.11 (2014): 50-59.

APA Style Citation: Rishikesh B. Pansare , I.R.Shaikh, (2014). Min-Max and Limited Knowledge Algorithmic Approach for Load Balancing. International Journal of Computer Sciences and Engineering, 2(11), 50-59.

BibTex Style Citation:
@article{Pansare_2014,
author = {Rishikesh B. Pansare , I.R.Shaikh},
title = {Min-Max and Limited Knowledge Algorithmic Approach for Load Balancing},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {11 2014},
volume = {2},
Issue = {11},
month = {11},
year = {2014},
issn = {2347-2693},
pages = {50-59},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=302},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=302
TI - Min-Max and Limited Knowledge Algorithmic Approach for Load Balancing
T2 - International Journal of Computer Sciences and Engineering
AU - Rishikesh B. Pansare , I.R.Shaikh
PY - 2014
DA - 2014/11/30
PB - IJCSE, Indore, INDIA
SP - 50-59
IS - 11
VL - 2
SN - 2347-2693
ER -

VIEWS PDF XML
3526 3285 downloads 3496 downloads
  
  
           

Abstract

Network overload is one of the key challenges in wireless LANs. This goal is typically achieved when the load of access points is balanced. Recent studies on operational WLANs, shown that access point’s load is often uneven distribution i.e. it will be a crucial task to handle the load of overloaded server. To identify such overloaded server many kind of techniques like load balancing have been proposed already. These methods are commonly required proprietary software or hardware at the user side for controlling the user-access point association. In this proposed system we are presenting a new load balancing method by controlling the size of WLAN cells, which is conceptually similar to cell breathing in cellular networks. This method 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 have develop a set of polynomial time algorithms which find the optimal beacon power settings which minimizes the load of the congested access point. We have also considered the problem of network-wide min-max load balancing. Simulation results show that the performance of the proposed method is comparable with or superior to the best existing association-based method.

Key-Words / Index Term

Load balance in wireless LAN, Power reduction, assign access point assign to Wireless LAN

References

[1] Y. Bejerano and S.-J. Han, “Cell Breathing Techniques for Load Balancing in Wireless LANs,” Proc. IEEE INFOCOM, 2006.
[2] M. Balazinska and P. Castro, “Characterizing Mobility and Network Usage in a Corporate Wireless Local-Area Network,”Proc. USENIX Int’l Conf. Mobile Systems, Applications, and Services (MobiSys ’03), 2003.
[3] T. Henderson, D. Kotz, and I. Abyzov, “The Changing Usage of a Mature Campus-Wide Wireless Network,” Proc. ACM MobiCom, pp. 187-201, 2004.
[4] T. Togo, I. Yoshii, and R. Kohno, “Dynamic Cell-Size Control According to Geographical Mobile Distribution in a DS/CDMA Cellular System,” Proc. IEEE Personal, Indoor, and Mobile Radio Comm. Symp. (PIMRC ’98), pp. 677-681, 1998.
[5] A. Jalali, “On Cell Breathing in CDMA Networks,” Proc. IEEE Int’l Conf. Comm. (ICC ’98), pp. 985-988, 1998.
[6] I. Papanikos and M. Logothetis, “A Study on Dynamic Load Balance for IEEE 802.11b Wireless LAN,” Proc. Int’l Conf. Comm.Control (COMCON ’01), 2001.
[7] I. Tinnirello and G. Bianchi, “A Simulation Study of Load Balancing Algorithms in Cellular Packet Networks,” Proc. ACM/ IEEE Int’l Workshop Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM ’01), pp. 73-78, 2001.
[8] A. Balachandran, P. Bahl, and G.M. Voelker, “Hot-Spot Congestion Relief and Service Guarantees in Public-Area Wireless Networks,” SIGCOMM Computing Comm. Rev., vol. 32, no. 1, pp. 59-59, 2002.
[9] H. Velayos, V. Aleo, and G. Karlsson, “Load Balancing in Overlapping Wireless LAN Cells,” Proc. IEEE Int’l Conf. Comm. (ICC ’98), 1998.
[10] A. Kumar and V. Kumar, “Optimal Association of Stations and APs in an IEEE 802.11 WAN,” Proc. Nat’l Conf. Comm., 2005.