Low complexity user scheduling for multi‐antenna Gaussian broadcast systems with quality of service requirements. Issue 10 (1st July 2014)

• Record Type: Journal Article
• Authors: Li, Junchao; Xia, Weiwei; Martins, Philippe; Shen, Lianfeng
• Is Part Of: IET communications. Volume 8:Issue 10(2014)
• Page Start: 1820
• Page End: 1830
• Publication Date: 2014-07-01
• Subjects: antenna arrays -- scheduling -- broadcast antennas -- broadcast communication -- quality of service -- combinatorial mathematics -- genetic algorithms -- search problems -- broadcast channels; low complexity user scheduling -- multiantenna Gaussian broadcast systems -- diverse delay‐quality of service -- QoS assurances -- combinatorial optimisation -- queue dynamics -- source statistics -- delay‐bound violation probability constraints -- computational complexity -- genetic algorithm -- brute‐force exhaustive search; Telecommunication systems -- Periodicals; Speech processing systems -- Periodicals; 621.38205
• DOI: 10.1049/iet-com.2013.0913
• Languages: English
• ISSNs: 1751-8628

Abstract

Abstract : In this study, the authors propose a low complexity user scheduling for multi‐antenna broadcast systems with a large number of users with diverse delay‐quality of service (QoS) assurances. Owing to the exclusive user scheduling constraints, the optimisation is combinatorial. Furthermore, by adopting effective capacity and effective bandwidth to illustrate the behaviours of different traffic characteristics such as different source statistics and queue dynamics, the delay‐bound violation probability constraints can be converted into equivalent minimum data rate constraints. To reduce the computational complexity, they use genetic algorithm (GA) to perform scheduling, instead of a brute‐force exhaustive search (ES) over all possible user subsets. By comparing the complexity of GA and ES, they show that GA is a rapid, although suboptimal, option of performing user scheduling optimisation. Simulation results show that the proposed algorithm can not only maximise the achievable user sum data rate, but also keep the delay‐bound violation probability of each user below a given threshold.