Decentralized cognition via Randomized Masking

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 transmission power for PU is relatively low, while RM outperforms PC if the transmission power for PU is sufficiently large.

[1]  Kamyar Moshksar,et al.  Randomized Resource Allocation in Decentralized Wireless Networks , 2011, IEEE Transactions on Information Theory.

[2]  Jinhua Jiang,et al.  Ieee Transactions on Information Theory (accepted) on the Achievable Rate Regions for Interference Channels with Degraded Message Sets , 2022 .

[3]  Jeffrey H. Reed,et al.  Outage probability based comparison of underlay and overlay spectrum sharing techniques , 2005, First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005..

[4]  Cristina Comaniciu,et al.  Adaptive Channel Allocation Spectrum Etiquette for Cognitive Radio Networks , 2005, First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005..

[5]  Sriram Vishwanath,et al.  On the capacity of partially cognitive radios , 2009, 2009 IEEE International Symposium on Information Theory.

[6]  Anant Sahai,et al.  What is a Spectrum Hole and What Does it Take to Recognize One? , 2009, Proceedings of the IEEE.

[7]  Shlomo Shamai,et al.  A cognitive network with clustered decoding , 2009, 2009 IEEE International Symposium on Information Theory.

[8]  Patrick Mitran,et al.  Achievable rates in cognitive radio channels , 2006, IEEE Transactions on Information Theory.

[9]  R. M. Dudley,et al.  Real Analysis and Probability , 1989 .

[10]  R.A. Berry,et al.  Spectrum sharing with distributed interference compensation , 2005, First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005..

[11]  Andrea J. Goldsmith,et al.  Competition in Wireless Systems via Bayesian Interference Games , 2007, ArXiv.

[12]  Cristina Comaniciu,et al.  Adaptive channel allocation spectrum etiquette for cognitive radio networks , 2005 .

[13]  Leandros Tassiulas,et al.  Distributed topology construction of Bluetooth wireless personal area networks , 2005, IEEE Journal on Selected Areas in Communications.

[14]  Roy D. Yates,et al.  Capacity of Interference Channels With Partial Transmitter Cooperation , 2007, IEEE Transactions on Information Theory.

[15]  Abhay Parekh,et al.  Spectrum sharing for unlicensed bands , 2005, IEEE Journal on Selected Areas in Communications.

[16]  Haitao Zheng,et al.  Distributed spectrum allocation via local bargaining , 2005, 2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005..

[17]  I.D. O'Donnell,et al.  Spectrum sharing radios , 2006, IEEE Circuits and Systems Magazine.

[18]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

[19]  Hanif D. Sherali,et al.  Spectrum Sharing for Multi-Hop Networking with Cognitive Radios , 2008, IEEE Journal on Selected Areas in Communications.

[20]  A. P. Hulbert Spectrum sharing through beacons , 2005, 2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications.

[21]  Michael Gastpar,et al.  On Capacity Under Receive and Spatial Spectrum-Sharing Constraints , 2007, IEEE Transactions on Information Theory.

[22]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[23]  Zhi-Quan Luo,et al.  Dynamic Spectrum Management: When is FDMA Sum-Rate Optimal? , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

[24]  Xiaodong Wang,et al.  An improved achievable rate region for causal cognitive radio , 2009, 2009 IEEE International Symposium on Information Theory.

[25]  Joseph Mitola,et al.  Cognitive Radio An Integrated Agent Architecture for Software Defined Radio , 2000 .

[26]  Shlomo Shamai,et al.  Capacity and lattice strategies for canceling known interference , 2005, IEEE Transactions on Information Theory.

[27]  S. Srinivasa,et al.  The Throughput Potential of Cognitive Radio: A Theoretical Perspective , 2006, 2006 Fortieth Asilomar Conference on Signals, Systems and Computers.

[28]  Te Sun Han,et al.  A new achievable rate region for the interference channel , 1981, IEEE Trans. Inf. Theory.

[29]  R.T. Maheswaran,et al.  Decentralized network resource allocation as a repeated noncooperative market game , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[30]  Anant Sahai,et al.  SNR Walls for Signal Detection , 2008, IEEE Journal of Selected Topics in Signal Processing.

[31]  Amos Lapidoth,et al.  Nearest neighbor decoding for additive non-Gaussian noise channels , 1996, IEEE Trans. Inf. Theory.

[32]  K. J. Ray Liu,et al.  Dynamic Spectrum Sharing: A Game Theoretical Overview , 2007 .

[33]  David Tse,et al.  Spectrum Sharing Between Wireless Networks , 2008, INFOCOM.

[34]  Jaap Haartsen,et al.  BLUETOOTH—The universal radio interface for ad hoc, wireless connectivity , 1998 .

[35]  Amir Ghasemi,et al.  Fundamental limits of spectrum-sharing in fading environments , 2007, IEEE Transactions on Wireless Communications.

[36]  Anant Sahai,et al.  Fundamental tradeoffs in robust spectrum sensing for opportunistic frequency reuse , 2006 .

[37]  Sriram Vishwanath,et al.  On the capacity of multi-user cognitive radio networks , 2009, 2009 IEEE International Symposium on Information Theory.

[38]  Wei Wu,et al.  Capacity of a Class of Cognitive Radio Channels: Interference Channels With Degraded Message Sets , 2007, IEEE Transactions on Information Theory.

[39]  Shlomo Shamai,et al.  Capacity of Cognitive Interference Channels With and Without Secrecy , 2009, IEEE Transactions on Information Theory.

[40]  S. Mattisson,et al.  Bluetooth-a new low-power radio interface providing short-range connectivity , 2000, Proceedings of the IEEE.