Home > Research > Publications & Outputs > Low complexity joint sub-carrier pairing, alloc...

Links

Text available via DOI:

View graph of relations

Low complexity joint sub-carrier pairing, allocation and relay selection in cooperative wireless networks

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published
Close
<mark>Journal publication date</mark>17/04/2022
<mark>Journal</mark>International Journal of Communication Networks and Information Security
Issue number3
Volume6
Publication StatusPublished
Early online date21/08/14
<mark>Original language</mark>English

Abstract

Multi-carrier cooperative relay-based wireless communication is of particular interest in future wireless networks. In this paper we present resource allocation algorithm in which sub-carrier pairing is of particular interest along with fairness constraint in multi-user networks. An optimization of sub-carrier pair selection is formulated through capacity maximization problem. Sub-carrier pairing is applied in both two-hop Amplify & Forward (AF) and Decode & Forward (DF) cooperative multi-user networks. We develop a less complex centralized scheme for joint Sub-carrier pairing and allocation along with relay selection. The computational complexity of the proposed algorithms has been analyzed and performance is compared with Exhaustive Search Algorithm.