Enforcing service availability in mobile ad-hoc WANs
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Vickrey Prices and Shortest Paths: What is an Edge Worth?
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Proceedings of the 9th annual international conference on Mobile computing and networking
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
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
IEEE Transactions on Wireless Communications
Optimal pricing in a free market wireless network
Wireless Networks
IEEE Transactions on Mobile Computing
Hi-index | 0.00 |
In this paper, we explore the economic aspects of routing/relaying in a profit-driven opportunistic spectrum access (OSA) network. In this network, primary users lease their licensed spectrum to secondary radio (SR) providers, who in turn provide opportunistic routing/relaying service to end-users if this service is profitable, i.e., if the payment offered by the end-user (a.k.a. the price) exceeds the SR's relaying spectrum cost. This cost is considered private information known only to SRs. Therefore, the end-user has to rely on costs reported by SRs to determine his routing and payment strategy. The challenge comes from the selfish nature of SRs; an SR may exaggerate his cost to achieve greater profit. To give incentive to an SR to report the true cost, the payment must typically be higher than the actual cost. However, from the end-user's perspective, "overpayment" should be avoided as much as possible. Therefore, we are interested in the "optimal" route selection and payment determination mechanism that minimizes the price of the selected route while simultaneously guaranteeing truthful cost reporting by SRs. We formulate this problem as finding the least-priced path (LPP), and we investigate it without and with link capacity constraints. In the former case, polynomial-time algorithm is developed to find LPP and calculate its truthful price. In the latter case, we show that calculating the truthful price of the LPP is in general computationally infeasible. Consequently, we consider a suboptimal but computationally feasible approximate solution, which we refer to as truthful low-priced path (LOPP) routing. A polynomial-time algorithm is proposed to find the LOPP and efficiently calculate its truthful price. A payment materialization algorithm is also developed to guarantee truthful capacity reporting by SRs. The effectiveness of our algorithms in terms of price saving is verified through extensive simulations.