DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/10116
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJoshi, Sandeep-
dc.date.accessioned2023-04-01T07:17:58Z-
dc.date.available2023-04-01T07:17:58Z-
dc.date.issued2020-
dc.identifier.urihttps://ieeexplore.ieee.org/document/9342814-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/10116-
dc.description.abstractA butter-aided cooperative communication network employing non-orthogonal multiple access (NOMA) with fixed gain amplify-and-forward relaying is considered in this paper. Using NOMA scheme the mobile user which acts as a relay and is a strong user transmits the information to the two destination devices which are the weak users. The strong user is aided with a data butter and it amplifies and forwards the superposed signal received from the source. The butter at the relay has the potential to offer flexible scheduling of data reception and transmission by utilizing the channel resources and also helps in offloading the data servers. The approximate upper bound expressions for the successful transmission probabilities at the two weak users are derived considering that the device acting as a relay (strong user) has global channel state information. By adopting a Markov chain approach to model the evolution of the strong user's butter status, the closed-form expression for the outage probability and the average packet delay of the system are also derived. Numerical results corroborate the derived analytical results.en_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.subjectEEEen_US
dc.subjectButter-aided relayingen_US
dc.subjectCooperative communicationen_US
dc.subjectNon-orthogonal multiple accessen_US
dc.titleBuffer-Aided AF Cooperative Relaying Network with NOMA Transmission Schemeen_US
dc.typeArticleen_US
Appears in Collections:Department of Electrical and Electronics Engineering

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.