One Bit Feedback for CDF-Based Scheduling with Resource Sharing Constraints

Cumulative distribution function (CDF)-based scheduling (CS) is known to be effective in meeting the different channel access ratio (CAR) requirements of users in a multi-user wireless system. In this paper, we propose a one-bit-feedback scheme for CS (OBCS) to reduce the feedback overhead from users in a cell. In OBCS, each user sets its individual threshold to decide whether to send one-bit feedback to the base station (BS). The BS randomly generates numbers for all users based on their feedback behavior and selects a user who is assigned with the largest value. We further propose OBCS with reduced complexity, OBCS-RC, which employs a universal threshold for all users, and relieves the BS to generate random numbers only for the users who have sent feedback. Both OBCS and OBCS-RC inherit the properties of CS in meeting diverse CAR requirements of users in arbitrary fading channels. Extensive analytical and simulation results indicate that simply setting the OBCS-RC threshold to 0.1 is adequate for good throughput performance compared to OBCS with the optimal threshold for each user. Although OBCS and OBCS-RC induce a throughput loss due to the reduced feedback overhead, their throughput still grows in a double-logarithmic manner as CS in Nakagami-m channels when the number of users increases to infinity.