Please use this identifier to cite or link to this item: http://localhost:80/xmlui/handle/123456789/1149
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNasir, Hina-
dc.contributor.authorJavaid, Nadeem-
dc.contributor.authorRaza, Waseem-
dc.contributor.authorGuizani, Mohsen-
dc.contributor.authorAlrajeh, Nabil-
dc.contributor.authorAlabed, Mohamad Souheil-
dc.date.accessioned2019-11-12T09:34:43Z-
dc.date.available2019-11-12T09:34:43Z-
dc.date.issued2018-11-13-
dc.identifier.issn2169-3536-
dc.identifier.urihttp://142.54.178.187:9060/xmlui/handle/123456789/1149-
dc.description.abstractThis paper investigates the performance of a buffer-aided cooperative relay network. In the proposed design, each location in a buffer is assumed to act independently called the virtual relay having a buffer of size 1. The relay selection is based on the instantaneous strength of the wireless link and status of the virtual relay buffer. The proposed scheme is analyzed for symmetric and asymmetric channel conditions and also for symmetric and asymmetric buffer sizes at the relay. Markov chain is used to model the evolution of buffer status and to derive the closed-form expressions for outage probability, diversity gain, delay, and throughput. The proposed design achieves the diversity gain of (L 1 + L 2 + · · · + L K ), where L i is the buffer size of the i-th relay and K is the total number of relays.en_US
dc.language.isoen_USen_US
dc.publisherIEEE Accessen_US
dc.subjectMedical and Health Sciencesen_US
dc.subjectPower system reliabilityen_US
dc.subjectDiversity methodsen_US
dc.subjectMarkov processesen_US
dc.subjectDiversity gainen_US
dc.subjectOutage probabilityen_US
dc.subjectCooperative communicationen_US
dc.subjectBuffer-aideden_US
dc.titleVirtual-Link Relay Selection Scheme for Buffer-Aided IoT Based Cooperative Relay Networksen_US
dc.typeArticleen_US
Appears in Collections:Journals

Files in This Item:
File Description SizeFormat 
keywords#keywords.htm133 BHTMLView/Open


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