Improving user perceived QoS in D2D networks via binary quantile opportunistic scheduling

Authors:

Abstract
State-of-the-art D2D schedulers' performance can be evaluated from at least two different perspectives: the sum throughput and the fraction of satisfied users/applications. In this paper we revisit the performance of such schedulers, e.g., FlashLinQ/ITLinQ, showing they strike particular trade-offs between these two metrics. Our analysis and simulations show that the sum-rate benefits of such schedulers come at the expense of fairness, which under high densities can lead to a substantial fraction of unsatisfied users. This motivates a proposed opportunistic scheduler design, Binary Quantile (BQ) scheduling, which further exploits temporal channel variations via a low overhead distributed mechanisms and realizes substantial improvements in user/application performance. We further show that an adapting version of BQ scheduling where link quantile thresholds are adjusted based on achieved throughput can further achieve substantial improvement in user/application level satisfaction which is robust to heterogeneity in the network topology.

This publication has 15 references indexed in Scilit: