Online market driven spectrum scheduling and auction

Proceedings of the 2009 ACM Workshop on Cognitive Radio Networks, CoRoNet'09, Co-located with the Mobile Computing and Networking Conference, MobiCom'09

Volumn , Issue , 2009, Pages 49-54

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

^a HANGZHOU DIANZI UNIVERSITY   (China)

^b Illinois Institute of Technology   (United States)

Author keywords

Competitive ratio; Online scheduling; Penalty; Preemption; Spectrum; Wireless networks

Indexed keywords

COMPETITIVE RATIO; CONSTANT FACTORS; EFFICIENT SCHEDULING; EXTENSIVE SIMULATIONS; MARKET-DRIVEN APPROACHES; ONLINE MARKETS; ONLINE METHODS; ONLINE SCHEDULING; TIME DURATION; TIME INTERVAL;

COMPUTER SCIENCE; MOBILE COMPUTING; PROFITABILITY; RADIO; SCHEDULING ALGORITHMS; WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS NETWORKS;

EID: 70449641089     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1614235.1614247     Document Type: Conference Paper

References (18)

1. ALBERS, S. Better bounds for online scheduling. In STOC (1997), pp. 130-139.
2. BARTAL, Y., LEONARDI, S., MARCHETTI- SPACCAMELA, A., SGALL, J., AND STOUGIE, L. Multiprocessor scheduling with rejection. In SODA (1996), pp. 95-103.
3. BARUAH, S., KOREN, G., MISHRA, B., RAGHUNATHAN, A., ROSIER, L., AND SHASHA, D. On-line scheduling in the presence of overload. FOCS (1991), 100-110.
4. FLEISCHER, R., AND WAHL, M. On-line scheduling revisited. J. of Scheduling 3, 343-353 (2000).
5. GOEMANS, M. X. A supermodular relaxation for scheduling with release dates. In Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization (1996), Springer-Verlag, pp. 288-300.
6. GOEMANS, M. X., WEIN, J. M., AND WILLIAMSON, D. P. A 1.47-approximation algorithm for a preemptive single-machine scheduling problem. Operations Research Letters 26, 4 (2004), 149-154.
7. GRAHAM, R. Bounds for certain multiprocessing anomalies. Bell System Technical Journal 45, 1563-1581 (1966).
8. HOOGEVEEN, H., POTTS, C. N., AND WOEGINGER, G. J. On-line scheduling on a single machine: maximizing the number of early jobs. Operations Research Letters 27, 5 (2000), 193-197.
9. HOOGEVEEN, H., SKUTELLA, M., AND WOEGINGER, G. J. Preemptive scheduling with rejection. In Algorithms (2002), pp. 268-277.
10. JOHN F. RUDIN, I., AND CHANDRASEKARAN, R. Improved bounds for the online scheduling problem. SIAM J. Comput. 32, 3 (2003), 717-735.
11. KARGER, D. R., PHILLIPS, S. J., AND TORNG, E. A better algorithm for an ancient scheduling problem. In SODA (1994), pp. 132-140.
12. KOREN, G., AND SHASHA, D. Dover: An optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems. SIAM J. Comput. 24, 2 (1995), 318-339.
13. LI, X.-Y., XU, P., TANG, S., AND CHU, X. Spectrum bidding in wireless networks and related. In COCOON (2008), pp. 558-567.
14. PHILLIPS, C. A., STEIN, C., AND WEIN, J. Scheduling jobs that arrive over time. In WADS (1995), Springer-Verlag, pp. 86-97.
15. ZHENG, F., XU, Y., AND ZHANG, E. On-line production order scheduling with preemption penalties. Journal of Combinatorial Optimization 13 (2007), 189-204.
16. ZHOU, X., GANDHI, S., SURI, S., AND ZHENG, H. ebay in the sky: strategy-proof wireless spectrum auctions. In MobiCom (2008), ACM, pp. 2-13.
17. YUAN, Y., BAHL, P., CHANDRA, R., MOSCIBRODA, T., AND WU, Y. Allocating dynamic time-spectrum blocks in cognitive radio networks. In ACM Mobihoc 2007, pp. 130-139
18. ZHOU, X., AND ZHENG, H. Trust: A general framework for truthful double spectrum auctions. In INFOCOM2009, pp. 999-1007