Traffic aided fair scheduling using compensation scheme in wireless CDMA networks

In this paper, we study the fundamental problem of allocating the available resources with efficiency and fairness in a wireless CDMA network. In particular, we first introduce an ideal fair scheduling (IFS) scheme. The allocation of resources in IFS is strictly fair. Then we introduce the proportional compensation based fair scheduling (PCFS) algorithm. PCFS distinguishes the services in different application levels. In PCFS, a channel-adaptive resource allocation policy is introduced to improve the system throughput and a compensation model is introduced to achieve fair services. Based on the assignment of PCFS, we propose the traffic aided PCFS (T-PCFS) algorithm. that incorporates traffic information into compensation model to achieve better fairness. Extensive simulation results show that our scheme can operate well in wireless CDMA networks.