English

Optimal Multi-User Scheduling of Buffer-Aided Relay Systems

Information Theory 2018-02-23 v1 math.IT

Abstract

Multi-User scheduling is a challenging problem under the relaying scenarios. Traditional schemes, which are based on the instantaneous signal-to-interference-plus-noises ratios (SINRs), cannot solve the inherent disparities of the qualities between different links. Hence, the system performance is always limited by the weaker links. In this paper, from the whole system throughput view, we propose an optimal multi-user scheduling scheme for the multi-user full-duplex (FD) buffer aided relay systems. We first formulate the throughput maximization problem. Then, according to the characteristics of the Karush-Kuhn-Tucker conditions, we obtain the optimal decision functions and the optimal weighted factors of different links of the proposed scheme. Simulation results show that the proposed scheme not only solves the disparities of the qualities between SiS_i-RR and RR-DiD_i links, but also that between different SiS_{i}-RR or DiD_{i}-RR links, which can be used as guidance in the design of the practical systems.

Keywords

Cite

@article{arxiv.1802.07793,
  title  = {Optimal Multi-User Scheduling of Buffer-Aided Relay Systems},
  author = {Pihe Hu and Cheng Li and Dingjie Xu and Bin Xia},
  journal= {arXiv preprint arXiv:1802.07793},
  year   = {2018}
}

Comments

Accepted by IEEE ICC 2018, Kansas City,USA

R2 v1 2026-06-23T00:29:24.696Z