Cognitive Radio Networks With Probabilistic Relaying: Stable Throughput and Delay Tradeoffs

PROJECT TITLE :

Cognitive Radio Networks With Probabilistic Relaying: Stable Throughput and Delay Tradeoffs

ABSTRACT:

This paper studies elementary throughput and delay tradeoffs in cognitive radio systems with cooperative secondary users. We target randomized cooperative policies, whereby the secondary user (SU) serves either its own queue or the first users (PU) relayed packets queue with sure service probability. The proposed policy opens space for trading the PU delay for enhanced SU delay, and vice versa, depending on the application QoS necessities. Towards this objective, the system's stable throughput region is characterized. Furthermore, the instant generating operate approach is used and generalized for our system to derive closed-type expressions for the common packet delay for each users. The accuracy of these expressions is validated through simulations. Analytical and simulation results reveal that the service likelihood will steer the system into prioritizing PU's traffic at the expense of SU's QoS, or vice versa, independently from the admission probability. Alternatively, the flexibility of the admission likelihood to regulate the throughput and delay at the PU or the SU depends on the chosen worth for the service probability in addition because the channel conditions. Finally, it's shown how the service and admission possibilities could be used to achieve the required QoS level to each PU and SU.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here