Cargando…

Understanding Probabilistic Cognitive Relaying Communication with Experimental Implementation and Performance Analysis

Efficiently use of the limited wireless spectrum can be achieved by cooperative cognitive relaying, where secondary users (SUs), who do not pay for the licensed spectrum and have better channel condition to the primary users (PUs) destination, can help the PU by relaying their traffic. A systematic...

Descripción completa

Detalles Bibliográficos
Autores principales: Khandakar, Amith, Mahmoud Salem Mohamed, Amr
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2019
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6338890/
https://www.ncbi.nlm.nih.gov/pubmed/30621341
http://dx.doi.org/10.3390/s19010179
Descripción
Sumario:Efficiently use of the limited wireless spectrum can be achieved by cooperative cognitive relaying, where secondary users (SUs), who do not pay for the licensed spectrum and have better channel condition to the primary users (PUs) destination, can help the PU by relaying their traffic. A systematic approach of implementing a Cooperative Cognitive Relaying framework using USRP2 is proposed in this paper, which could be used for practical experiments on cognitive radio applications. Two probabilities are introduced in the experiment in the paper and their effect on the PU and SU performance are studied and analyzed. The two probabilities are: (1) Probability of Admission, which controls the PU data that would be allowed by SU in their PU data queue (which could be relayed by SU later) and (2) Probability of Scheduling, which controls the selection of queue at the SU (PU relay data queue or the SU data queue) and the data of the selected queue would be relayed by SU during an idle time slot. Finally, the practical results from the varying of the introduced probabilities on the performance of PU and SU are verified with the simulation results. A very interesting result is found from the practical experiment where it is seen that increasing probability of scheduling of the PU packets at the SU is always in favor of the SU as opposed to the PU in terms of both throughput and delay.