Buffer-Aided Relaying with Adaptive Link Selection
Nikola Zlatanov, Robert Schober, and Petar Popovski

TL;DR
This paper introduces a buffer-aided relaying protocol with adaptive link selection that dynamically chooses transmission links based on channel conditions, significantly improving throughput in relay networks.
Contribution
It proposes a novel adaptive link selection protocol with buffer management, providing optimal policies and delay bounds for relay networks.
Findings
Achieves higher throughput than fixed-schedule relaying.
Provides optimal link selection and power allocation strategies.
Offers delay bounds and buffer overflow prevention methods.
Abstract
In this paper, we consider a simple network consisting of a source, a half-duplex decode-and-forward relay, and a destination. We propose a new relaying protocol employing adaptive link selection, i.e., in any given time slot, based on the channel state information of the source-relay and the relay-destination link a decision is made whether the source or the relay transmits. In order to avoid data loss at the relay, adaptive link selection requires the relay to be equipped with a buffer such that data can be queued until the relay-destination link is selected for transmission. We study both delay constrained and delay unconstrained transmission. For the delay unconstrained case, we characterize the optimal link selection policy, derive the corresponding throughput, and develop an optimal power allocation scheme. For the delay constrained case, we propose to starve the buffer of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
