Resource Allocation for D2D Underlay Communications With Proportional Fairness Using Iterative-Based Approach

Abstract

In this paper, we develop a novel resource allocation scheme that aims to improve the system fairness, with minimum SINR (Signal to Interference and Noise Ratio) constraints and power limits for the Device-to-Device (D2D) underlay communications. Since the evaluation of the system fairness is different for t = 1 and t ≥ 2, where t is the scheduling period, we divide our joint optimization problem into two cases: t = 1 and t ≥ 2. For each case, we decompose the joint optimization problem into two subproblems: power and channel allocations. We then propose the corresponding power allocation algorithm for each case. By introducing virtual D2D links, we model the channel allocation as a 3-D (3-Dimensional) assignment problem, which is effectively solved by our proposed 2-D (2-Dimensional) iterative method. Simulation results show that our proposed iterative method can produce the close-to-optimal performance with low computational complexity. Moreover, comparing with existing schemes, our proposed scheme can not only enhance the system fairness but also improve the overall throughput.

Distributed Backlog-Aware D2D Communication for Heterogeneous IIoT Applications

“…Proof: See Appendix E Hence, based on ( 17) and ( 18), we can obtain s A and s D as shown in ( 21) and (22). Then, by substituting s A in (6), we can obtain ∆.…”

“…The main research on scheduling in wireless D2D networks focuses on the analysis and optimization of resource allocation [20], traffic density [21], or user fairness [22], however, there are few works that focus on the study and minimization of AoI The authors in in [23] statistically analyzed the peak AoI and the conditional success probability in a D2D communication scenario under preemptive and non-preemptive queues. Based on a stochastic geometry approach, the authors in [24] proposed a distributed scheduling policy that utilizes local observations, encapsulated in the concept of stopping sets to make scheduling decisions that minimize the network-wide average AoI.…”

A survey on energy‐efficient resource allocation schemes in device‐to‐device communication

“…Multiple D2D pairs are iteratively added to access the individual channels according to the channel condition and received interference from the already added D2D pairs in the second phase. The formulated scheme is more valuable than others in terms of complexity. Iterative 2D assignment (I2‐DA) 69 : It is a resource allocation scheme aimed to enhance fairness with minimum constraints of SINR and power level for the D2D communication 69 . It decoupled the combined optimization problem into two subproblems such as power and channel allocation.…”

“…The formulated scheme is more valuable than others in terms of complexity. (ii) Iterative 2D assignment (I2-DA) 69 : It is a resource allocation scheme aimed to enhance fairness with minimum constraints of SINR and power level for the D2D communication. 69 It decoupled the combined optimization problem into two subproblems such as power and channel allocation.…”

“…(ii) Iterative 2D assignment (I2-DA) 69 : It is a resource allocation scheme aimed to enhance fairness with minimum constraints of SINR and power level for the D2D communication. 69 It decoupled the combined optimization problem into two subproblems such as power and channel allocation. In particular, they modeled the channel allocation as a three-dimensional problem and solved using the KKT supportive iterative method such as I2-DA.…”