Game theory based spectrum dynamic management

被引:0
|
作者
Wu F. [1 ]
Zheng Z. [1 ]
机构
[1] School of Electronic, Information and Electrical Engineering, Shanghai Jiao Tong University, Shanghai
来源
| 2016年 / Science Press卷 / 53期
基金
中国国家自然科学基金;
关键词
Channel allocation; Combinatorial auction; Game theory; Resource management; Wireless network;
D O I
10.7544/issn1000-1239.2016.20150652
中图分类号
学科分类号
摘要
With the growing deployment of wireless communication technologies, radio spectrum is becoming a scarce resource. The current static spectrum management leads to low spectrum utilization in the spatial and temporal dimensions. Auction mechanism is believed to be an effective method among the most effective tools to solve or relieve the problem of radio spectrum shortage. However, designing a practical spectrum auction mechanism has to consider five major challenges: strategic behaviors of rational users, channel heterogeneity, channel spatial reusability, preference diversity and social welfare maximization. In this paper, we give a though literature survey about spectrum auction mechanism design, and point out the disadvantage of the existing works. We also present our recent work in heterogeneous spectrum management. We model the problem of heterogeneous spectrum allocation as a combinatorial auction. By jointly considering the five design challenges, we propose an efficient channel allocation mechanism and a price calculation scheme. We also prove that the proposed mechanism satisfies the strategy-proofness, and achieves approximately efficient social welfare. © 2016, Science Press. All right reserved.
引用
收藏
页码:38 / 52
页数:14
相关论文
共 68 条
  • [1] Wheeler T., Federal Communications Commission(FCC), (2000)
  • [2] Miao W., Radio Administration Bureau (RAB), (2002)
  • [3] Stanforth P., Spectrum Bridge, (2010)
  • [4] Klemperer P., How (not) to run auctions: The European 3G telecom auctions, European Economic Review, 46, 4, pp. 829-845, (2002)
  • [5] Taga K., LTE Spectrum and Network Strategies, (2010)
  • [6] Archer A., Kleinberg R., Truthful germs are contagious: A local to global characterization of truthfulness, Proc of the 9th ACM Conf on Electronic Commerce, pp. 340-366, (2008)
  • [7] Rochet J.C., A necessary and sufficient condition for rationalizability in a quasi-linear context, Journal of Mathematical Economics, 16, 2, pp. 191-200, (1987)
  • [8] Dobzinski S., An impossibility result for truthful combinatorial auctions with submodular valuations, Proc of the 43rd Annual ACM Symp on Theory of Computing, pp. 139-148, (2011)
  • [9] Lehmann D., O'Allaghan I.L., Shoham Y., Truth revelation in approximately efficient combinatorial auctions, Journal of the ACM, 49, 5, pp. 577-602, (2002)
  • [10] Adar E., Huberman A.B., Free riding on Gnutella, First Monday, 5, 10, (2000)