Reduced feedback opportunistic scheduling with the aid of user cooperation in wireless networks

In this paper we propose an opportunistic scheduling algorithm in wireless networks that reduces the feedback load with the aid of relaying, called relay aided opportunistic scheduling (RAOS). We consider a greedy algorithm in the sense that the network scheduler is always looking for the user with channel quality satisfying the highest transmission rate possible in the system. The algorithm is based on a signal-to-noise ratio (SNR) threshold. The RAOS algorithm when performed will require users to feedback their SNRs either directly to the access point (AP) or via a relay. We analyze the RAOS algorithm under slow Rayleigh fading assumption and derive the closed-form expressions for the feedback load as well as the spectral efficiency. The RAOS algorithm is compared with other scheduling algorithms.