Abstract

With the knowledge of channel occupancy rate (COR), cognitive radios can significantly improve their performance in exploring and exploiting spectrum holes. However, most existing COR estimators suffer from overestimation or underestimation even at high signal-to-noise ratios (SNRs). The iterative threshold-setting algorithm (ITA) is promising to address this issue. In this work, we revisit ITA and provide a thorough theoretical analysis of ITA. First, we prove that ITA converges to the true COR with a sufficiently large number of traffic samples. Then, we investigate its convergence when the number of traffic samples is small, and show that ITA deviates from the true COR especially at low SNRs. To address this issue, we analyze the upper bound of the number of traffic samples required to achieve a certain estimation error, and further propose an improved ITA (iITA). The proposed iITA enables us to achieve a prespecified estimation accuracy by adaptively adjusting the number of traffic samples. Extensive simulation results are provided, which validate our analyses and demonstrate the superior performance of ITA and iITA compared to state-of-the-art COR estimators.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.