Optimal Multi-User Scheduling of Buffer-Aided Relay Systems

TL;DR

This paper introduces an optimal multi-user scheduling scheme for buffer-aided full-duplex relay systems that maximizes throughput and addresses link quality disparities, outperforming traditional SINR-based methods.

Contribution

It formulates a throughput maximization problem and derives optimal decision functions and weighted factors using KKT conditions for the first time in this context.

Findings

The proposed scheme effectively balances link qualities across the system.

Simulation results demonstrate significant throughput improvements.

The method guides practical system design by addressing link disparities.

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 $S_i$-$R$ and $R$-$D_i$ links, but also that between different $S_{i}$-$R$ or $D_{i}$-$R$ links, which can be used as guidance in the design of the practical systems.