Game Theoretic Semi-Distributed D2D Resource Allocation Underlaying an LTE Network

TL;DR

This paper introduces a game theoretic semi-distributed resource allocation algorithm for D2D communications under LTE, addressing the challenge of limited CSI availability and channel variability.

Contribution

It proposes a novel semi-distributed algorithm that maximizes D2D utility while ensuring QoS, robust to channel fading and user mobility, improving practical deployment.

Findings

First algorithm performs poorly in realistic scenarios.

Second algorithm is robust to channel randomness and mobility.

Proposed methods achieve near Pareto optimality under practical conditions.

Abstract

To devise D2D resource allocation algorithms in underlay D2D communications the channel state information (CSI) between the D2D transmitters and the BS and the D2D receiver CSI (DCSI-R) needs to be transmitted to the BS. However, this increases the control overhead and power wastage which increases with a fast fading channel since the CSI needs to be transmitted in every time slot. Most of the existing works assume DCSI-R availability at the BS. However, a few works assume its unavailability and determine the Nash equilibrium which may not be Pareto optimal. We address this problem and within a game theoretic framework propose a suboptimal semi-distributed D2D resource allocation algorithm. We consider the channel to exhibit path loss. Our goal is to maximize the social utility of the D2D users while meeting their utility requirements and the signal-to-interference-plus-noise ratio (SINR) requirements of the CUs to reach a Pareto optimal solution. Next, we consider shadowing, fast fading and mobility of CUs and propose another algorithm which is a modification of our first proposed algorithm. Through simulations we observe that the first algorithm does not perform well practically but the second algorithm is very robust to channel randomness and CU mobility.