Abstract
In this paper, we apply the combinatorial auction scheme to solve the spectrum allocation problem under heterogeneous supply and demand in cognitive radio networks. The heterogeneity of spectrum is embodied via exploiting multiple attributes, based on which a valuation function is devised to evaluate the preference of an SU over a spectrum band. We first propose an auction scheme consisting of a greedy-like winner determination algorithm and a critical value based discriminatory pricing policy. We then extend the proposed auction scheme to a more challenging scenario by considering spectrum sharing among SUs. Theoretical analysis demonstrates that our auction schemes achieve individual rational, budget balance, value-truthfulness of SUs, and weak value-truthfulness of PUs. Our simulation results verify the advantage of combinatorial auction, the functionality of spectrum sharing and the economic robustness of our auction schemes.
Original language | English |
---|---|
Pages (from-to) | 109-118 |
Number of pages | 10 |
Journal | Computer Communications |
Volume | 60 |
DOIs | |
Publication status | Published - 1 Apr 2015 |
MoE publication type | A1 Journal article-refereed |
Funding
The authors would like to thank the support from the National Natural Science Foundation of China (Grant Nos. 61172074 , 61272505 , and 61371069 ) and the Specialized Research Fund for the Doctoral Program of Higher Education (Grant No. 20130009110015 ).
Keywords
- Cognitive radio networks
- Combinatorial auction
- Spectrum allocation
- Spectrum sharing