Fairness-Oriented Scheduling with Equilibrium for Multihop Relaying Networks Based on OFDMA

In this paper, three centralized packet scheduling schemes with fairness-oriented feature are proposed for OFDMA multihop relaying networks, namely Greedy polling with novel starvation restrained (SR-GP), enhanced proportional fairness with SR (SR-EPF) and novel subcarrier pairing with hop balance (HB-SP) scheduling algorithms. SR-GP can bring better fairness than traditional throughput-oriented algorithms by sacrificing a little complexity. SR-EPF with novel priority function can guarantee the quality-of-service (QoS) of the cell edge users. HB-SP can enhance the system throughput significantly by utilizing the relay link efficiently with multihop equilibrium. Simulation results of the throughput´s deviation of different users indicate that HB-SP and SR-EPF are applicable to realtime services and SR-GP is suitable for non-realtime services. Generally, HB-SP algorithm is a good achievement for both capacity enhancement and resource fairness.