Buffer-Aided Relay Selection With Reduced Packet Delay in Cooperative Networks

Abstract

Applying data buffers at relay nodes significantly improves the outage performance in relay networks, but the performance gain is often at the price of long packet delays. In this paper, a novel relay selection scheme with significantly reduced packet delay is proposed. The outage probability and average packet delay of the proposed scheme under different channel scenarios are analyzed. Simulation results are also given to verify the analysis. The analytical and simulation results show that, compared with non-buffer-aided relay selection schemes, the proposed scheme has not only significant gain in outage performance but also similar average packet delay when the channel SNR is high enough, making it an attractive scheme in practice.

On Buffer-Aided Relaying for the Two-Hop Full Duplex Relay Channel with Self-Interference

“…R (i)γ RD (i) − ζP By substituting the corresponding terms in (62), (63), and (64) by (17), (18), and (19), we can derive the optimal state selection scheme in Theorem 1. This completes the proof.…”

Using Buffers in Trust-Aware Relay Selection Networks With Spatially Random Relays

“…Compared with their non-buffer aided counterparts, all buffer-aided schemes have coding gains which is 3dB for independent identical distributed (i.i.d.) fading channels [17], but not all of them have diversity gains. In principle, the diversity order of a relay selection system depends on the number of available links for selection.…”

“…This however contradicts the requirements for the diversity performance where the buffers shall avoid from being empty (or full). In [17], we proposed a delay reduced buffer-aided scheme, in which higher selection priority is given to relay-to-destination than to source-to-relay links, so data is moving out of buffers as quickly as possible to minimize the queuing lengths. While the proposed scheme in [17] significantly reduces the packet delay, it only has coding gain but little diversity gain.…”

Minimum Power Scheduling under Rician Fading in Full-Duplex Relay-Assisted D2D Communication

“…When a large number K of relays is available, the diversity gain reaches a value of 2K. Furthermore, a number of works have provided delay-aware versions of HRS see, e.g., [17]) and max − link (see, e.g., [18], [19]) to improve delay performance. Within this context, in [20], through centralized coordination, Buffer State Information (BSI) is exchanged and the best relay is selected, as long as buffers are not empty or full.…”