Collusion-Resistant Multi-Winner Spectrum Auction for Cognitive Radio Networks

In order to fully utilize spectrum, auction-based dynamic spectrum allocation has become a promising approach which allows unlicensed wireless users to lease unused bands from spectrum license holders. Because spectrum resources are reusable by users far apart, in some scenarios, spectrum is more efficiently utilized by awarding one band to multiple secondary users simultaneously, which distinguishes it from traditional auctions where only one user can be the winner. However, the multi-winner auction is a new concept posing new challenges in the traditional auction mechanisms, because such mechanisms may yield low revenue and are not robust to some newly-emerging collusion. Therefore, in this paper, we propose an efficient mechanism for the multi-winner spectrum auction with collusion- resistant pricing strategies, in which the optimal spectrum allocation can be solved by binary linear programming and the pricing is formulated as a convex optimization problem. Furthermore, a greedy algorithm is proposed to reduce complexity for multi- band auctions. Simulation results are presented to evaluate our proposed auction mechanisms.