Abstract
Cognitive radio transceivers can opportunistically access underutilized spectrum resources for new wireless services. In an interweave implementation, secondary transmissions may be interrupted by primary users. This paper studies the resulting Extended Delivery Time (EDT), which includes both transmission and waiting times for fixed-size secondary packets. We derive exact distribution functions for EDT under both continuous and periodic sensing. Numerical and simulation results illustrate the mathematical formulation. Finally, we apply these results to an M/G/1 queuing setup at the secondary transmitter, formulating closed-form expressions for expected delay with Poisson traffic to facilitate secondary system design.
Introduction
In Cognitive Radio (CR) networks, Secondary Users (SUs) borrow spectrum from Primary Users (PUs) when it is idle. In an interweave implementation, the SU must immediately vacate the channel when the PU returns, leading to a fragmented transmission process. The total time from the start of the first transmission attempt to successful completion is defined as the Extended Delivery Time (EDT). While previous research often focused on average EDT, this is insufficient for designing systems with strict latency requirements. This paper provides a rigorous mathematical framework for calculating the exact probability distributions of EDT, enabling accurate queuing analysis.
Methodology
The authors model PU activity as a continuous-time Markov chain with exponentially distributed busy and idle periods. Two sensing strategies are analyzed:
- Continuous Sensing: The SU monitors the channel constantly and resumes transmission the instant the PU leaves.
- Periodic Sensing: The SU checks the channel at fixed intervals ($T_s$), which is more hardware-efficient but introduces additional "blind" waiting time.
To find the exact distribution of the EDT, the authors use Erlang distributions to model the sum of multiple random waiting periods. They derive closed-form expressions for the Probability Density Function (PDF) using modified Bessel functions for the continuous case and generalized hypergeometric functions for the periodic case.
Crucially, the study distinguishes between Type 1 packets (arriving at a non-empty queue) and Type 2 packets (arriving at an empty queue). A packet arriving at an empty queue might find the PU "on" or "off," whereas a packet waiting in line (Type 1) starts its service the moment the previous packet finishes, at which point the PU is guaranteed to be "off" (in continuous sensing). Ignoring this distinction leads to significant errors in total delay estimation.
Key Results and Insights
The derived closed-form expressions for the PDF of EDT show a "perfect match" with Monte-Carlo simulation results across various PU traffic intensities.
A key insight is the impact of the sensing interval ($T_s$). As $T_s$ increases, the delivery time distribution shifts and broadens, indicating higher latency. As $T_s$ approaches zero, the periodic sensing model mathematically converges to the continuous sensing model, providing a unified framework.
The proposed queuing analysis significantly outperforms conventional M/G/1 approaches. By accounting for the buffer status upon arrival, the model avoids the underestimation of delay common in simpler models, especially as the secondary arrival rate increases.
Conclusion
This paper establishes a robust analytical foundation for evaluating secondary transmission delays in cognitive networks. By providing exact EDT distributions, it allows for precise performance guarantees in real-time applications. Future work may extend this to include sensing errors, non-Poisson PU traffic, and multi-channel scenarios.
Summary updated