Search

This paper proposes the integration of non-orthogonal multiple access (NOMA) and broadcasting with buffer-aided (BA) full-duplex (FD) relaying to improve the spectral efficiency of a single-source two-user network. Furthermore, opportunistic relay selection is employed, activating one or two FD relays to support the end-to-end communication. The network performance is improved through buffers, allowing to switch to half-duplex (HD) transmission/reception when FD operation is not feasible. A hybrid BA FD/HD NOMA relay selection algorithm is proposed, herein called $\mathop {\mathrm{BAHyNOMA}}$ , orchestrating the three aforementioned techniques, towards a simple yet efficient and robust relay selection. $\mathop {\mathrm{BAHyNOMA}}$ is evaluated in terms of outage probability, average sum-rate and average delay, and it is observed that the average sum-rate can be doubled, while maintaining low latency. [ABSTRACT FROM AUTHOR]

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 $\mathop {\mathrm {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 $\mathop {\mathrm {LoCo\!\!-\!\!Link}}$ ($\mathop {\mathrm {d\!\!-\!\!LoCo\!\!-\!\!Link}}$) dealing with outdated CSI. In both algorithms, the source performs broadcasting toward 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 $\mathop {\mathrm {LoCo\!\!-\!\!Link}}$ surpasses other algorithms, by decreasing the delay in asymmetric networks. Moreover, $\mathop {\mathrm {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. [ABSTRACT FROM AUTHOR]

We consider a wireless relay network that consists of a source, half-duplex decode-and-forward buffer-aided relays and a destination. While the majority of previous works on relay selection assume no direct transmission between source and destination in such a setting, we lift this assumption and propose a link selection policy that exploits both the buffering ability and the opportunity for successful reception of a packet directly from the source. The proposed relay selection scheme incorporates the instantaneous strength of the wireless links and adapts the relay selection decision based on the strongest available link. The evolution of the network as a whole is modeled by means of a Markov chain and thus, the outage probability is associated with the steady state of the Markov chain. It is deduced that even if the link between the source and the destination is in principle a very unreliable link, it is always beneficial for the source to multicast a packet to both the relay with the strongest available link and the destination. [ABSTRACT FROM PUBLISHER]