Towards real-time dynamic spectrum auctions |
| |
| Affiliation: | 1. Department of Computer Science, University of California, Santa Barbara, CA 93106, United States;2. Amazon.com, seattle, WA 98106, United States;1. Key Lab of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China;2. Research Department of Hisilicon, Huawei Technologies Co., Ltd., Beijing 100095, China;1. CNRS, Gipsa-Lab, Univ. Grenoble Alpes, F-38000 Grenoble, France;2. CRAN, Université de Lorraine, CNRS, Boulevard des Aiguillettes, BP 239, 54506 Vandoeuvre Cedex, France;1. School of Computing and Electrical Engineering (SCEE), Indian Institute of Technology Mandi, H.P.-175001, India;2. Department of Electronics & Communications Engineering, Indraprastha Institute of Information Technology Delhi, New Delhi-110020, India |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
