This technique expands the simple flooding technique (in which a node relays every unique packet once) with a mechanism to avoid redundant transmissions.
In forwarding, intermediate nodes relay a single copy of the packet over several hops towards the final destination.
Consider a three-node relay channel, where a source communicates with a destination through a single relay as depicted in Figure 1.
A node will only relay data packets when there is free room at the next node.
Furthermore, if a node suddenly stops relaying, the sender will hardly detect it, which leads to an increased communication cost.
We consider a three-node relay channel, where a single-antenna source communicates with an N-antenna destination through a full-duplex relay, as depicted in Fig. 1.
We consider a three-node relay network which consists of a source, destination, and a relay node.
Hence, the relaxed solution provides a fast option for practical use. Figure 1 depicts a relay network consisting of a source node, a relay node, and a destination node, where the source and destination nodes are equipped with M antennas, and the relay node is equipped with L antennas.
Early works of buffer-aided relaying systems can be founded in [14] and [15], where a three-node relaying system was considered and a data buffer was introduced at relay node.
Firstly, in this work, we consider a cognitive relay network but in [23, 29, 33] authors considered a three-node relay network, another kind of cognitive relay network, and a relay-aided cellular network, respectively.
As shown in Figure 1, we considrer a three-node multi-antenna relay network that consists of a source node, a relay node, and a destination node, equipped with M, N, and P antennas, respectively.
