Optimal Spectrum Auction Design with 2-D Truthful Revelations under Uncertain Spectrum Availability

V. Sriram Siddhardh Nadendla, Swastik K. Brahma, Pramod K. Varshney

Research output: Contribution to journalArticlepeer-review

17 Scopus citations


In this paper, we propose a novel sealed-bid auction framework to address the problem of dynamic spectrum allocation in cognitive radio (CR) networks. We design an optimal auction mechanism that maximizes the moderator's expected utility, when the spectrum is not available with certainty. We assume that the moderator employs collaborative spectrum sensing in order to make a reliable inference about spectrum availability. Due to the presence of a collision cost whenever the moderator makes an erroneous inference, and a sensing cost at each CR, we investigate feasibility conditions that guarantee a non-negative utility at the moderator. Since the moderator fuses CRs' sensing decisions to obtain a global inference regarding spectrum availability, we propose a novel strategy-proof fusion rule that encourages the CRs to simultaneously reveal truthful sensing decisions, along with truthful valuations to the moderator. We also present tight theoretical bounds on instantaneous network throughput achieved by our auction mechanism. Numerical examples are presented to provide insights into the performance of the proposed auction under different scenarios.

Original languageEnglish (US)
Article number7518673
Pages (from-to)420-433
Number of pages14
JournalIEEE/ACM Transactions on Networking
Issue number1
StatePublished - Feb 2017


  • Cognitive radio networks
  • auctions
  • spectrum allocation
  • spectrum availability uncertainty
  • spectrum sensing

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Optimal Spectrum Auction Design with 2-D Truthful Revelations under Uncertain Spectrum Availability'. Together they form a unique fingerprint.

Cite this