Thresholds Optimization for One-Bit Feedback Multi-User Scheduling

2017/08/31 by Mohammed Hafez, Hafez, Mohammed, Ahmed El Shafie +9
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #Networking and Internet Architecture (cs.NI) #cs.IT #cs.NI #math.IT

paper · pdf · doi:10.48550/arxiv.1708.09551

arxiv created 2017/08/31 · arxiv updated 2017/09/01

Abstract

We propose a new one-bit feedback scheme with scheduling decision based on the maximum expected weighted rate. We show the concavity of the 2-user case and provide the optimal solution which achieves the maximum weighted rate of the users. For the general asymmetric M-user case, we provide a heuristic method to achieve the maximum expected weighted rate. We show that the sum rate of our proposed scheme is very close to the sum rate of the full channel state information case, which is the upper bound performance.

Related

• Minimum Feedback for Collision-Free Scheduling in Massive Random Access
• Utility Optimal Scheduling for Coded Caching in General Topologies
• Age of Information for Constrained Scheduling with Imperfect Feedback
• Feedback Reduction for Random Beamforming in Multiuser MIMO Broadcast Channel
• Joint Channel Probing and Proportional Fair Scheduling in Wireless Networks