Randomized Masking in Cognitive Radio Networks

Abstract

A decentralized network of one Primary User (PU) and several Secondary Users (SU) is studied. PU is licensed to exploit the resources, while the party of SUs intend to share the resources with PU. Each SU must guarantee to not disturb the performance of PU beyond a certain level, while maintaining a satisfactory quality of service for itself. It is proposed that each secondary transmitter adopts a Randomized Masking (RM) strategy with full average transmission power where it remains silent or transmits a symbol in its codeword independently from transmission slot to transmission slot. We consider a setup where the primary transmitter is unaware of channel coefficients, code-books of secondary users and the number of secondary users. SUs are anonymous to each other, i.e, they are unaware of each others' code-books, however, each SU is smart in the sense that it is aware of the code-book of PU, channel coefficients and the number of active SUs. Invoking the concept of e-outage capacity, we define the (e,ν)-admissible region as the set of masking probabilities for each SU such that the probability of outage for PU is maintained under a threshold \varepsilon in a case where PU sets its transmission rate at a fraction ν of its e-outage capacity as if there were no SUs in the network. The masking probability of SUs is designed through maximizing the average (with respect to channel coefficients) achievable rate per SU over the (e,ν)-admissible region. In our analysis, the primary receiver treats interference as noise, however, each secondary receiver has the option to decode and cancel the interference caused by PU, while treating the signals of other SUs as noise. In another approach, referred to as Continuous Transmission with Power Control (CTPC), each SU transmits continuously (no masking is applied), however, it adjusts its transmission power in order to yield the largest value for average achievable rate per SU. The schemes RM and CTPC are compared for different values of transmission power for each SU and PU and distance between different users. It is observed that neither of RM or CTPC always outperforms the other in various scenarios in terms of the underlying system parameters. A combination of RM and CTPC referred to as Randomized Masking with Power Control (RMPC) is also investigated where each SU controls both its probability of masking and average transmission power. It is demonstrated through simulations that RMPC can outperform both RM and CTPC.