Channel-aware distributed dynamic spectrum access via learning-based heterogeneous multi-channel auction

We consider the design of a distributed online learning and access mechanism for dynamic spectrum access, where channel availability statistics are unknown to each secondary user (SU). Unlike existing distributed access policies, we explore the instantaneous channel gain of SUs' channels for multi-user multi-channel diversity gain. We consider an auction-based approach. For the primary channels with heterogeneous statistics, we apply the unit demand auction [1] to determine each SU's selection of a primary channel based on its instantaneous rate over each channel. We further propose a learning based unit demand (LBUD) auction, where each SU only bids for the M-best channels estimated by itself through distributed learning. The new mechanism not only reduces communication overhead, but also improves the throughput performance when the primary channels have dissimilar availability statistics. In addition, we show that the LBUD auction preserves the strong property of unit demand auction, i.e. it is dominant strategy incentive compatible. To improve the convergence speed of the iterative procedure of channel allocation in the auction, we also propose an adaptive price increment algorithm. Simulations show the effectiveness of our proposed auction mechanism in throughput gain by exploring instantaneous channel fade.

[1]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[2]  Min Dong,et al.  Learning-stage based decentralized adaptive access policy for dynamic spectrum access , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[3]  Ananthram Swami,et al.  Distributed Algorithms for Learning and Cognitive Medium Access with Logarithmic Regret , 2010, IEEE Journal on Selected Areas in Communications.

[4]  Shie Mannor,et al.  A Robust Learning Approach to Repeated Auctions With Monitoring and Entry Fees , 2011, IEEE Transactions on Computational Intelligence and AI in Games.

[5]  T. L. Lai Andherbertrobbins Asymptotically Efficient Adaptive Allocation Rules , 1985 .

[6]  Min Dong,et al.  Decentralized spectrum learning and access adaptive to channel availability distribution in primary network , 2013, 2013 IEEE 14th Workshop on Signal Processing Advances in Wireless Communications (SPAWC).

[7]  Peter Auer,et al.  Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.

[8]  Gerard van der Laan,et al.  An Ascending Multi-Item Auction with Financially Constrained Bidders , 2008 .

[9]  Yi Gai,et al.  Decentralized Online Learning Algorithms for Opportunistic Spectrum Access , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[10]  Min Dong,et al.  Distributed opportunistic spectrum access with unknown population , 2012, 2012 1st IEEE International Conference on Communications in China (ICCC).

[11]  E. Maasland,et al.  Auction Theory , 2021, Springer Texts in Business and Economics.

[12]  Amir Leshem,et al.  Fully Distributed Optimal Channel Assignment for Open Spectrum Access , 2013, IEEE Transactions on Signal Processing.

[13]  George Iosifidis,et al.  Double auction mechanisms for resource allocation in autonomous networks , 2010, IEEE Journal on Selected Areas in Communications.

[14]  Rong Zheng,et al.  Repeated Auctions with Bayesian Nonparametric Learning for Spectrum Access in Cognitive Radio Networks , 2011, IEEE Transactions on Wireless Communications.

[15]  D. Gale,et al.  Multi-Item Auctions , 1986, Journal of Political Economy.

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