Characterizing user behavior and network performance in a public wireless LAN
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The changing usage of a mature campus-wide wireless network
Proceedings of the 10th annual international conference on Mobile computing and networking
Fairness and load balancing in wireless LANs using association control
Proceedings of the 10th annual international conference on Mobile computing and networking
Characterizing mobility and network usage in a corporate wireless local-area network
Proceedings of the 1st international conference on Mobile systems, applications and services
Scalable and Robust WLAN Connectivity Using Access Point Array
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
Improved access point selection
Proceedings of the 4th international conference on Mobile systems, applications and services
Cell Breathing in Wireless LANs: Algorithms and Evaluation
IEEE Transactions on Mobile Computing
Facilitating access point selection in IEEE 802.11 wireless networks
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Cell Breathing Techniques for Load Balancing in Wireless LANs
IEEE Transactions on Mobile Computing
Designing a practical access point association protocol
INFOCOM'10 Proceedings of the 29th conference on Information communications
Load balancing access point association schemes for IEEE 802.11 wireless networks
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Self-organizing mixture networks for probability density estimation
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
In wireless local area networks, adjusting the coverage of access points (APs) may force the clients near the coverage boundaries of congested APs to associate with lightly-loaded ones, thus realizing load-balancing. Such an approach has the advantage of requiring no modification on the client software/hardware compared to other load-balancing techniques. However, its applicability is undermined by the problems of AP service cheating and AP service loophole resulted from coverage adjustment, which significantly affect the AP service availability. Nevertheless, these two problems are largely ignored by the existent research. To tackle this challenge, a variable polyhedron genetic algorithm (GA) is proposed, which not only provides an AP service availability guarantee but also yields a near-optimal beacon range for each AP when the number of evolutions is large enough. Simulation study indicates that our algorithm is superior over the default 802.11 AP association model in terms of load-balancing and network throughput enhancement. In addition, the variable polyhedron GA outperforms the traditional GA in terms of fitness value and convergence speed.