A scalable collusion-resistant multi-winner cognitive spectrum auction game

IEEE Transactions on Communications

Volumn 57, Issue 12, 2009, Pages 3805-3816

  Wu, Yongle ^a   Wang, Beibei ^a   Liu, K J Ray ^a   Clancy, T Charles ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b ARMED FORCES INSTITUTE OF PATHOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUCTION MECHANISMS; COGNITIVE RADIO TECHNOLOGIES; COMPLEXITY REDUCTION; DYNAMIC SPECTRUM ACCESS; EFFECTIVE MECHANISMS; MUTUAL INTERFERENCE; SEMI-DEFINITE PROGRAMMING; SIMULATION RESULT; SPECTRUM AUCTIONS; SPECTRUM UTILIZATION; WIRELESS COMMUNICATIONS;

ANALOG DIFFERENTIAL ANALYZERS; PROFITABILITY; RESOURCE VALUATION; SPECTROSCOPY; WIRELESS TELECOMMUNICATION SYSTEMS;

COMMERCE;

EID: 72949090674     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2009.12.080578     Document Type: Article

References (31)

1. Federal Communications Commission, "Spectrum policy task force report," FCC Document ET Docket No. 02-135, Nov. 2002.
2. Federal Communications Commission, "Facilitating opportunities for flexible, efficient and reliable spectrum use employing cognitive radio technologies: notice of proposed rule making and order," FCC Document ET Docket No. 03-108, Dec. 2003.
3. J. Mitola III, "Cognitive radio: an integrated agent architecture for software defined radio," Ph.D. thesis, KTH Royal Institute of Technology, Stockholm, Sweden, 2000.
4. H. Zheng and C. Peng, "Collaboration and fairness in opportunistic spectrum access," in Proc. IEEE International Conf. Commun. (ICC'05), pp. 3132-3136, Seoul, Korea, May 2005.
5. S. Keshavamurthy and K. Chandra, "Multiplexing analysis for spectrum sharing," in Proc. IEEE MILCOMM'06, pp. 1-7, Washington DC, Oct. 2006.
6. B. Wang, Z. Ji, K. J. R. Liu, and C. Clancy, "Primary-prioritized Markov approach for efficient and fair dynamic spectrum allocation," IEEE Trans. Wireless Commun., vol.8, no.4, pp. 1854-1865, Apr. 2009.
7. M. M. Halldorson, J. Y. Halpern, L. Li, and V. S Mirrokni, "On spectrum sharing games," in Proc. ACM Principles Distributed Computing, pp. 107-114, 2004.
8. O. Ileri, D. Samardzija, and N. B. Mandayam, "Demand responsive pricing and competitive spectrum allocation via a spectrum server," in Proc. IEEE Symposium New Frontiers Dynamic Spectrum Access Networks (DySPAN'05), pp. 194-202, Baltimore, MD, Nov. 2005.
9. J. Huang, R. Berry, and M. L. Honig, "Auction-based spectrum sharing," ACM/Springer Mobile Networks Apps., vol.11, no.3, pp. 405-418, June 2006.
10. C. Kloeck, H. Jaekel, and F. K. Jondral, "Dynamic and local combined pricing, allocation and billing system with coginitive radios," in Proc. IEEE Symposium New Frontiers Dynamic Spectrum Access Networks (DySPAN'05), pp. 73-81, Baltimore, MD, Nov. 2005.
11. S. Gandhi, C. Buragohain, L. Cao, H. Zheng, and S. Suri, "A general framework for wireless spectrum auctions," in Proc. IEEE Symposium New Frontiers Dynamic Spectrum Access Networks (DySPAN'07), pp. 22-33, Dublin, Apr. 2007.
12. Z. Ji and K. J. R. Liu, "Belief-assisted pricing for dynamic spectrum allocation in wireless networks with selfish users," in Proc. IEEE Int'l Conf. Sensor, Mesh, Ad Hoc Commun. Networks (SECON), pp. 119-127, Reston, VA, Sep. 2006.
13. Z. Ji and K. J. R. Liu, "Multi-stage pricing game for collusion-resistant dynamic spectrum allocation," IEEE J. Sel. Areas Commun., vol.26, no.1, pp. 182-191, Jan. 2008.
14. V. Krishna, Auction Theory. Academic Press, 2002.
15. P. Cramton, Y. Shoham, and R. Steinberg, Combinatorial Auctions. MIT Press, 2006.
16. L. M. Lawrence and P. R. Milgrom, "Ascending auctions with package bidding," Frontiers Theoretical Economics, vol.1, no.1, pp. 1-43, 2002.
17. R. Day and P. R. Milgrom, "Core-selecting package auctions," International J. Game Theory, vol.36, no.3, pp. 393-407, Mar. 2008.
18. Y. Wu, B. Wang, K. J. R. Liu, and T. C. Clancy, "A multi-winner cognitive spectrum auction framework with collusion-resistant mechanisms," in Proc. IEEE Symp. New Frontiers Dynamic Spectrum Access Networks (DySPAN'08), Chicago, Oct. 2008.
19. R. M. Karp, "Reducibility among combinatorial problems," Complexity of Computer Computations, R.E. Miller and J.W. Thatcher (eds.) Plenum Press, pp. 85-103, 1972.
20. M. Laurent and F. Rendl, Semidefinite Programming and Integer Programming. Centrum voor Wiskunde en Informatica, 2002.
21. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol.46, no.2, pp. 388-404, Mar. 2000.
22. G. Brar, D. M. Blough, and P. Santi, "Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks," in Proc. ACM International Conf. Mobile Computing Networking (Mobicom'06), pp. 2-13, Los Angeles, Sep. 2006.
23. L. Badia, E. Alessandro, L. Lenzini, and M. Zorzi, "A general interference-aware framework for joint routing and link scheduling in wireless mesh networks," IEEE Network, vol.22, no.1, pp. 32-38, Jan. 2008.
24. L. Yang, L. Cao, and H. Zheng, "Physical interference driven dynamic spectrum management," in Proc. IEEE Symposium New Frontiers Dynamic Spectrum Access Networks (DySPAN'08), Chicago, IL, Oct. 2008.
25. G. Owen, Game Theory, 3rd edition. Academic Press, 1995.
26. S. P. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, 2004.
27. C. Godsil and G. Royle, Algebraic Graph Theory. New York: Springer, 2004.
28. L. Lovász, "On the Shannon capacity of a graph," IEEE Trans. Inf. Theory, vol.25, no.1, pp. 1-7, Jan. 1979.
29. M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, 1993.
30. J. Brewer, "Kronecker products and matrix calculus in system theory," IEEE Trans. Circuits Systems, vol.25, no.9, pp. 772-781, Sep. 1978.
31. CVX software. [Online]. Available: http://www.stanford.edu/~boyd/cvx/