2 research outputs found
Maximizing Social Welfare in Operator-based Cognitive Radio Networks under Spectrum Uncertainty and Sensing Inaccuracy
In Cognitive Radio Networks (CRNs), secondary users (SUs) are allowed to
opportunistically access the unused/under-utilized channels of primary users
(PUs). To utilize spectrum resources efficiently, an auction scheme is often
applied where an operator serves as an auctioneer and accepts spectrum requests
from SUs. Most existing works on spectrum auctions assume that the operator has
perfect knowledge of PU activities. In practice, however, it is more likely
that the operator only has statistical information of the PU traffic when it is
trading a spectrum hole, and it is acquiring more accurate information in real
time. In this paper, we distinguish PU channels that are under the control of
the operator, where accurate channel states are revealed in real-time, and
channels that the operator acquires from PUs out of its control, where a
sense-before-use paradigm has to be followed. Considering both spectrum
uncertainty and sensing inaccuracy, we study the social welfare maximization
problem for serving SUs with various levels of delay tolerance. We first model
the problem as a finite horizon Markov decision process when the operator knows
all spectrum requests in advance, and propose an optimal dynamic programming
based algorithm. We then investigate the case when spectrum requests are
submitted online, and propose a greedy algorithm that is 1/2-competitive for
homogeneous channels and is comparable to the offline algorithm for more
general settings. We further show that the online algorithm together with a
payment scheme achieves incentive compatibility for the SUs while guaranteeing
a non-negative revenue for the operator.Comment: submitted to Infocom 201
Optimal Spectrum Auction Design with Two-Dimensional Truthful Revelations under Uncertain Spectrum Availability
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. We present tight theoretical-bounds on instantaneous network
throughput and also show that our algorithm provides maximum throughput if the
CRs have i.i.d. valuations. 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.
Numerical examples are also presented to provide insights into the performance
of the proposed auction under different scenarios.Comment: 14 double-column pages, 7 figures, 2 tables, Under review in IEEE/ACM
Transactions in Networkin