Abstract
In this paper, the resource allocation and scheduling problem for a full-duplex (FD) orthogonal frequency-division multiple-access network is studied where an FD base station simultaneously communicates with multiple pairs of uplink (UL) and downlink (DL) half-duplex (HD) users bidirectionally. In this paper, we aim to maximize the network sum-rate through joint UL and DL user pairing, OFDM subchannel assignment, and power allocation. We formulate the problem as a non-convex optimization problem. The optimal algorithm requires an exhaustive search, which will become prohibitively complicated as the numbers of users and subchannels increase. To tackle this complex problem more efficiently, we formulate the user-pairing and subchannel allocation problem as a three-sided matching problem, and propose a novel low-complexity near-optimal matching algorithm. The algorithm is analyzed, and we prove that it converges to a stable matching. Simulation results show that the FD scheme can significantly improve the spectrum efficiency compared with the HD scheme. The proposed algorithm performs very close to the optimal algorithm, and significantly outperforms other resource allocation schemes.
Original language | English |
---|---|
Article number | 7576717 |
Pages (from-to) | 8260-8272 |
Number of pages | 13 |
Journal | IEEE Transactions on Wireless Communications |
Volume | 15 |
Issue number | 12 |
DOIs | |
Publication status | Published - Dec 2016 |
Bibliographical note
Publisher Copyright:© 2016 IEEE.
Keywords
- Full-duplex
- matching theory
- resource allocation
- scheduling problem