Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 293962, 14 pages
Research Article

Fairness Time-Slot Allocation and Scheduling with QoS Guarantees in Multihop WiMAX Mesh Networks

1Institute of Computer Science and Information Engineering, National Chung Cheng University, No. 168, Section 1, University Road, Min-Hsiung Township, Chia-yi County 62102, Taiwan
2Department of Applied Digital Media, WuFeng University, No. 117, Section 2, Chiankuo Road, Min-Hsiung Township, Chia-yi County 62153, Taiwan

Received 17 September 2013; Accepted 9 October 2013

Academic Editor: Teen-Hang Meen

Copyright © 2013 Chien-Yu Wu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


The WiMAX technology has been defined to provide high throughput over long distance communications and support the quality of service (QoS) control applied on different applications. This paper studies the fairness time-slot allocation and scheduling problem for enhancing throughput and guaranteeing QoS in multihop WiMAX mesh networks. For allocating time slots to multiple subscribe stations (SSs), fairness is a key concern. The notion of max-min fairness is applied as our metric to define the QoS-based max-min fair scheduling problem for maximizing the minimum satisfaction ratio of each SS. We formulate an integer linear programming (ILP) model to provide an optimal solution on small-scale networks. For large-scale networks, several heuristic algorithms are proposed for better running time and scalability. The performance of heuristic algorithms is compared with previous methods in the literatures. Experimental results show that the proposed algorithms are better in terms of QoS satisfaction ratio and throughput.