Dynamic Clustering for Load-Balancing Routing In Wireless Mesh Network

In this paper, we study the problem of load balancing routing in clustered-based wireless mesh network in order to enhance the overall network throughput. We first address the problems of cluster allocation in wireless mesh network to achieve load-balancing state. Due to the complexity of the problem, we proposed a simplified algorithm using gradient load-balancing model. This method searches for a localized optimal solution of cluster allocation instead of solving the optimal solution for overall network. To support for load-balancing algorithm and reduce complexity of topology control, we also introduce limited broadcasting between two clusters. This mechanism maintain shortest path between two nodes in adjacent clusters while minimizing the topology broadcasting complexity. The simulation experiments demonstrate that our proposed model achieve performance improvement in terms of network throughput in comparison with other clustering methods.