On-line scheduling in the presence of overload
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Dover: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
SIAM Journal on Computing
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
Truthful Mechanisms for One-Parameter Agents
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
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
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
TOFU: semi-truthful online frequency allocation mechanism for wireless network
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.02 |
A number of approaches, including cognitive radios, dynamic spectrum allocation, and spectrum auction, have been proposed and used to improve the spectrum usage. A natural characteristic of spectrum usage is that requests for spectrums often come in an online fashion. Thus, it is imperative to design efficient and effective online dynamic spectrum allocation methods. Another challenge is that the secondary users are often selfish and prefer to maximize their own benefits. In this paper, we address these two challenges by proposing SOFA, strategyproof online frequency allocation method. In our protocol, a frequency will be shared among a number of users, and 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, within 驴 time slots. Assume that existing spectrum usage can be preempted with some penalty. 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 its willing payment.