The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (2011 vol.10)
pp: 239-253
Lifeng Lai , University of Arkansas at Little Rock, Little Rock
Hesham El Gamal , Ohio State University, Columbus
Hai Jiang , University of Alberta, Edmonton
H. Vincent Poor , Princeton University, Princeton
ABSTRACT
This paper considers the design of efficient strategies that allow cognitive users to choose frequency bands to sense and access among multiple bands with unknown parameters. First, the scenario in which a single cognitive user wishes to opportunistically exploit the availability of frequency bands is considered. By adopting tools from the classical bandit problem, optimal as well as low complexity asymptotically optimal solutions are developed. Next, the multiple cognitive user scenario is considered. The situation in which the availability probability of each channel is known is first considered. An optimal symmetric strategy that maximizes the total throughput of the cognitive users is developed. To avoid the possible selfish behavior of the cognitive users, a game-theoretic model is then developed. The performance of both models is characterized analytically. Then, the situation in which the availability probability of each channel is unknown a priori is considered. Low-complexity medium access protocols, which strike an optimal balance between exploration and exploitation in such competitive environments, are developed. The operating points of these low-complexity protocols are shown to converge to those of the scenario in which the availability probabilities are known. Finally, numerical results are provided to illustrate the impact of sensing errors and other practical considerations.
INDEX TERMS
Bandit problem, cognitive radio, exploration, exploitation, medium access.
CITATION
Lifeng Lai, Hesham El Gamal, Hai Jiang, H. Vincent Poor, "Cognitive Medium Access: Exploration, Exploitation, and Competition", IEEE Transactions on Mobile Computing, vol.10, no. 2, pp. 239-253, February 2011, doi:10.1109/TMC.2010.65
REFERENCES
[1] J. Mitola, "Cognitive Radio: Making Software Radios More Personal," IEEE Personal Comm., vol. 6, no. 4, pp. 13-18, Aug. 1999.
[2] S. Haykin, "Cognitive Radio: Brain-Empowered Wireless Communications," IEEE J. Selected Areas in Comm., vol. 23, no. 2, pp. 201-220, Feb. 2005.
[3] Q. Zhao, S. Geirhofer, L. Tong, and B.M. Sadler, "Opportunistic Spectrum Access via Periodic Channel Sensing," IEEE Trans. Signal Processing, vol. 56, no. 2, pp. 785-796, Feb. 2008.
[4] S. Geirhofer, L. Tong, and B.M. Sadler, "Dynamic Spectrum Access in the Time Domain: Modeling and Exploiting White Space," IEEE Comm. Magazine, vol. 45, no. 5, pp. 66-72, May 2007.
[5] Z. Sahinoglu and S. Tekinay, "On Multimedia Networks: Self-Similar Traffic and Network Performance," IEEE Comm. Magazine, vol. 37, no. 1, pp. 48-52, Jan. 1999.
[6] D.A. Berry and B. Fristedt, Bandit Problems: Sequential Allocation of Experiments. Chapman and Hall, 1985.
[7] R. Sutton and A. Barto, Reinforcement Learning: An Introduction. MIT Press, 1998.
[8] A. Motamedi and A. Bahai, "Dynamic Channel Selection for Spectrum Sharing in Unlicensed Bands," European Trans. Telecomm. and Related Technologies, submitted, 2007.
[9] Q. Zhao, L. Tong, A. Swami, and Y. Chen, "Decentralized Cognitive MAC for Opportunistic Spectrum Access in Ad Hoc Networks: A POMDP Framework," IEEE J. Selected Areas in Comm., vol. 25, no. 3, pp. 589-600, Apr. 2007.
[10] Q. Zhao and B. Krishnamachari, "Structure and Optimality of Myopic Sensing for Opportunistic Spectrum Access," Proc. IEEE Int'l Conf. Comm., pp. 6476-6481, June 2007.
[11] H. Jiang, L. Lai, R. Fan, and H.V. Poor, "Optimal Selection of Channel Sensing Order in Cognitive Radios," IEEE Trans. Wireless Comm., vol. 8, no. 1, pp. 297-307, Jan. 2009.
[12] R. Fan and H. Jiang, "Channel Sensing-Order Setting in Cognitive Radio Networks: A Two-User Case," IEEE Trans. Vehicular Technology, vol. 58, no. 9, pp. 4997-5008, Nov. 2009.
[13] T.L. Lai and H. Robbins, "Asymptotically Efficient Adaptive Allocation Rules," Advances in Applied Math., vol. 6, no. 1, pp. 4-22, 1985.
[14] P.R. Kumar, "A Survey of Some Results in Stochastic Adaptive Control," SIAM J. Control and Optimization, vol. 23, pp. 329-380, May 1985.
[15] P. Auer, N. Cesa-Bianchi, and P. Fischer, "Finite-Time Analysis of the Multiarmed Bandit Problem," Machine Learning, vol. 47, pp. 235-256, 2002.
[16] S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge Univ. Press, 2004.
[17] P. Whittle, "Restless Bandits: Activity Allocation in a Changing World," J. Applied Probability, vol. 25A, pp. 287-298, 1988.
[18] C.H. Papadimitriou and J.N. Tsitsiklis, "The Complexity of Optimal Queueing Network Control," Math. of Operations Research, vol. 24, no. 2, pp. 293-305, 1999.
[19] S.H.A. Ahmad, M. Liu, T. Javidi, Q. Zhao, and B. Krishnamachari, "Optimality of Myopic Sensing in Multichannel Opportunistic Access," IEEE Trans. Information Theory, vol. 55, pp. 4040-4050, Sept. 2009.
[20] L. Lai, H. Jiang, and H.V. Poor, "Medium Access in Cognitive Radio Networks: A Competitive Multi-Armed Bandit Framework," Proc. Asilomar Conf. Signals, Systems and Computers, Oct. 2008.
[21] H.V. Poor, An Introduction to Signal Detection and Estimation. Springer-Verlag, 1994.
[22] H. Kim and K.G. Shin, "Efficient Discovery of Spectrum Opportunities with MAC-Layer Sensing in Cognitive Radio Networks," IEEE Trans. Mobile Computing, vol. 7, no. 5, pp. 533-545, May 2008.
[23] V. Anantharam, P. Varaiya, and J. Walrand, "Asymptotically Efficient Allocation Rules for the Multiarmed Bandit Problem with Multiple Plays—Part I: I.I.D Rewards," IEEE Trans. Automatic Control, vol. 32, no. 1, pp. 968-976, Nov. 1987.
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool