TOFU: Semi-truthful online frequency allocation mechanism for wireless networks

IEEE/ACM Transactions on Networking

Volumn 19, Issue 2, 2011, Pages 433-446

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

^a Illinois Institute of Technology   (United States)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

Competitive ratio; online allocation; penalty; preemption; spectrum; wireless networks

Indexed keywords

COMPETITIVE RATIO; ONLINE ALLOCATION; PENALTY; PREEMPTION; SPECTRUM;

DISTRIBUTED COMPUTER SYSTEMS; FREQUENCY ALLOCATION; PROFITABILITY;

WIRELESS NETWORKS;

EID: 79955484479     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2010.2067223     Document Type: Article

References (29)

1. 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.
2. Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, J. Sgall, and L. Stougie, "Multiprocessor scheduling with rejection," in Proc. ACM-SIAM SODA, 1996, pp. 95-103.
3. S. Baruah, G. Koren, B. Mishra, A. Raghunathan, L. Rosier, and D. Shasha, "On-line scheduling in the presence of overload," in Proc. IEEE FOCS, 1991, pp. 100-110.
4. M. Chrobak, W. Jawor, J. Sgall, and T. Tichy, "Online scheduling of equal-length jobs: Randomization and restarts help," SIAM J. Comput., vol. 36, no. 6, pp. 1709-1728, 2007.
5. F. Constantin, J. Feldman, S. Muthukrishnan, and M. Pal, "An online mechanism for ad slot reservations with cancellations," in Proc. ACMSIAM SODA, 2009, pp. 1265-1274.
6. R. Fleischer and M. Wahl, "On-line scheduling revisited," J. Sched., vol. 3, pp. 343-353, 2000.
7. M. X. Goemans, J. M. Wein, and D. P. Williamson, "A 1.47-approximation algorithm for a preemptive single-machine scheduling problem," Oper. Res. Lett., vol. 26, no. 4, pp. 149-154, 2004.
8. R. Graham, "Bounds for certain multiprocessing anomalies," Bell Syst. Tech. J., vol. 45, pp. 1563-1581, 1966.
9. H. Hoogeveen, C. N. Potts, and G. J. Woeginger, "On-line scheduling on a single machine: Maximizing the number of early jobs," Oper. Res. Lett., vol. 27, no. 5, pp. 193-197, 2000. (Pubitemid 32071038)
10. H. Hoogeveen, M. Skutella, and G. J. Woeginger, "Preemptive scheduling with rejection," in Proc. Algor.-ESA 2000, 2002, pp. 268-277.
11. I. J. F. Rudin and R. Chandrasekaran, "Improved bounds for the online scheduling problem," SIAM J. Comput., vol. 32, no. 3, pp. 717-735, 2003.
12. D. R. Karger, S. J. Phillips, and E. Torng, "A better algorithm for an ancient scheduling problem," in Proc. ACM-SIAM SODA, 1994, pp. 132-140.
13. G. Koren and D. Shasha, "Dover: An optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems," SIAM J. Comput., vol. 24, no. 2, pp. 318-339, 1995.
14. D. J. Lehmann, L. I. O'Callaghan, and Y. Shoham, "Truth revelation in approximately efficient combinatorial auctions," in Proc. ACMConf. Electron. Commerce, 1999, pp. 96-102.
15. X.-Y. Li and Y. Wang, "Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks," J. Parallel Distrib. Comput., pp. 515-530, 2006.
16. X.-Y. Li, P. Xu, S. Tang, and X. Chu, "Spectrum bidding in wireless networks and related," in Proc. COCOON, 2008, pp. 558-567.
17. R. Myerson, "Optimal auction design," Math. Oper. Res., vol. 6, no. 1, pp. 58-73, 1981.
18. C. A. Phillips, C. Stein, and J. Wein, "Scheduling jobs that arrive over time," in Proc. WADS, 1995, pp. 86-97.
19. J. A. Stine, "Spectrum management: The killer application of ad hoc and mesh networking," in Proc. IEEE DySPAN, 2005, pp. 184-193. (Pubitemid 44462520)
20. S. Wang, P. Xu, X.-H. Xu, S. Tang, X.-Y. Li, and X. Liu, "TODA: Truthful online double auction for spectrum allocation," in Proc. IEEE DySpan, 2010, pp. 1-10.
21. G. J. Woeginger, "On-line scheduling of jobs with fixed start and end times," Theor. Comput. Sci., vol. 130, no. 1, pp. 5-16, 1994.
22. P. Xu and X. Li, "SOFA: Strategy-proof online frequency allocation for multihop wireless networks," in Proc. ISAAC, 2009, p. 311.
23. P. Xu and X.-Y. Li, "OASIS: Online algorithm for spectrum allocation in multihop wireless networks," Algorithmica, 2010, to be published.
24. P. Xu, X.-Y. Li, S. Tang, and J. Zhao, "Efficient and strategyproof spectrum allocations in multi-channel wireless networks," IEEE Trans. Comput., 2010, accepted for publication.
25. Y. B. , A. F. , H. K. , and R. V. , "New algorithms for an ancient scheduling problem," J. Comput. Syst. Sci., vol. 51, pp. 359-366, 1995.
26. Y. Yuan, P. Bahl, R. Chandra, T. Moscibroda, and Y. Wu, "Allocating dynamic time-spectrum blocks in cognitive radio networks," in Proc. ACM MobiHoc, 2007, pp. 130-139.
27. F. Zheng, Y. Xu, and E. Zhang, "On-line production order scheduling with preemption penalties," J. Combin. Optimiz., vol. 13, pp. 189-204, 2007. (Pubitemid 46034293)
28. X. Zhou, S. Gandhi, S. Suri, and H. Zheng, "eBay in the Sky: Strategyproof wireless spectrum auctions," in Proc. ACM MobiCom, 2008, pp. 2-13.
29. X. Zhou and H. Zheng, "TRUST: A general framework for truthful double spectrum auctions," in Proc. IEEE INFOCOM, 2009, pp. 999-1007.