| Wireless mesh networks (WMNs) are a promising technology which provides wireless broadband connectivity to the Internet. This thesis is an investigation of scheduling problems in WMNs. First, existing scheduling solutions are discussed and classified based on technique and implementation framework. Then two novel proposed schemes are discussed in detail. The first proposed technique is a multiple gateway fair scheduling scheme. This scheme consists of distributed routing and requirement tables and a propagation algorithm for scheduling at the gateways. Simulation results confirm that fair scheduling has better performance than the scheme without fair scheduling and that multiple gateways are beneficial. The second proposed scheme is a cross-layer mixed-bias solution. We bias against distance from gateway, size of queue, link quality and a combined mixed-bias technique. Simulation results confirm that the mixed-bias approach performs better than IEEE 802.11 DCF for wireless mesh networks with respect to the metrics used for performance evaluation. |
