Buffer-State-and-Thresholding-Based Amplify-and-Forward Cooperative Networks

Oiwa, Miharu; Nakai, Ryota; Sugiura, Shinya

doi:10.1109/lwc.2017.2729547

Cited by 28 publications

(24 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Buffer state-based relay selection scheme based on AF relaying is recommended in [16]. It operates on a dynamic communication paradigm.…”

Section: Buffer Occupancy-based Af Schemementioning

confidence: 99%

“…Here γ th A is the threshold at relay for AF relaying to avoid noise propagation. This threshold technique is introduced in [16]. In AF relaying, data is not decode-able at the relay.…”

Section: Step 1: Relay Selectionmentioning

confidence: 99%

“…The authors explore [4] using amplify and forward (AF) relaying technique in [15]. This scheme is further studied in [16] using buffer occupancy as a main selection criterion. Another work for buffer-aided cooperative relaying using AF relaying is proposed in [17].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

et al. 2020

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

“…Buffer state-based relay selection scheme based on AF relaying is recommended in [16]. It operates on a dynamic communication paradigm.…”

Section: Buffer Occupancy-based Af Schemementioning

confidence: 99%

“…Here γ th A is the threshold at relay for AF relaying to avoid noise propagation. This threshold technique is introduced in [16]. In AF relaying, data is not decode-able at the relay.…”

Section: Step 1: Relay Selectionmentioning

confidence: 99%

See 1 more Smart Citation

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

et al. 2020

View full text Add to dashboard Cite

show abstract

“…The analysis showed that the optimal link selection policy is defined by a queue length threshold in order to exploit the transmission opportunities in both links. In addition, a threshold-based approach has been proposed in [19] aiming to choose relays whose buffers are not on the brink of starvation. In this way, diversity was shown to be preserved.…”

Section: A Backgroundmentioning

confidence: 99%

Low-Complexity Buffer-Aided Link Selection With Outdated CSI and Feedback Errors

Νομικός

Charalambous

Vouyioukas

et al. 2018

IEEE Trans. Commun.

View full text Add to dashboard Cite

Buffer-aided relays can improve the diversity of multi-hop networks, however, they increase packet delays. Thus, various delay-aware protocols have been developed, but without considering the transmission diversity. Moreover, most works adopt ideal assumptions, such as symmetric links, perfect Channel State Information (CSI) and error-free feedback channels. So, we propose a Low-Complexity (LoCo) link selection algorithm, herein called LoCo − Link. The proposed algorithm may experience delays during CSI updates, and hence, by using outdated CSI its performance may deteriorate. To alleviate this issue, we next propose a distributed version of LoCo − Link (d − LoCo − Link) dealing with outdated CSI. In both algorithms, the source performs broadcasting towards multiple relays; when the packets are transmitted by a relay to the destination, they are discarded from all other relays. This coordination relies on feedback channels. For non error-free feedback channels, we propose a scheme in which the relays listen to the transmission of the best relay and drop duplicate packets. Results show that LoCo − Link surpasses other algorithms, by decreasing the delay in asymmetric networks. Moreover, d − LoCo − Link avoids diversity losses due to outdated CSI, while the effect of non error-free feedback channels is mitigated by taking advantage of the inter-relay channels.

show abstract

“…BA ORS with broadcasting has been extended in [26], where {R→D} prioritization provided low-delay transmission while practical considerations, such as outdated CSI, distributed implementation and non error-free feedback were addressed through efficient mechanisms. Also, a threshold-based approach has been proposed in [27], classifying the relays into two categories, one for transmission and one for reception, depending on their BSI. So, at each time-slot, one or more relays were activated for reception or a single relay was activated for transmission, depending on their classification, thus maintaining the diversity of the network.…”

Section: A Related Workmentioning

confidence: 99%

Delay- and diversity-aware buffer-aided relay selection policies in cooperative networks

Poulimeneas

Charalambous

Νομικός

et al. 2016

2016 IEEE Wireless Communications and Networking Conference

View full text Add to dashboard Cite

Buffer-Aided (BA) relaying has shown tremendous performance improvements in terms of throughput and outage probability, although it has been criticized of suffering from long delays that are restrictive for applications, such as video streaming, Web browsing, and file sharing. In this paper, we propose novel relay selection policies aiming at reducing the average delay by incorporating the buffer size of the relays into the decision making of the relay selection process. More specifically, we first propose two new delay-aware policies. One is based on the hybrid relay selection algorithm, where the relay selection takes into account the queue sizes so that the delay is reduced and the diversity is maintained. The other approach is based on the max − link relay selection algorithm. For the max − link algorithm, a delay-aware only approach starves the buffers and increases the outage probability of the system. Thus, for max − link, we propose a delay-and diversity-aware BA relay selection policy targeting the reduction of the average delay, while maintaining the diversity of the transmission. The proposed policies are analyzed by means of Markov Chains and expressions for the outage, throughput, and delay are derived. The asymptotic performance of the policies is also discussed. The improved performance in terms of delays and the use of the proposed algorithms are demonstrated via extensive simulations and comparisons, signifying, at the same time, the need for adaptive mechanisms to handle the interplay between delay and diversity.

show abstract

Buffer-State-and-Thresholding-Based Amplify-and-Forward Cooperative Networks

Cited by 28 publications

References 13 publications

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

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

Low-Complexity Buffer-Aided Link Selection With Outdated CSI and Feedback Errors

Delay- and diversity-aware buffer-aided relay selection policies in cooperative networks

Contact Info

Product

Resources

About