Truthful least-priced-path routing in opportunistic spectrum access networks

Authors:
Tao Shu;Marwan Krunz
Affiliations:
Department of Electrical and Computer Engineering, The University of Arizona;Department of Electrical and Computer Engineering, The University of Arizona
Venue:
INFOCOM'10 Proceedings of the 29th conference on Information communications
Year:
2010

Citing 15
Cited 1

Frugal path mechanisms

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Introduction to Algorithms

Introduction to Algorithms
Vickrey Prices and Shortest Paths: What is an Edge Worth?

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents

Proceedings of the 9th annual international conference on Mobile computing and networking
Frugality in path auctions

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Truthful multicast routing in selfish wireless networks

Proceedings of the 10th annual international conference on Mobile computing and networking
On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks: an integrated approach using game theoretical and cryptographic techniques

Proceedings of the 11th annual international conference on Mobile computing and networking
Low-Cost Routing in Selfish and Rational Wireless Ad Hoc Networks

IEEE Transactions on Mobile Computing
A BGP-based mechanism for lowest-cost routing

Distributed Computing - Special issue: PODC 02
OURS: optimal unicast routing systems in non-cooperative wireless networks

Proceedings of the 12th annual international conference on Mobile computing and networking
Hidden information and actions in multi-hop wireless ad hoc networks

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
eBay in the Sky: strategy-proof wireless spectrum auctions

Proceedings of the 14th ACM international conference on Mobile computing and networking
Incentive-compatible opportunistic routing for wireless networks

Proceedings of the 14th ACM international conference on Mobile computing and networking
Revenue generation for truthful spectrum auction in dynamic spectrum access

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Auction in multi-path multi-hop routing

IEEE Communications Letters

Practical unicast and convergecast scheduling schemes for cognitive radio networks

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of finding the least-priced path (LPP) between a source and a destination in opportunistic spectrum access (OSA) networks. This problem is motivated by economic considerations, whereby spectrum opportunities are sold/leased to secondary radios (SRs). This incurs a communication cost, e.g., for traffic relaying. As the beneficiary of these services, the end user must compensate the service-providing SRs for their spectrum cost. To give an incentive (i.e., profit) for SRs to report their true cost, typically the payment to a SR should be higher than the actual cost. However, from an end user's perspective, unnecessary overpayment should be avoided. So we are interested in the optimal route selection and payment determination mechanism that minimizes the price tag of the selected route and at the same time guarantees truthful cost reports from SRs. This setup is in contrast to the conventional truthful least-cost path (LCP) problem, where the interest is to find the minimum-cost route. The LPP problem is investigated with and without capacity constraints at individual SRs. For both cases, our algorithmic solutions can be executed in polynomial time. The effectiveness of our algorithms in terms of price saving is verified through extensive simulations.