z-logo
Premium
Joint user association, subchannel assignment, and power allocation in full‐duplex OFDMA heterogeneous networks
Author(s) -
Dehghani Firouzabadi Abbas,
Rabiei Amir Masoud
Publication year - 2018
Publication title -
transactions on emerging telecommunications technologies
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.366
H-Index - 47
ISSN - 2161-3915
DOI - 10.1002/ett.3548
Subject(s) - orthogonal frequency division multiple access , telecommunications link , computer science , base station , mathematical optimization , transmitter power output , initialization , duplex (building) , optimization problem , wireless network , iterative method , heterogeneous network , convex optimization , cellular network , orthogonal frequency division multiplexing , algorithm , wireless , mathematics , computer network , regular polygon , telecommunications , transmitter , dna , channel (broadcasting) , geometry , biology , genetics , programming language
In‐band full‐duplex (FD) radio is regarded as a promising solution to enhance the spectral efficiency in the next‐generation wireless networks. In this paper, the problem of joint user association, subchannel assignment, and power allocation in FD orthogonal frequency‐division multiple access heterogeneous networks is considered. The weighted downlink and uplink sum rate of the network is maximized in a way that the transmit power of base stations and users remains below a given level. The problem is formulated as a nonconvex mixed‐integer nonlinear programming optimization problem. Then, it is converted into a suboptimal problem, which can be solved iteratively using difference of convex programming algorithm. Numerical results show that the proposed iterative algorithm converges quickly in few numbers of iterations with different initialization points. The results also show that the sum rate of an FD heterogeneous network can be as much as 66 % higher than the sum rate of a half‐duplex network.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here