SALSA: Strategyproof Online Spectrum Admissions for Wireless Networks

It is imperative to design efficient and effective online spectrum allocation methods since requests for spectrums often come in an online fashion. In this paper, we propose SALSA, strategyproof online spectrum admission for wireless networks. We assume that the requests arrival follows the Poisson distribution. Upon receiving an online spectrum request, our protocol will decide immediately whether to grant its exclusive usage or not, and how much the request should pay. Preempting existing spectrum usage is not allowed. We proposed two protocols that have guaranteed performances for two different scenarios: 1) random-arrival case: the bid values and requested time durations follow some distributions that can be learned, or 2) semi-arbitrary-arrival case: the bid values could be arbitrary, but the request arrival sequence is random. We analytically prove that our protocols are strategyproof, and are both approximately social efficient and revenue efficient. Our extensive simulation results show that they perform almost optimum. Our method for semi-arbitrary-arrival model achieves social efficiency and revenue efficiency almost 20-30 percent of the optimum, while it has been proven that no mechanism can achieve social efficiency ratio better than 1/e \simeq 37 \rm percent. Our protocol for the random-arrival case even achieves social efficiency and revenue efficiency two-six times the expected performances by the celebrated VCG mechanism.

[1]  Yuan Wu,et al.  Distributed Multichannel Power Allocation Algorithm for Spectrum Sharing Cognitive Radio Networks , 2008, 2008 IEEE Wireless Communications and Networking Conference.

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

[3]  Francis Y. L. Chin,et al.  Laxity Helps in Broadcast Scheduling , 2005, ICTCS.

[4]  Petros Koumoutsakos,et al.  Learning Probability Distributions in Continuous Evolutionary Algorithms - a Comparative Review , 2004, Nat. Comput..

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

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

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

[8]  Susanne Albers,et al.  Better bounds for online scheduling , 1997, STOC '97.

[9]  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..

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

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

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

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

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

[15]  Xiang-Yang Li,et al.  SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks , 2009, ISAAC.

[16]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[17]  Luca Trevisan,et al.  Non-approximability results for optimization problems on bounded degree instances , 2001, STOC '01.

[18]  Shaojie Tang,et al.  Efficient and Strategyproof Spectrum Allocations in Multichannel Wireless Networks , 2011, IEEE Transactions on Computers.

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

[20]  Yin-Feng Xu,et al.  On-line production order scheduling with preemption penalties , 2007, J. Comb. Optim..

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

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

[23]  Mohammad Taghi Hajiaghayi,et al.  Adaptive limited-supply online auctions , 2004, EC '04.

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

[25]  F Thomas Bruss A Unified Approach to a Class of Best Choice Problems with an Unknown Number of Options , 1984 .

[26]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[27]  XiaoHua Xu,et al.  TODA: Truthful Online Double Auction for Spectrum Allocation in Wireless Networks , 2010, 2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN).

[28]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

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

[30]  Michel X. Goemans,et al.  A Supermodular Relaxation for Scheduling with Release Dates , 1996, IPCO.

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

[32]  Amos Fiat,et al.  New algorithms for an ancient scheduling problem , 1992, STOC '92.

[33]  Yu Wang,et al.  Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks , 2006, J. Parallel Distributed Comput..

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

[35]  Binoy Ravindran,et al.  On recent advances in time/utility function real-time scheduling and resource management , 2005, Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05).

[36]  Gerhard J. Woeginger,et al.  On-Line Scheduling of Jobs with Fixed Start and End Times , 1994, Theor. Comput. Sci..

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

[38]  Rudolf Fleischer,et al.  Online Scheduling Revisited , 2000, ESA.

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

[40]  Xiang-Yang Li,et al.  Online market driven spectrum scheduling and auction , 2009, CoRoNet '09.

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

[42]  Anat Bremler-Barr,et al.  On the Exploitation of CDF Based Wireless Scheduling , 2009, IEEE INFOCOM 2009.