Bibliographic Details
| Title: |
Towards real-time dynamic spectrum auctions |
| Authors: |
Gandhi, Sorabh1, Buragohain, Chiranjeeb1,2, Cao, Lili1, Zheng, Haitao1 htzheng@cs.ucsb.edu, Suri, Subhash1 |
| Source: |
Computer Networks. Mar2008, Vol. 52 Issue 4, p879-897. 19p. |
| Subjects: |
Algorithms, Spectrum allocation, Auctions, Telecommunication policy |
| Abstract: |
Abstract: In this paper, we propose a low-complexity auction framework to distribute spectrum in real-time among a large number of wireless users with dynamic traffic. Our design consists of a compact and highly expressive bidding format, two pricing models to control tradeoffs between revenue and fairness, and fast auction clearing algorithms to achieve conflict-free spectrum allocations that maximize auction revenue. We develop analytical bounds on algorithm performance and complexity to verify the efficiency of the proposed approach. We also use both simulated and real deployment traces to evaluate the auction framework. We conclude that pricing models and bidding behaviors have significant impact on auction outcomes and spectrum utilization. Any efficient spectrum auction system must consider demand and spectrum availability in local regions to maximize system-wide revenue and spectrum utilization. [Copyright &y& Elsevier] |
|
Copyright of Computer Networks is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
