Fair bandwidth allocation in wireless mobile environment using max-flow

Wireless clients must associate to a specific Access Point (AP) to communicate over the Internet. Current association methods are based on maximum Received Signal Strength Index (RSSI) implying that a client associates to the strongest AP around it. This is a simple scheme that has performed well in purely distributed settings. Modern wireless networks, however, are increasingly being connected by a wired backbone. The backbone allows for out-of-band communication among APs, opening up opportunities for improved protocol design. This paper takes advantage of this opportunity through a coordinated client association scheme where APs consider a global view of the network, and decides on the optimal client-AP association. We show that such an association outperforms RSSI based schemes in several scenarios, while remaining practical and scalable for wide-scale deployment. Although an early work in this direction, our basic analytical framework (based on a max-flow formulation) can be extended to sophisticated channel and traffic models. Our future work is focussed towards designing and evaluating these extensions.

[1]  Injong Rhee,et al.  SLAW: A New Mobility Model for Human Walks , 2009, IEEE INFOCOM 2009.

[2]  Paramvir Bahl,et al.  Hot-spot congestion relief in public-area wireless networks , 2002, Proceedings Fourth IEEE Workshop on Mobile Computing Systems and Applications.

[3]  Konstantina Papagiannaki,et al.  CENTAUR: realizing the full potential of centralized wlans through a hybrid data path , 2009, MobiCom '09.

[4]  Seung-Jae Han,et al.  Fairness and Load Balancing in Wireless LANs Using Association Control , 2004, IEEE/ACM Transactions on Networking.

[5]  Xiaodong Wang,et al.  Coordinated load balancing, handoff/cell-site selection, and scheduling in multi-cell packet data systems , 2008, Wirel. Networks.

[6]  Gunnar Karlsson,et al.  Load balancing in overlapping wireless LAN cells , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[7]  JongWon Kim,et al.  Dynamic load balancing through association control of mobile users in WiFi networks , 2008, IEEE Transactions on Consumer Electronics.

[8]  Konstantina Papagiannaki,et al.  Experimental Characterization of Home Wireless Networks and Design Implications , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[9]  Ivan Lavallée,et al.  A Distributed Algorithm for the Maximum Flow Problem , 2005, The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05).

[10]  Imed Ben Dhaou,et al.  A novel load-sharing algorithm for energy efficient MAC protocol compliant with 802.11 WLAN , 1999, Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324).

[11]  Marimuthu Palaniswami,et al.  Utility max-min fair resource allocation for communication networks with multipath routing , 2009, Comput. Commun..

[12]  S. Chong,et al.  SLAW : A Mobility Model for Human Walks , 2009 .

[13]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.

[14]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[15]  Michael D. Logothetis,et al.  A study on dynamic load balance for IEEE 802.11b wireless LAN , 2002 .

[16]  Ivan Lavallée,et al.  An adaptive distributed algorithm for the maximum flow problem in the underlying asynchronous network , 2006, 2006 International Conference onResearch, Innovation and Vision for the Future.

[17]  Shay Kutten,et al.  A modular technique for the design of efficient distributed leader finding algorithms , 1990, TOPL.

[18]  Federico Pedersini,et al.  A two-level social mobility model for trace generation , 2008, MobiHoc '08.