Relay selection based opportunistic fair scheduling

In this paper, an opportunistic scheduling algorithm is presented for fixed relay based cellular networks. The basic idea is to combine so-called distributed relay selection with centralized scheduling to enhance the performance of a wireless network and reduce feedback overhead of the channel state information. Simulation results demonstrate that if the associated propagation path losses between different nodes in the network are taken into consideration, the proposed algorithm can efficiently exploit multi-user diversity and cooperative diversity, and achieve significant improvement on the performance of a wireless networks.