z-logo
open-access-imgOpen Access
Joint user scheduling and channel allocation for cellular networks with full duplex base stations
Author(s) -
Yu Guanding,
Wen Dingzhu,
Qu Fengzhong
Publication year - 2016
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.2015.0560
Subject(s) - computer science , base station , scheduling (production processes) , single antenna interference cancellation , cellular network , computer network , proportionally fair , channel (broadcasting) , quality of service , mathematical optimization , dynamic priority scheduling , round robin scheduling , mathematics
Full‐duplex communication (FDC) can potentially double the network capacity by allowing a device to transmit and receive simultaneously on the same frequency band. In this study, a novel resource allocation and user scheduling algorithm is proposed to maximise the network throughput for a cellular network with full‐duplex (FD) base stations (BSs). The authors consider that FDC is utilised at the BS with imperfect self‐interference (SI) cancellation while user devices only work in the traditional half‐duplex (HD) way. In addition, to potentially cancel co‐channel interference caused by other users, the opportunistic interference cancellation (OIC) technique is applied at user side. Since FDC does not always perform better than HD due to residual SI (RSI), a joint mode selection, user scheduling, and channel allocation problem is formulated to maximise the system throughput. The optimisation problem is non‐convex and NP‐hard, thereby a suboptimal heuristic algorithm with low computational complexity is proposed. Numerical results demonstrate that user diversity gain, FD gain, and OIC gain can be achieved by the proposed algorithm, respectively. The performance of FDC depends on the intensity of RSI and the distribution of user devices.

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