JISE


  [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24]


Journal of Information Science and Engineering, Vol. 26 No. 4, pp. 1429-1442


DCLS: A Fair and Efficient Scheduling with Bandwidth Guarantee in WiMAX Mesh Networks


TEIN-YAW CHUNG, HUAI-LEI FU AND HSIAO-CHIH LEE
Department of Computer Science and Engineering 
Yuan Ze University 
Chungli, 320 Taiwan


    Striking balance between throughput and fairness is a challenging issue in a wireless mesh network because of interference among links. This work proposed a Dynamic Clique-based Link Scheduling algorithm (DCLS) with minimal bandwidth guarantee for a WiMAX mesh backhaul network. DCLS includes two phases. First, it exploits a novel scheme based on cliques to maximize parallel transmission and ensure minimum bandwidth guarantee. Second, it employs a bandwidth tracking scheduling to enhance fairness among users. Simulation results show that DCLS performs better than existing scheduling schemes in network throughput and fairness.


Keywords: clique set, bandwidth guarantee, dynamic link scheduling, spatial reuse, WiMAX

  Retrieve PDF document (JISE_201004_17.pdf)