Opportunistic Contention-Based Feedback Protocol for Downlink OFDMA Systems with Mixed Traffic
PCM '09 Proceedings of the 10th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Mode selection-based channel feedback reduction scheme for opportunistic scheduling in OFDMA systems
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Uplink random access scheme with prioritized orthogonal layers for OFDMA CSI feedback
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
IEEE Transactions on Wireless Communications
Cross-layer channel-aware approaches for modern wireless networks
MACOM'10 Proceedings of the Third international conference on Multiple access communications
Multiuser Diversity with Binary Feedback
Wireless Personal Communications: An International Journal
| Hi-index | 0.01 |
We study reducing feedback overhead of users' channel state information required for opportunistic scheduling at a base station while minimizing the throughput penalty incurred due to reduced feedback. We first propose a simple contention based scheme known as 'static splitting' for best effort traffic. The idea is to divide users into static groups, with users that belong to a group, and have their currently supported rate above a threshold, contending to send their current feedback to the base station. This is combined with maximum quantile scheduling -scheduling a user whose current rate is high relative to its distribution, to obtain thresholds that are independent of users' rate distributions even when they are heterogeneous, allowing off-line optimization of thresholds. Next we develop the insight that for a traffic mixture of best effort and real-time traffic one has to combine contention and polling to reduce feedback while providing quality of service. We propose a scheme based on this insight. Under this scheme we prove a lower bound on the service seen by a real-time when users' channel capacities are fast fading. Furthermore, we propose a heuristic modification that is able to exploit a larger fraction of opportunism. Simulation results illustrate the performance advantage of the proposed schemes.