Abstract
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.
The research of authors is partially supported by NSF CNS-0832120, National Natural Science Foundation of China under Grant No. 60828003, the Natural Science Foundation of Zhejiang Province under Grant No.Z1080979, National Basic Research Program of China (973 Program) under grant No. 2010CB328100.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Archer, A., Papadimitriou, C., Talwar, K., Tardos, E.: An approximate truthful mechanism for combinatorial auctions with single parameter agents. Internet Mathematics 1(2), 129–150 (2004)
Archer, A., Tardos, E.: Truthful mechanisms for one-parameter agents. In: IEEE FOCS, p. 482 (2001)
Bartal, Y., Leonardi, S., Marchetti-Spaccamela, A., Sgall, J., Stougie, L.: Multiprocessor scheduling with rejection. In: ACM SODA, pp. 95–103 (1996)
Baruah, S., Koren, G., Mishra, B., Raghunathan, A., Rosier, L., Shasha, D.: On-line scheduling in the presence of overload. In: IEEE FOCS, pp. 100–110 (1991)
Chrobak, M., Jawor, W., Sgall, J., Tichy´, T.: Online scheduling of equal-length jobs: Randomization and restarts help. SIAM J. Comput. 36(6), 1709–1728 (2007)
Constantin, F., Feldman, J., Muthukrishnan, S., Pal, M.: An online mechanism for ad slot reservations with cancellations. In: ACM SODA, pp. 1265–1274 (2009)
Fleischer, R., Wahl, M.: On-line scheduling revisited. J. of Scheduling 3, 343–353 (2000)
Goemans, M.X., Wein, J.M., Williamson, D.P.: A 1.47-approximation algorithm for a preemptive single-machine scheduling problem. Operations Research Letters 26(4), 149–154 (2004)
Hoogeveen, H., Potts, C.N., Woeginger, G.J.: On-line scheduling on a single machine: maximizing the number of early jobs. Operations Research Letters 27(5), 193–197 (2000)
Hoogeveen, H., Skutella, M., Woeginger, G.J.: Preemptive scheduling with rejection. In: Paterson, M. (ed.) ESA 2000. LNCS, vol. 1879, pp. 268–277. Springer, Heidelberg (2000)
John, F., Rudin, I., Chandrasekaran, R.: Improved bounds for the online scheduling problem. SIAM J. Comput. 32(3), 717–735 (2003)
Karger, D.R., Phillips, S.J., Torng, E.: A better algorithm for an ancient scheduling problem. In: ACM SODA, pp. 132–140 (1994)
Koren, G., Shasha, D.: Dover: An optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems. SIAM J. Comput. 24(2), 318–339 (1995)
Lehmann, D.J., O’Callaghan, L.I., Shoham, Y.: Truth revelation in approximately efficient combinatorial auctions. In: ACM Conf. on Electronic Commerce, pp. 96–102 (1999)
Li, X.-Y., Xu, P., Tang, S., Chu, X.: Spectrum bidding in wireless networks and related. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 558–567. Springer, Heidelberg (2008)
Phillips, C.A., Stein, C., Wein, J.: Scheduling jobs that arrive over time (extended abstract). In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol. 955, pp. 86–97. Springer, Heidelberg (1995)
Stine, J.A.: Spectrum management: The killer application of ad hoc and mesh networking. In: IEEE DySPAN (2005)
Yuan, Y., Bahl, P., Chandra, R., Moscibroda, T., Wu, Y.: Allocating dynamic time-spectrum blocks in cognitive radio networks. In: ACM MobiHoc, pp. 130–139 (2007)
Zhou, X., Gandhi, S., Suri, S., Zheng, H.: eBay in the Sky: strategy-proof wireless spectrum auctions. In: ACM MobiCom, pp. 2–13 (2008)
Zhou, X., Zheng, H.: Trust: A general framework for truthful double spectrum auctions. In: IEEE INFOCOM (2009)
Xu, P., Li, X.: SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks, http://www.cs.iit.edu/~xli/paper/spectrum-sofa.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, P., Li, XY. (2009). SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks. In: Dong, Y., Du, DZ., Ibarra, O. (eds) Algorithms and Computation. ISAAC 2009. Lecture Notes in Computer Science, vol 5878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10631-6_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-10631-6_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10630-9
Online ISBN: 978-3-642-10631-6
eBook Packages: Computer ScienceComputer Science (R0)