We investigate the problem of joint AP coverage adjustment and user association optimization for load balancing in multi-rate WLANs in this paper. We first divide the problem into two sub-problems and then formulate t...
详细信息
ISBN:
(纸本)9781509061990
We investigate the problem of joint AP coverage adjustment and user association optimization for load balancing in multi-rate WLANs in this paper. We first divide the problem into two sub-problems and then formulate them as mixed integer linear programming models, which aim to minimize the AP utilization of the most congested AP while satisfying users' traffic demands. Then we design two corresponding heuristic algorithms that are performed in sequence to address the problem. Finally, we conduct extensive simulations to evaluate the performance of the proposed algorithms. The results not only show that the algorithms can balance the loads among APs effectively and efficiently, but also demonstrate that the solutions of joint AP coverage adjustment and user association optimization outperform that of AP coverage adjustment with low overhead.
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. ...
详细信息
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.
Network coverage rate is a key standard of measuring the quality of network coverage. This thesis aims at solving the differences between node energy and task, which causes coverage holes and blind spots of Wireless S...
详细信息
Network coverage rate is a key standard of measuring the quality of network coverage. This thesis aims at solving the differences between node energy and task, which causes coverage holes and blind spots of Wireless Sensor Network, and proposes a coverage algorithm, based on key node scheduling, divides node subsets, and adjusts the states of individual nodes according to node energy and coverage rate. This algorithm ensures network connectivity while reducing coverage holes and redundancy. Simulation results show that, the proposed algorithm can effectively reduce failure nodes, energy consumption, improve network coverage rate, and demonstrates network convergence and stability.
暂无评论