Abstract
In this paper, we consider a bidirectional relay network with half-duplex nodes and block fading where the nodes transmit with a fixed transmission rate. Thereby, user 1 and user 2 exchange information only via a relay node, i.e., a direct link between both users is not present. Recently in [1], it was shown that a considerable gain in terms of sum throughput can be obtained in bidirectional relaying by optimally selecting the transmission modes or, equivalently, the states of the nodes, i.e., the transmit, the receive, and the silent states, in each time slot based on the qualities of the involved links. To enable adaptive transmission mode selection, the relay has to be equipped with two buffers for storage of the data received from the two users. However, the protocol proposed in [1] was delay-unconstrained and provides an upper bound for the performance of practical delay-constrained protocols. In this paper, we propose a heuristic but efficient delay-constrained protocol which can approach the performance upper bound reported in [1]. Moreover, the average throughput and delay of the protocol are evaluated by analyzing the Markov chain of the states of the queues.
Original language | English |
---|---|
Title of host publication | 2014 IEEE Global Communications Conference |
Editors | Jeffrey Andrews, Robert Heath |
Place of Publication | Piscataway NJ USA |
Publisher | IEEE, Institute of Electrical and Electronics Engineers |
Pages | 4162-4167 |
Number of pages | 6 |
ISBN (Print) | 9781479935116 |
DOIs | |
Publication status | Published - 9 Feb 2014 |
Externally published | Yes |
Event | IEEE Global Telecommunications Conference 2014 - Austin, United States of America Duration: 8 Dec 2014 → 12 Dec 2014 https://ieeexplore.ieee.org/xpl/conhome/7008954/proceeding (Proceedings) |
Conference
Conference | IEEE Global Telecommunications Conference 2014 |
---|---|
Abbreviated title | IEEE GLOBECOM 2014 |
Country/Territory | United States of America |
City | Austin |
Period | 8/12/14 → 12/12/14 |
Internet address |