Sensing and Probing Cardinalities for Active Cognitive Radios


In a cognitive radio network, opportunistic spectrum access (OSA) to the underutilized spectrum involves not only sensing the spectrum occupancy but also probing the channel quality in order to identify an idle and good channel for data transmission-particularly if a large number of channels is open for secondary spectrum reuse. Although such a joint mechanism, referred to as active sensing, may improve the OSA performance due to diversity, it inevitably incurs additional energy consumption. In this paper, we consider a wideband cognitive radio network with limited available frame energy and treat a fundamental energy allocation problem: how available energy should be optimally allocated for sensing, probing, and data transmission to maximize the achievable average OSA throughput. By casting this problem into the multiarmed bandit framework under probably approximately correct (PAC) learning, we put forth a proactive strategy for determining the optimal sensing cardinality (the number of channels chosen to sense) and probing cardinality (the number of channels chosen to probe) that maximize the average throughput of the secondary user with limited available frame energy. This framework determines the optimal amount of pure exploration for the active sensing OSA bandit problem in which we refine the action (median) elimination algorithm for channel probing to minimize the sample complexity in PAC learning. Numerical results show that the optimal active sensing achieves a significant throughput gain over the (even optimal) sensing alone. Therefore, this work provides an energy allocation policy to optimally balance the available energy between exploration (sensing and probing) and exploitation (data transmission), giving the optimal diversity-energy tradeoff for the average OSA throughput.

Did you like this research project?

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

PROJECT TITLE :Uniform Recovery Bounds for Structured Random Matrices in Corrupted Compressed Sensing - 2018ABSTRACT:We study the problem of recovering an s-sparse signal x* ? C n from corrupted measurements y = Ax* + z* + w,
PROJECT TITLE :Structure-Aware Bayesian Compressive Sensing for Frequency-Hopping Spectrum Estimation With Missing Observations - 2018ABSTRACT:During this Project, we tend to address the matter of spectrum estimation of multiple
PROJECT TITLE :Optimal Hybrid Spectrum Sensing Under Control Channel Usage Constraint - 2018ABSTRACT:Cooperative spectrum sensing significantly improves the detection reliability of a cognitive radio network. In cooperative spectrum
PROJECT TITLE :A Robust Parallel Algorithm for Combinatorial Compressed Sensing - 2018ABSTRACT:It was shown in previous work that a vector x E R n with at most k
PROJECT TITLE :Jammer Sensing and Performance Analysis of MC-CDMA Ultrawideband Systems in the Presence of a Wideband Jammer - 2018ABSTRACT:Jamming, either intentional or unintentional, is a massive, and increasingly prevalent,

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry