SALSA: Strategyproof Online spectrum admissions for wireless networks

IEEE Transactions on Computers

Volumn 59, Issue 12, 2010, Pages 1691-1702

  Xu, Ping ^a   Wang, Shiguang ^a   Li, Xiang Yang ^a,b  

^a Illinois Institute of Technology   (United States)

^b HANGZHOU DIANZI UNIVERSITY   (China)

Author keywords

competitive ratio; online allocation; revenue efficiency; social efficiency; spectrum; Wireless networks

Indexed keywords

COMPETITIVE RATIO; ONLINE ALLOCATION; REVENUE EFFICIENCY; SOCIAL EFFICIENCY; SPECTRUM;

POISSON DISTRIBUTION;

WIRELESS NETWORKS;

EID: 77953216881     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2010.87     Document Type: Article

References (40)

1. S. Albers, "Better Bounds for Online Scheduling", Proc. 29th Ann. ACM Symp. Theory of Computing (STOC'97), pp. 130-139, 1997.
2. A. Archer, C. Papadimitriou, K. Talwar, and E. Tardos, "An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents", Internet Math., vol. 1, no. 2, pp. 129-150, 2004.
3. Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, J. Sgall, and L. Stougie, "Multiprocessor Scheduling with Rejection", Proc. ACM Symp. Discrete Algorithms (SODA), pp. 95-103, 1996.
4. S. Baruah, G. Koren, B. Mishra, A. Raghunathan, L. Rosier, and D. Shasha, "Online Scheduling in the Presence of Overload", Proc. IEEE Ann. Symp. Foundations of Computer Science (FOCS), pp. 100-110, 1991.
5. U. Ben-Porat, A. Bremler-Barr, and H. Levy, "On the Exploitation of CDF Based Wireless Scheduling", Proc. IEEE INFOCOM, 2009.
6. F. T. Bruss, "A Unified Approach to a Class of Best Choice Problems with an Unknown Number of Options", Annals of Probability, vol. 12, no. 3, pp. 882-889, 1984.
7. M. Chrobak, W. Jawor, J. Sgall, and T. Tichy, "Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help", SIAM J. Computing, vol. 36, no. 6, pp. 1709-1728, 2007.
8. F. Constantin, J. Feldman, S. Muthukrishnan, and M. Pal, "An Online Mechanism for Ad Slot Reservations with Cancellations", Proc. ACM Symp. Discrete Algorithms (SODA), pp. 1265-1274, 2009.
9. R. Fleischer and M. Wahl, "Online Scheduling Revisited", J. Scheduling, vol. 3, pp. 343-353, 2000.
10. S. P. Y. Fung, F. Y. L. Chin, and C. K. Poon, "Laxity Helps in Broadcast Scheduling", Proc. Italian Conf. Theoretical Computer Science, pp. 251-264, 2005.
11. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., 1990.
12. M. X. Goemans, "A Supermodular Relaxation for Scheduling with Release Dates", Proc. Fifth Int'l IPCO Conf. Integer Programming and Combinatorial Optimization, pp. 288-300, 1996.
13. M. X. Goemans, J. M. Wein, and D. P. Williamson, "A 1.47-Approximation Algorithm for a Preemptive Single-Machine Scheduling Problem", Operations Research Letters, vol. 26, no. 4, pp. 149-154, 2004.
14. R. Graham, "Bounds for Certain Multiprocessing Anomalies", Bell System Technical J., vol. 45, pp. 1563-1581, 1966.
15. M. T. Hajiaghayi, R. Kleinberg, and D. C. Parkes, "Adaptive Limited-Supply Online Auctions", Proc. ACM Conf. Electronic Commerce (EC), pp. 71-80, 2004.
16. H. Hoogeveen, C. N. Potts, and G. J. Woeginger, "Online Scheduling on a Single Machine: Maximizing the Number of Early Jobs", Operations Research Letters, vol. 27, no. 5, pp. 193-197, 2000.
17. H. Hoogeveen, M. Skutella, and G. J. Woeginger, "Preemptive Scheduling with Rejection", Proc. Ann. European Symp. Algorithms (ESA'00), pp. 268-277, 2002.
18. F. John, I. Rudin, and R. Chandrasekaran, "Improved Bounds for the Online Scheduling Problem", SIAM J. Computing, vol. 32, no. 3, pp. 717-735, 2003.
19. D. R. Karger, S. J. Phillips, and E. Torng, "A Better Algorithm for an Ancient Scheduling Problem", Proc. ACM Symp. Discrete Algorithms (SODA), pp. 132-140, 1994.
20. S. Kern, S. D. Muller, N. Hansen, D. Buche, J. Ocenasek, and P. Koumoutsakos, "Learning Probability Distributions in Continuous Evolutionary Algorithms-A Comparative Review", Natural Computing, vol. 3, pp. 77-122, 2004.
21. G. Koren and D. Shasha, "Dover: An Optimal Online Scheduling Algorithm for Overloaded Uniprocessor Real-time Systems", SIAM J. Computing, vol. 24, no. 2, pp. 318-339, 1995.
22. D. J. Lehmann, L. I. O'Callaghan, and Y. Shoham, "Truth Revelation in Approximately Efficient Combinatorial Auctions", Proc. ACM Conf. Electronic Commerce, pp. 96-102, 1999.
23. X.-Y. Li and Y. Wang, "Simple Approximation Algorithms and PTASes for Various Problems in Wireless Ad Hoc Networks", J. Parallel and Distributed Computing, vol. 66, no. 4, pp. 515-530, 2006.
24. X.-Y. Li, P. Xu, S. Tang, and X. Chu, "Spectrum Bidding in Wireless Networks and Related", Proc. Ann. Int'l Conf. Computing and Combinatorics (COCOON), pp. 558-567, 2008.
25. C. A. Phillips, C. Stein, and J. Wein, "Scheduling Jobs That Arrive over Time (Extended Abstract)", Proc. Int'l Workshop Algorithms and Data Structures (WADS), pp. 86-97, 1995.
26. B. Ravindran, E. Jensen, and P. Li, "On Recent Advances in Time/Utility Function Real-Time Scheduling and Resource Management", Proc. IEEE Int'l Symposium Object-Oriented Real-Time Distributed Computing (ISORC), pp. 55-60, 2005.
27. J. A. Stine, "Spectrum Management: The Killer Application of Ad Hoc and Mesh Networking", Proc. IEEE Int'l Symp. New Frontiers in Dynamic Spectrum Access Networks (DySPAN), pp. 8-11, 2005.
28. L. Trevisan, "Non-Approximability Results for Optimization Problems on Bounded Degree Instances", Proc. ACM Symp. Theory of Computing (STOC), pp. 453-461, 2001.
29. V. Vapnik and A. Chervonenkis, "On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities", Theory of Probability and its Applications, vol. 16, pp. 264-280, 1971.
30. S. Wang, P. Xu, X. Xu, S. Tang, and X. Li, "TODA: Truthful Online Double Auction for Spectrum Allocation", Proc. Fourth IEEE Int'l Symp. New Frontiers in Dynamic Spectrum Access Networks (DySPAN), 2010.
31. G. J. Woeginger, "Online Scheduling of Jobs with Fixed Start and End Times", Theoretical Computer Science, vol. 130, no. 1, pp. 5-16, 1994.
32. Y. Wu and D. H. K. Tsang, "Distributed Multichannel Power Allocation Algorithm for Spectrum Sharing Cognitive Radio Networks", Proc. IEEE INFOCOM, 2009.
33. P. Xu and X. Li, "SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks", Proc. 20th Int'l Symp. Algorithms and Computation (ISAAC), pp. 311-320, 2009.
34. P. Xu and X.-Y. Li, "Online Market Driven Spectrum Scheduling and Auction", Proc. ACM MOBICOM-Workshop Cognitive Radio Networks (CoRoNet), pp. 49-54, 2009.
35. P. Xu, X.-Y. Li, S. Tang, and J. Zhao, "Efficient and Strategyproof Spectrum Allocations in Multi-Channel Wireless Networks", IEEE Trans. Computers, Nov. 2009.
36. Y. Bartal, A. Fiat, H. Karloff, and R. Vohra, "New Algorithms for an Ancient Scheduling Problem", J. Computer and System Sciences, vol. 51, pp. 359-366, 1995.
37. Y. Yuan, P. Bahl, R. Chandra, T. Moscibroda, and Y. Wu, "Allocating Dynamic Time-Spectrum Blocks in Cognitive Radio Networks", Proc. ACM MobiHoc, pp. 130-139, 2007.
38. F. Zheng, Y. Xu, and E. Zhang, "Online Production Order Scheduling with Preemption Penalties", J. Combinatorial Optimization, vol. 13, pp. 189-204, 2007.
39. X. Zhou, S. Gandhi, S. Suri, and H. Zheng, "eBay in the Sky: Strategy-Proof Wireless Spectrum Auctions", Proc. ACM MOBICOM, pp. 2-13, 2008.
40. X. Zhou and H. Zheng, "Trust: A General Framework for Truthful Double Spectrum Auctions", Proc. IEEE INFOCOM, 2009.