Multi-Winner Heterogeneous Spectrum Auction Mechanism for Channel Allocation in Cognitive Radio Networks

6Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Fair allocation of unused licensed spectrum among preferable secondary users (SUs) is an important feature to be supported by Cognitive Radio (CR) for its successful deployment. This paper proposes an auction theoretic model for spectrum allocation by incorporating different constraints of a CR network and intents to achieve an effective utilization of the radio spectrum. We consider heterogeneous channel condition which allows SUs to express their preference of channels in terms of bid values. A sealed-bid concurrent bidding policy is implemented which collects bids from SUs while dealing with variation in availability time of the auctioned channels. The proposed model develops a truthful winner determination algorithm which exploits spectrum reusability as well as restraints to dynamics in spectrum opportunities amongst SUs. Allowing multiple non-interfering SUs to utilize a common channel significantly helps to achieve an improved spectrum utility. However, every SU acquires at most one channel. The proposed model also develops a pricing algorithm which helps the auctioneer to earn a revenue from every wining bidder. Simulation based results demonstrate the effectiveness in performance of the proposed model in terms of spectrum utilization compared to the general concurrent auction model.

Cite

CITATION STYLE

APA

Devi, M., Sarma, N., & Deka, S. K. (2020). Multi-Winner Heterogeneous Spectrum Auction Mechanism for Channel Allocation in Cognitive Radio Networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11969 LNCS, pp. 251–265). Springer. https://doi.org/10.1007/978-3-030-36987-3_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free