Maximum Throughput Region of Multiuser Cognitive Access of Continuous Time Markovian Channels

The problem of cognitive access of multiple primary channels by multiple cognitive users is considered. The primary transmission on each channel is modeled by a continuous time Markov on-off process. Cognitive access of the primary channels is realized via channel sensing. Each cognitive user adopts a slotted transmission structure, senses one channel in each slot and makes the transmission decision based on the sensing outcome. The cognitive transmissions in each channel are subject to collision constraints that limit their interference to the primary users. The maximum throughput region of this multiuser cognitive network is characterized by establishing inner and outer bounds. Under tight collision constraints, the inner bound is obtained by a simple orthogonalized periodic sensing with memoryless access policy and its generalizations. The outer bound, on the other hand, is obtained by relating the sum throughput with the interference limits. It is shown that when collision constraints are tight, the outer and inner bounds match. This maximum throughput region result is further extended by a generalized periodic sensing scheme with a mechanism of timing sharing. Under general collision constraints, another outer bound is obtained via Whittle's relaxation and another inner bound obtained via Whittle's index sensing policy with memoryless access. Packet level simulations are used to validate the analytical performance prediction.

[1]  Mingyan Liu,et al.  Optimality of Myopic Sensing in Multi-Channel Opportunistic Access , 2008, 2008 IEEE International Conference on Communications.

[2]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[3]  Lang Tong,et al.  Multiuser cognitive access of continuous time Markov channels: Maximum throughput and effective bandwidth regions , 2010, 2010 Information Theory and Applications Workshop (ITA).

[4]  Lang Tong,et al.  Optimal Cognitive Access of Markovian Channels under Tight Collision Constraints , 2011, IEEE J. Sel. Areas Commun..

[5]  Brian M. Sadler,et al.  Opportunistic Spectrum Access via Periodic Channel Sensing , 2008, IEEE Transactions on Signal Processing.

[6]  P. Whittle Restless bandits: activity allocation in a changing world , 1988, Journal of Applied Probability.

[7]  Qing Zhao,et al.  Separation principle for opportunistic spectrum access in unslotted primary systems , 2009, 2009 43rd Annual Conference on Information Sciences and Systems.

[8]  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.

[9]  Brian M. Sadler,et al.  Cognitive Medium Access: Constraining Interference Based on Experimental Models , 2008, IEEE Journal on Selected Areas in Communications.

[10]  Qing Zhao,et al.  Learning and sharing in a changing world: Non-Bayesian restless bandit with multiple players , 2011, 2011 Information Theory and Applications Workshop.

[11]  Lang Tong,et al.  Low-complexity distributed spectrum sharing among multiple cognitive users , 2010, 2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE.

[12]  Ao Tang,et al.  Opportunistic Spectrum Access with Multiple Users: Learning under Competition , 2010, 2010 Proceedings IEEE INFOCOM.

[13]  Lang Tong,et al.  Delay Analysis for Cognitive Radio Networks with Random Access: A Fluid Queue View , 2010, 2010 Proceedings IEEE INFOCOM.

[14]  Ananthram Swami,et al.  Decentralized cognitive MAC for opportunistic spectrum access in ad hoc networks: A POMDP framework , 2007, IEEE Journal on Selected Areas in Communications.

[15]  Qing Zhao,et al.  Distributed Learning in Multi-Armed Bandit With Multiple Players , 2009, IEEE Transactions on Signal Processing.

[16]  Bhaskar Krishnamachari,et al.  On myopic sensing for multi-channel opportunistic access: structure, optimality, and performance , 2007, IEEE Transactions on Wireless Communications.

[17]  Hai Jiang,et al.  Medium access in cognitive radio networks: A competitive multi-armed bandit framework , 2008, 2008 42nd Asilomar Conference on Signals, Systems and Computers.

[18]  Lang Tong,et al.  Distributed multiaccess in hierarchical cognitive radio networks , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[19]  Brian M. Sadler,et al.  Dynamic spectrum access in WLAN channels: empirical model and its stochastic analysis , 2006, TAPAS '06.

[20]  Brian M. Sadler,et al.  A Survey of Dynamic Spectrum Access , 2007, IEEE Signal Processing Magazine.

[21]  Qing Zhao,et al.  Indexability of Restless Bandit Problems and Optimality of Whittle Index for Dynamic Multichannel Access , 2008, IEEE Transactions on Information Theory.

[22]  Zhi Ding,et al.  Optimal Transmission Strategies for Dynamic Spectrum Access in Cognitive Radio Networks , 2009, IEEE Transactions on Mobile Computing.