In this thesis we study a wireless mesh network (WMN), where a number of access points (APs) form a wireless infrastructure and provide communications to the mobile stations (MSs). Different APs share the same frequency channel. We study how to provide fair throughput for the MSs while efficiently utilizing the channel resources through effective handoff management and channel timeline allocations.
In the first part of the thesis, we assume that the channel time allocations at the AP level are given, and jointly consider the handoff management of the MSs and the channel time allocations at the MS level. An optimization problem is formulated based on long-term proportional fairness (PF) and solved. A heuristic distributed scheme is then proposed, which can be easily implemented in a practical WMN.
In the second part, we jointly study the channel time allocations at the AP level and the MS level together with the MS handoff management. An optimization problem is first formulated and solved as a benchmark. Two distributed schemes are proposed by decoupling the handoff management and time allocations. The HO-CA scheme performs heuristic handoff decisions for the MSs and then optimizes the channel time allocations. The CA-HO scheme allocates the channel time to individual APs based on the neighboring relationship of the APs, and then makes handoff.
Numerical results indicate that our proposed distributed schemes can achieve close-to-optimum fairness, improve the network utilization and balance the traffic load under uneven MSs geographical distributions.