z-logo
open-access-imgOpen Access
Discrete location‐aware resource allocation for underlay device‐to‐device communications in cellular networks
Author(s) -
Feng Zebing,
Feng Zhiyong,
Gulliver T. Aaron
Publication year - 2017
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2017.0367
Subject(s) - underlay , cellular network , computer science , knapsack problem , resource allocation , interference (communication) , spectral efficiency , computer network , reuse , quality of service , mathematical optimization , shared resource , distributed computing , signal to noise ratio (imaging) , mathematics , telecommunications , algorithm , channel (broadcasting) , ecology , biology
Device‐to‐device (D2D) communications underlaying a cellular network is an efficient way to enhance spectral efficiency via resource sharing between D2D and cellular users (CUs). In this study, a discrete location‐aware (DLA) interference model for D2D users is presented to allocate cellular resources. The vicinity of a CU is discretised into multiple regions, and the number of active D2D users in each region is constrained to satisfy the CU QoS requirements. Considering the locations of D2D users affecting the interference to CUs and thus the achievable rate, the formulated non‐linear 0–1 knapsack resource allocation (RA) problem is divided into two subproblems: (i) the optimal amount of shared resources between the two types of users; (ii) the optimum subset of D2D users which transmit . The conditions of D2D users spatial deployment and resources reuse portion to achieve the solutions of the two subproblems are theoretically derived and proven. Then a DLA‐RA algorithm is proposed to solve the corresponding subproblems in both single CU and multiple CUs cases. Extensive simulations results are presented which verify the effectiveness of the proposed DLA interference model and the RA scheme.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here