Performance analysis of a buffer-aided incremental relaying in cooperative wireless network

Nasir, Hina; Javaid, Nadeem; Raza, Waseem; Imran, Muhammad; Guizani, Mohsen

doi:10.1109/iwcmc.2017.7986503

Cited by 6 publications

(2 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, for larger buffer size, the OP of the conventional max‐link scheme is better, while the APD of the proposed scheme is better [24]. The V‐MLRS in [22] is aspired by the proposed scheme in [25], where the authors utilise the idea of inverse channel packet matching to choose the best packet in the buffer, by allowing the packet that suffers bad channel condition in the S–R hop to go through good channel condition in the R–D hop to enhance the OP.…”

Section: Review Of Max‐link Relay Selection Policy and Comparison Witmentioning

confidence: 99%

Buffer‐aided relaying: a survey on relay selection policies

2020

View full text Add to dashboard Cite

Ever since the idea of buffers was incorporated in wireless communications, buffer‐aided relaying has become an emerging breakthrough in the world of transmitting and receiving signals. Equipping the relays with buffers adds a new degree of freedom capable of enhancing numerous quality‐of‐service (QoS) metrics including throughput, outage probability, power efficiency and physical‐layer security. The QoS enhancement is achieved by compromising the end‐to‐end delay that is inflicted by storing the packets in the relays' buffers until a suitable source–relay or relay–destination link is selected. In this context, the selection of a relay for transmission/reception is important since it governs the QoS‐delay trade‐off that can be contemplated. In this survey, the authors review and analyse various link selection protocols in buffer‐aided relaying systems. These relaying strategies are categorised and contrasted according to their performance levels, limitations, applications, system model assumptions and complexity. Finally, they discuss current challenges, and highlight future research directions.

show abstract

Section: Review Of Max‐link Relay Selection Policy and Comparison Witmentioning

confidence: 99%

Buffer‐aided relaying: a survey on relay selection policies

2020

View full text Add to dashboard Cite

show abstract

“…This concept allows improving the outage probability by providing the packets that passed through adverse C1 move through right C2 and vice versa. This scheme is enhanced in [18] by the inclusion of direct contact between the source and destination and using incremental relaying cooperative diversity technique. The work in [19] considered secrecy performance in buffer-aided cooperative relaying.…”

Section: Introductionmentioning

confidence: 99%

Analysis of Packet Diversity in Buffer-Aided Relaying over Symmetric and Asymmetric Rayleigh Fading Channels

et al. 2020

Self Cite

View full text Add to dashboard Cite

In this paper, we propose innovative schemes for relay selection that jointly explore packet selection and relay selection for buffer-aided amplify and forward (AF) cooperative relaying networks. The first proposed scheme chooses the most suitable channel based on link quality from all active channels, i.e., channels with neither empty nor full corresponding buffers. In the second proposed scheme, the most suitable channel is chosen based on buffer status. When the source-relay channel is determined, the corresponding relay collects data in the buffer. Likewise, when the relay-destination channel is picked, the most suitable packet is dispatched from the buffer. The most suitable packet is one that provides the highest end-to-end equivalent signal-to-noise ratio. We simulated the outage probability, average throughput and packet delay and analyzed the proposed protocol for both symmetric and asymmetric channel conditions. Comparison is made against the existing buffer-aided schemes. The results show that the proposed relay and packet selection systems help to reduce the outage probability, diversity gain and delay.

show abstract