SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks

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.

[1]  Leen Stougie,et al.  Multiprocessor scheduling with rejection , 1996, SODA '96.

[2]  Yunnan Wu,et al.  Allocating dynamic time-spectrum blocks in cognitive radio networks , 2007, MobiHoc '07.

[3]  Leen Stougie,et al.  Multiprocessing scheduling with rejection. Proceedings of the seventh annual ACM-SIAM symposium on discrete algorithms (SODA), January 28-30, Atlanta, Georgia, USA, 1996 , 1996 .

[4]  Jon Feldman,et al.  An online mechanism for ad slot reservations with cancellations , 2009, SODA.

[5]  Marek Chrobak,et al.  Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help , 2004, ICALP.

[6]  David R. Karger,et al.  A better algorithm for an ancient scheduling problem , 1994, SODA '94.

[7]  Ramaswamy Chandrasekaran,et al.  Improved Bounds for the Online Scheduling Problem , 2003, SIAM J. Comput..

[8]  Éva Tardos,et al.  Truthful mechanisms for one-parameter agents , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[9]  Sanjoy K. Baruah,et al.  On-line scheduling in the presence of overload , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[10]  Xia Zhou,et al.  TRUST: A General Framework for Truthful Double Spectrum Auctions , 2009, IEEE INFOCOM 2009.

[11]  Yoav Shoham,et al.  Truth revelation in approximately efficient combinatorial auctions , 2002, EC '99.

[12]  Niklaus Wirth,et al.  Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.

[13]  Éva Tardos,et al.  An approximate truthful mechanism for combinatorial auctions with single parameter agents , 2003, SODA '03.

[14]  Dennis Shasha,et al.  D^over: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems , 1995, SIAM J. Comput..

[15]  Shaojie Tang,et al.  Spectrum Bidding in Wireless Networks and Related , 2008, COCOON.

[16]  Rudolf Fleischer,et al.  On‐line scheduling revisited , 2000 .

[17]  Han Hoogeveen,et al.  Preemptive scheduling with rejection , 2000, Math. Program..

[18]  Cynthia A. Phillips,et al.  Scheduling Jobs that Arrive Over Time (Extended Abstract) , 1995, WADS.

[19]  J.A. Stine Spectrum management: the killer application of ad hoc and mesh networking , 2005, First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005..

[20]  Y. Shoham,et al.  Truth revelation in rapid, approximately efficient combinatorial auctions , 2001 .

[21]  Han Hoogeveen,et al.  On-line scheduling on a single machine: maximizing the number of early jobs , 2000, Oper. Res. Lett..

[22]  David P. Williamson,et al.  A 1.47-approximation algorithm for a preemptive single-machine scheduling problem , 2000, Oper. Res. Lett..

[23]  Mike S. Paterson Algorithms - ESA 2000 , 2003, Lecture Notes in Computer Science.

[24]  Xia Zhou,et al.  eBay in the Sky: strategy-proof wireless spectrum auctions , 2008, MobiCom '08.