Cognitive radio (CR) is applied to solve spectrum scarcity. Although the auction theory and learning algorithm have been discussed in previous works, their combination is not yet researched in the distributed CR networks, where secondary users (SUs) can occupy several channels simultaneously by assuming that one channel can be accessed by at most one SU. A parallel repeated auction scheme is proposed to solve resource allocation in multi-user multi-channel distributed spectrum-overlay CR networks. A novel bid scheme in the light of the first-price sealed auction is designed to balance the system utility and allocation fairness. The proposed auction scheme can be developed based on a learning algorithm and be applied to the scenarios where the cooperation among SUs is unavailable. Under the assumption of limited entry budget, SUs can directly decide whether or not to participate in spectrum auction by comparing the possible bid with access threshold which can be applied into situations that SUs have different transmit power. Theoretical analysis and simulation results show that, compared with original myopic scheme and original genie-aided scheme, the proposed auction scheme can obtain a considerable improvement in efficiency and fairness, especially with adequate available resources.
['Jian Chen', 'Ya-Mei Gao', 'Yonghong Kuo']
A Parallel Repeated Auction for Spectrum Allocation in Distributed Cognitive Radio Networks