PROJECT TITLE :
Bidirectional Buffer-Aided Relay Networks With Fixed Rate Transmission—Part I: Delay-Unconstrained Case
In this paper, we consider bidirectional relay networks in which 2 users exchange info only via a relay node, i.e., an immediate link between each users is not present. We tend to assume that channel state info at the transmitter is not obtainable and/or only one coding and modulation scheme is employed because of complexity constraints. Therefore, the nodes transmit with a mounted predefined rate irrespective of the channel state. In general, the nodes within the network can assume one among three potential states in each time slot, particularly, the transmit, the receive, and therefore the silent state. Most of the existing bidirectional relaying protocols assume a prefixed schedule for the sequence in that the states of the nodes are used. During this paper, we abandon the restriction of getting a fixed and predefined schedule and consider the selection of the states of the nodes as a degree of freedom that can be exploited for performance optimization. To this finish, the relay needs to be equipped with 2 buffers for storage of the data received from the two users. In Half I of this paper, we have a tendency to propose a delay-unconstrained protocol that, based mostly on the qualities of the concerned links, selects the optimal states of the nodes in every time slot such that the sum throughput is maximized. In Half II, several delay-constrained protocols are proposed and analyzed. Numerical results show that the proposed protocols significantly outperform the existing bidirectional relaying protocols in the literature.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here