2019
DOI: 10.1109/access.2019.2956542
|View full text |Cite
|
Sign up to set email alerts
|

Performance Evaluation of Generalized Buffer-State-Based Relay Selection in NOMA-Aided Downlink

Abstract: In this paper, we propose a novel buffer-state-based (BSB) non-orthogonal multiple access (NOMA)-aided downlink scheme for a two-hop cooperative network supporting multiple relay and destination nodes. More specifically, in the broadcast phase, the source node broadcasts information packets to multiple selected relay nodes. In the relaying phase, a selected relay node transmits packets to multiple destination nodes based on the NOMA principle. Here, the use of buffer at the relay nodes allows us to achieve a f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

1
13
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 12 publications
(14 citation statements)
references
References 31 publications
1
13
0
Order By: Relevance
“…In this section, we derive the theoretical bounds of the throughput, the outage probability, the average packet delay, and the diversity order for the proposed scheme. Our theoretical analysis is based on a Markov chain model, similar to conventional studies [25,27,29]. For example, for the scenario of two relay nodes with a buffer size of L = 2, we have 19 states, as shown in Table 3 of [25].…”
Section: Derivation Of Theoretical Boundsmentioning
confidence: 99%
See 3 more Smart Citations
“…In this section, we derive the theoretical bounds of the throughput, the outage probability, the average packet delay, and the diversity order for the proposed scheme. Our theoretical analysis is based on a Markov chain model, similar to conventional studies [25,27,29]. For example, for the scenario of two relay nodes with a buffer size of L = 2, we have 19 states, as shown in Table 3 of [25].…”
Section: Derivation Of Theoretical Boundsmentioning
confidence: 99%
“…Moreover, in [25][26][27][28][29][30], broadcasting an information packet from a source node to multiple relay nodes was introduced in the context of the aforementioned buffer-aided cooperative communications; this allows relay nodes to share a common information packet, hence increasing the degree of freedom in buffer states. As a result, the source-to-destination (SD) communication delay was kept at the minimum while achieving the high reliability of buffer-aided relay selection.…”
mentioning
confidence: 99%
See 2 more Smart Citations
“…These two schemes are capable of attaining a lower average packet delay than the original MMRS and max-link counterparts, owing to the beneficial effects of packet sharing among the relay nodes. Furthermore, the concept of BSB relay selection was proposed in [9], which was then introduced into the beamforming-assisted G-ML scheme [12], the fullduplex scheme [24], the NOMA-based downlink [25], and the secure relaying scheme [13]. Since one of the challenges in the buffer-aided relaying protocols is an increased packet delay [3], the relay selection scheme in [26] was proposed for achieving a significant reduction of the packet delay, compared to the max-link scheme [6] by introducing a priority on the relay selection criterion.…”
Section: Preliminary Workmentioning
confidence: 99%