Max-min throughput tree topology construction in wireless mesh networks

Wireless mesh networks (WMN) is designed as an economical solution for last-mile broadband Internet access. The Mesh nodes can directly communicate with each other, thus forming a tree, and can be used to forward the data packets to network gateway in multi-hop fashion. The way this tree is built have a deep impact on the effective throughput of the mesh node. In the paper, we study tree topology construction in a WMN configured with multiple radio interface and multiple directional antennas. Our optimization goals are to maximize the end to end throughput and, at the same time, to enhance fairness. First, we formulate the tree topology generation problem as a linear optimization problem. Then, a practical tree topology generation algorithm: fairness tree generation is proposed. The performance of the algorithm is evaluated through simulation.