Open AccessJoint optimal resource allocation schemes for downlink cooperative cellular networks over orthogonal frequency division multiplexing carriers
Author(s) -
Kaveh Fatemeh,
Soleimanpour Mohadese,
Talebi Siamak
Publication year - 2020
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.2019.0580
Subject(s) - subcarrier , computer science , telecommunications link , throughput , cellular network , mathematical optimization , resource allocation , enhanced data rates for gsm evolution , relay , joint (building) , computer network , orthogonal frequency division multiplexing , power (physics) , telecommunications , mathematics , wireless , engineering , architectural engineering , channel (broadcasting) , physics , quantum mechanics
This study concentrates on the study of a downlink cooperative cellular (DCC) network in which an access point is located in the centre of each cell and two relay stations are installed in the border between both sectors of a cell to obtain higher cell‐edge throughput. To optimise the network efficiency, a joint optimal subcarrier and power allocation scheme is proposed which initially derives the highest achievable rate for a single‐legacy user (LU), then, through further evaluation and analysis, this is generalised to the case of a multiple‐LU environment. Next, to maximise the overall throughput and ensure fairness, a multi‐objective lexicographical optimisation problem (MLOP) is formulated to maximise the minimum LUs rate while improving the overall throughput. As the proposed MLOP is a mixed‐integer non‐linear problem, finding optimal solutions is impractical and in general, there is no standard method for optimally obtaining a solution. Hence, two efficient algorithms are introduced in this study. Simulation results confirm that the proposed algorithms achieve a fair and near‐optimal performance for the multi‐LU DCC network based on two relay channels, which makes them desirable in practice compared to some of the sub‐optimal well‐known algorithms investigated in this study.