Abstract
Sensing is a fundamental aspect in cognitive radio networks and one of the most complex issues. In the design of sensing strategies, a number of tradeoffs arise between throughput, interference to primary users, and energy consumption. This paper provides several Markovian models that enable the analysis and evaluation of sensing strategies under a broad range of conditions. The occupation of a channel by primary users is modeled as alternating idle and busy intervals, which are represented by a Markov phase renewal process. The behavior of secondary users is represented mainly through the duration of transmissions, sensing periods, and idle intervals between consecutive sensing periods. These durations are modeled by phase-type distributions, which endow the model with a high degree of generality. Unlike our previous work, here the source of secondary users is nonsaturated, which is a more practical assumption. The arrival of secondary users is modeled by the versatile Markovian arrival process, and models for both finite and infinite queues are built. Furthermore, the proposed models also incorporate a quite general representation of the resumption policy of an SU transmission after being interrupted by PUs activity. A comprehensive analysis of the proposed models is carried out to derive several key performance indicators in cognitive radio networks. Finally, some numerical results are presented to show that, despite the generality and versatility of the proposed models, their numerical evaluation is perfectly feasible.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.