On-line scheduling in the presence of overload
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On-line scheduling of jobs with fixed start and end times
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Dover: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
SIAM Journal on Computing
New algorithms for an ancient scheduling problem
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Multiprocessor scheduling with rejection
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A better algorithm for an ancient scheduling problem
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Truth revelation in approximately efficient combinatorial auctions
Proceedings of the 1st ACM conference on Electronic commerce
Scheduling Jobs that Arrive Over Time (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Preemptive Scheduling with Rejection
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Improved Bounds for the Online Scheduling Problem
SIAM Journal on Computing
Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Allocating dynamic time-spectrum blocks in cognitive radio networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
SIAM Journal on Computing
eBay in the Sky: strategy-proof wireless spectrum auctions
Proceedings of the 14th ACM international conference on Mobile computing and networking
Spectrum Bidding in Wireless Networks and Related
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
An online mechanism for ad slot reservations with cancellations
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Efficient and Strategyproof Spectrum Allocations in Multichannel Wireless Networks
IEEE Transactions on Computers
A 1.47-approximation algorithm for a preemptive single-machine scheduling problem
Operations Research Letters
On-line scheduling on a single machine: maximizing the number of early jobs
Operations Research Letters
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
| Hi-index | 0.00 |
In wireless networks, we need to allocate spectrum efficiently. One challenge is that the spectrum usage requests often come in an online fashion. The second challenge is that the secondary users in a cognitive radio network are often selfish and prefer to maximize their own benefits. In this paper, we address these two challenges by proposing TOFU, a semi-truthful online frequency allocation method for wireless networks when primary users can sublease the spectrums to secondary users. In our protocol, secondary users are required to submit the spectrum bid α time slots before its usage. Upon receiving an online spectrum request, our protocol will decide whether to grant its exclusive usage or not, within at least γ time slots of requests' arrival. We assume that existing spectrum usage can be preempted with some compensation. For various possible known information, we analytically prove that the competitive ratios of our methods are within small constant factors of the optimum online method. Furthermore, in our mechanisms, no selfish users will gain benefits by bidding lower than their willing payment. Our extensive simulation results show that they perform almost optimum: Our methods get a total profit that is more than 95% of the offline optimum when γ is about the duration of spectrum usage Δ.