Joint random spectrum sensing and access scheme for decentralized cognitive radio networks

In this paper we consider a cognitive radio network with access to N licensed primary frequency bands and their usage statistics, where the decentralized secondary users are subject to certain inter-network interference constraint. In particular, to limit the interference to the primary network, secondary users are equipped with spectrum sensors and are capable of sensing and accessing a limited number of channels at the same time due to hardware limitations. We consider both the error-free and erroneous spectrum sensing scenarios, and establish the jointly optimal random sensing and access scheme, which maximizes the secondary network expected sum throughput while honoring the primary interference constraint. We show that under certain conditions the optimal sensing and access scheme is independent of the primary frequency bandwidths and usage statistics; otherwise, they follow water-filling-like strategies. Moreover, we show that the performance of the secondary network depends on the ratio between the “opportunity-detection” probability and the “mis-detection” probability if the former is larger; otherwise, it depends on the ratio between the “false-alarm” probability and the “detection” probability. Finally, we demonstrate a binary behavior for the optimal access scheme at each channel, depending on whether the opportunity-detection probability or mis-detection probability is larger in that channel.

[1]  T. Weiss,et al.  Synchronization Algorithms and Preamble Concepts for Spectrum Pooling Systems , 2003 .

[2]  Nitin H. Vaidya,et al.  Capacity of multi-channel wireless networks: impact of number of channels and interfaces , 2005, MobiCom '05.

[3]  Ananthram Swami,et al.  Joint Design and Separation Principle for Opportunistic Spectrum Access in the Presence of Sensing Errors , 2007, IEEE Transactions on Information Theory.

[4]  R.W. Brodersen,et al.  Implementation issues in spectrum sensing for cognitive radios , 2004, Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004..

[5]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[6]  Michele Zorzi,et al.  Analysis of Random Access Protocols for Multi Channel Wireless Networks , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[7]  Thomas Bonald,et al.  Performance of CSMA in multi-channel wireless networks , 2010, Queueing Systems.

[8]  Alexandre Proutière,et al.  Resource Allocation over Network Dynamics without Timescale Separation , 2010, 2010 Proceedings IEEE INFOCOM.

[9]  Friedrich Jondral,et al.  Spectrum pooling: an innovative strategy for the enhancement of spectrum efficiency , 2004, IEEE Communications Magazine.

[10]  Jun Zhao,et al.  Distributed coordination in dynamic spectrum allocation networks , 2005, First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005..

[11]  Jean C. Walrand,et al.  Approaching Throughput-Optimality in Distributed CSMA Scheduling Algorithms With Collisions , 2010, IEEE/ACM Transactions on Networking.

[12]  Hang Su,et al.  Cross-Layer Based Opportunistic MAC Protocols for QoS Provisionings Over Cognitive Radio Wireless Networks , 2008, IEEE Journal on Selected Areas in Communications.

[13]  Ekram Hossain,et al.  A MAC Protocol for Opportunistic Spectrum Access in Cognitive Radio Networks , 2008, 2008 IEEE Wireless Communications and Networking Conference.

[14]  Donglin Hu,et al.  A Sensing Error Aware MAC Protocol for Cognitive Radio Networks , 2012, EAI Endorsed Trans. Mob. Commun. Appl..

[15]  Jian Ni,et al.  Distributed CSMA/CA algorithms for achieving maximum throughput in wireless networks , 2009, 2009 Information Theory and Applications Workshop.