Auction-based spectrum sharing

被引:441
作者
Huang, J
Berry, RA
Honig, ML
机构
[1] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
[2] Northwestern Univ, Dept Elect Engn & Comp Sci, Evanston, IL 60208 USA
关键词
CDMA; spectrum sharing; power control; game theory; auction;
D O I
10.1007/s11036-006-5192-y
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We study auction mechanisms for sharing spectrum among a group of users, subject to a constraint on the interference temperature at a measurement point. The users access the channel using spread spectrum signaling and so interfere with each other. Each user receives a utility that is a function of the received signal-to-interference plus noise ratio. We propose two auction mechanisms for allocating the received power. The first is an auction in which users are charged for received SINR, which, when combined with logarithmic utilities, leads to a weighted max-min fair SINR allocation. The second is an auction in which users are charged for power, which maximizes the total utility when the bandwidth is large enough and the receivers are co-located. Both auction mechanisms are shown to be socially optimal for a limiting "large system" with co-located receivers, where bandwidth, power and the number of users are increased in fixed proportion. We also formulate an iterative and distributed bid updating algorithm, and specify conditions under which this algorithm converges globally to the Nash equilibrium of the auction.
引用
收藏
页码:405 / 418
页数:14
相关论文
共 26 条
  • [21] SHROFF N, 2001, P IEEE INFOCOM
  • [22] Sunnevag K. J., 2001, AUCTION DESIGN ALLOC
  • [23] THE CHAIRMAN ASSIGNMENT PROBLEM
    TIJDEMAN, R
    [J]. DISCRETE MATHEMATICS, 1980, 32 (03) : 323 - 330
  • [24] Topkis DM, 2011, Supermodularity and complementarity
  • [25] Auctioning divisible goods
    Wang, JJD
    Zender, JF
    [J]. ECONOMIC THEORY, 2002, 19 (04) : 673 - 705
  • [26] Yang S., 2004, EFFICIENT MECH ALLOC