A Distributed Opportunistic scheduling protocol for device-to-device communications

In this paper, we consider the distributed scheduling problem for the OFDM based device-to-device (D2D) communications. In order to fully exploit the spatial diversity of the channel variation as well as provide access fairness for all D2D links, we propose a synchronous Distributed Opportunistic scheduling protocol under Fairness constraints (DO-Fast). DO-Fast incorporates the opportunistic scheduling with a round-robin strategy. By exchanging local Channel State Information (CSI) in a distributed way, the opportunistic scheduling strategy enables the links with better channel conditions to take precedence for higher access priorities. It leads to more concurrent transmissions and higher system throughput than the random scheduling strategy, where links are allocated with priorities in a random manner regardless of channel conditions. Meanwhile, we prompt a round-robin strategy so that the D2D links would take high priorities alternately, which guarantees the short-term fairness requirements of the links with poor channel conditions. We show via simulations that DO-Fast achieves throughput improvement over the existing scheduling protocol from the network perspective with acceptable delay performance.