Pricing-Based Decentralized Spectrum Access Control in Cognitive Radio Networks

被引:53
作者
Yang, Lei [1 ]
Kim, Hongseok [2 ]
Zhang, Junshan [1 ]
Chiang, Mung [3 ]
Tan, Chee Wei [4 ]
机构
[1] Arizona State Univ, Sch Elect Comp & Energy Engn, Tempe, AZ 85287 USA
[2] Sogang Univ, Dept Elect Engn, Seoul 121742, South Korea
[3] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
[4] City Univ Hong Kong, Kowloon, Hong Kong, Peoples R China
基金
美国国家科学基金会;
关键词
Cognitive radio; nonconvex optimization; Pareto optimality; pricing; random access; spectrum access control;
D O I
10.1109/TNET.2012.2203827
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper investigates pricing-based spectrum access control in cognitive radio networks, where primary users (PUs) sell the temporarily unused spectrum and secondary users (SUs) compete via random access for such spectrum opportunities. Compared to existing market-based approaches with centralized scheduling, pricing-based spectrum management with random access provides a platform for SUs contending for spectrum access and is amenable to decentralized implementation due to its low complexity. We focus on two market models, one with a monopoly PU market and the other with a multiple-PU market. For the monopoly PU market model, we devise decentralized pricing-based spectrum access mechanisms that enable SUs to contend for channel usage. Specifically, we first consider SUs contending via slotted Aloha. Since the revenue maximization problem therein is nonconvex, we characterize the corresponding Pareto-optimal region and obtain a Pareto-optimal solution that maximizes the SUs' throughput subject to their budget constraints. To mitigate the spectrum underutilization due to the "price of contention," we revisit the problem where SUs contend via CSMA, which results in more efficient spectrum utilization and higher revenue. We then study the tradeoff between the PU's utility and its revenue when the PU's salable spectrum is controllable. Next, for the multiple-PU market model, we cast the competition among PUs as a three-stage Stackelberg game, where each SU selects a PU's channel to maximize its throughput. We explore the existence and the uniqueness of Nash equilibrium, in terms of access prices and the spectrum offered to SUs, and develop an iterative algorithm for strategy adaptation to achieve the Nash equilibrium. Our findings reveal that there exists a unique Nash equilibrium when the number of PUs is less than a threshold determined by the budgets and elasticity of SUs.
引用
收藏
页码:522 / 535
页数:14
相关论文
共 27 条
[1]  
Bertsekas D. P., 1990, DATE NETWORKS
[2]   CR-CSMA: A Random Access MAC Protocol for Cognitive Radio Networks [J].
Chen, Qian ;
Liang, Ying-Chang ;
Motani, Mehul ;
Wong, Wai-Choong .
2009 IEEE 20TH INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS, 2009, :486-490
[3]   Investment and Pricing with Spectrum Uncertainty: A Cognitive Operator's Perspective [J].
Duan, Lingjie ;
Huang, Jianwei ;
Shou, Biying .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2011, 10 (11) :1590-1604
[4]   Towards real-time dynamic spectrum auctions [J].
Gandhi, Sorabh ;
Buragohain, Chiranjeeb ;
Cao, Lili ;
Zheng, Haitao ;
Suri, Subhash .
COMPUTER NETWORKS, 2008, 52 (04) :879-897
[5]  
Hande P., 2010, Proceedings of the 29th Conference on Computer Communications (INFOCOM), P1
[6]   Auction-based spectrum sharing [J].
Huang, J ;
Berry, RA ;
Honig, ML .
MOBILE NETWORKS & APPLICATIONS, 2006, 11 (03) :405-418
[7]   Optimal Transmission Strategies for Dynamic Spectrum Access in Cognitive Radio Networks [J].
Huang, Senhua ;
Liu, Xin ;
Ding, Zhi .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2009, 8 (12) :1636-1648
[8]  
Ileri O, 2005, 2005 1ST IEEE INTERNATIONAL SYMPOSIUM ON NEW FRONTIERS IN DYNAMIC SPECTRUM ACCESS NETWORKS, CONFERENCE RECORD, P194
[9]  
Jia JC, 2009, MOBIHOC'09 PROCEEDINGS OF THE TENTH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, P3
[10]   SEQUENTIAL MINIMAX SEARCH FOR A MAXIMUM [J].
KIEFER, J .
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1953, 4 (03) :502-506