Skip to main content
Article
Mechanism Design for Base Station Association and Resource Allocation in Downlink OFDMA Network
IEEE Journal on Selected Areas in Communications (2012)
  • Mingyi Hong, University of Minnesota - Twin Cities
  • Alfredo Garcia, University of Minnesota - Twin Cities
Abstract
We consider a resource management problem in a multi-cell downlink OFDMA network whereby the goal is to find the optimal combination of (i) assignment of users to base stations and (ii) resource allocation strategies at each base station. Efficient resource management protocols must rely on users truthfully reporting privately held information such as downlink channel states. However, individual users can manipulate the resulting resource allocation (by misreporting their private information) if by doing so they can improve their payoff. Therefore, it is of interest to design efficient resource management protocols that are strategy-proof, i.e. it is in the users' best interests to truthfully report their private information. Unfortunately, we show that the implementation of any protocol that is efficient and strategy-proof is NP-hard. Thus, we propose a computationally tractable strategy-proof mechanism that is approximately efficient, i.e. the solution obtained yields at least 1/2 of the optimal throughput. Simulations are provided to illustrate the effectiveness of the proposed mechanism.
Keywords
  • approximation bounds,
  • base station association,
  • computational complexity,
  • heterogenous network,
  • mechanism design,
  • nash equilibrium,
  • price of anarchy,
  • resource allocation
Publication Date
December, 2012
Publisher Statement
This is a manuscript of an article from IEEE Journal on Selected Areas in Communications 30 (2012): 2238, doi: 10.1109/JSAC.2012.121216. Posted with permission.
Citation Information
Mingyi Hong and Alfredo Garcia. "Mechanism Design for Base Station Association and Resource Allocation in Downlink OFDMA Network" IEEE Journal on Selected Areas in Communications Vol. 30 Iss. 11 (2012)
Available at: http://works.bepress.com/mingyi_hong/12/