Title :
Decentralized cognition via Randomized Masking
Author :
Moshksar, Kamyar ; Khandani, Arnir K.
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Waterloo, Waterloo, ON, Canada
Abstract :
A decentralized network of one Primary User (PU) and several Secondary Users (SU) is studied. The number of SUs is modeled by a random variable with a globally known distribution. 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 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 the channel gains, the code-book of the secondary users and the number of secondary users. Although the SUs are anonymous to each other, i.e, they are unaware of each other´s code-book, however, each SU is smart in the sense that it is aware of the code-book of PU, the channel gains and the number of active SUs. Invoking the concept of ε-outage capacity, we define the ε-admissible region as the set of possible transmission rates for PU and possible masking probabilities for each SU such that the probability of outage for PU is maintained under a threshold ε. Thereafter, the transmission rate of PU and the masking probability of SUs are designed through maximizing a globally known utility function of the rates of users over the ε-admissible region. In our analysis, the primary receiver treats interference as noise, however, each secondary receiver has the option to decode interference caused by PU, while treating the signals of other SUs as noise. In another approach, referred to as Power Control (PC), each SU transmits continuously (no masking is applied), however, it regulates its transmission power in order to yield the largest value for the utility function. It is demonstrated that PC offers a better performance in a regime where the tran- mission power for PU is relatively low, while RM outperforms PC if the transmission power for PU is sufficiently large.
Keywords :
probability; quality of service; radio receivers; radio transmitters; radiofrequency interference; random processes; telecommunication channels; ε-admissible region; RM strategy; channel gains; code-book; codeword; decentralized cognition; decentralized network; masking probability; noise interference; outage probability; power control; primary receiver; primary transmitter; primary user; quality of service; random variable; randomized masking; resource sharing; secondary receiver; secondary transmitter; secondary user; transmission power; transmission rate; transmission slot; Blogs; Decoding; Silicon; Transmitters;
Conference_Titel :
Signals, Systems and Computers (ASILOMAR), 2011 Conference Record of the Forty Fifth Asilomar Conference on
Conference_Location :
Pacific Grove, CA
Print_ISBN :
978-1-4673-0321-7
DOI :
10.1109/ACSSC.2011.6190319