Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/101671
Title: Auction-based resource allocation in cognitive radio systems
Authors: Hossain, Ekram
Zhang, Yang
Niyato, Dusit
Wang, Ping
Keywords: DRNTU::Engineering::Computer science and engineering
Issue Date: 2012
Source: Zhang, Y., Niyato, D., Wang, P., & Hossain, E. (2012). Auction-based resource allocation in cognitive radio systems. IEEE Communications Magazine, 50(11), 108-120.
Series/Report no.: IEEE Communications Magazine
Abstract: Auction theory, as a subfield of economics, provides useful tools to model, analyze, and optimize radio resource management in cognitive radio environments. By using an auction, radio resources such as subchannel, time slot, and transmit power can be allocated among licensed and unlicensed users in the system, following market laws. Due to the flexibility of mechanism design, there are various auction mechanisms that have been applied to cognitive radio systems with different characteristics. In this article, we first provide an overview of the basics of general auctions. Then the motivations and specific design issues in applying auctions to wireless network architectures and protocols are discussed. Then we review the state of the art in the use of auction theory and mechanism design in cognitive radio networks. This will enable the readers to have a general view of auction fundamentals, as well as the recent development and applications of auction theory in the emerging cognitive wireless networks.
URI: https://hdl.handle.net/10356/101671
http://hdl.handle.net/10220/16345
DOI: 10.1109/MCOM.2012.6353690
Schools: School of Computer Engineering 
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:SCSE Journal Articles

SCOPUSTM   
Citations 10

66
Updated on Mar 23, 2025

Web of ScienceTM
Citations 5

54
Updated on Oct 25, 2023

Page view(s) 10

865
Updated on Mar 23, 2025

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.