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 sub-problems: 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.

Highlights

  • Device-to-Device (D2D) communications is identified as one of the technology complements for 5G communications system [1]

  • Based on the above power allocation results, we introduce the concept of virtual D2D links and model the channel allocation as a 3-D assignment problem

  • The computational complexity is analysed in terms of number of operations required in the power allocation and channel allocation

Read more

Summary

INTRODUCTION

Device-to-Device (D2D) communications is identified as one of the technology complements for 5G communications system [1]. In this paper, we formulate the joint power and channel allocation for both cellular and D2D links to maximize the system fairness while guaranteeing the QoS requirements and power limits of communication links for all scheduling periods. PROBLEM FORMULATION AND PROPOSED ALGORITHM FOR t = 1 the PF scheduler scheme for t = 1 is modelled to maximize the sum of the logarithm of the current data rates for all links. P1i,j,n = [(p1C∗i,j,n , p1D∗i,j,n )] is the optimal power allocated to cellular link i and D2D link j when they reuse the RB n in the first scheduling period. In order to solve (11) efficiently, we first derive the optimal power allocation on a given RB for one reuse pair of cellular and D2D links, which enables us to determine the data rate of each RB if it is allocated.

10: Obtain
1: Initialization
9: Stage 3
RESULTS AND ANALYSIS
COMPLEXITY ANALYSIS
CONCLUSION

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.