Bottleneck-first scheduling for wireless mesh backhaul networks

In this paper, resource allocation for Orthogonal Frequency Division Multiple Access (OFDMA)-based Wireless Mesh Networks (WMNs) is investigated. First, the Even-Odd framework is modified to be better suited for different traffic patterns. Second, the scheduling problem in the modified Even-Odd framework is formulated as a Mixed Integer Quadratically Constrainted Programming (MIQCP), and a heuristic solution is derived. The proposed heuristic solution is motivated from the fact that the bottleneck collision domain throttles the capacity of the networks, and the links in the bottleneck collision domain should be allocated resource carefully to maximize the throughput. The numerical results show that the proposed scheduling scheme can achieve throughput which is over 90% of the nominal capacity and the modified Even-Odd framework improve the end-to-end throughput for asymmetric traffic.