Spectrum auction framework for access allocation in cognitive radio networks

IEEE/ACM Transactions on Networking

Volumn 18, Issue 6, 2010, Pages 1841-1854

  Kasbekar, Gaurav S ^a   Sarkar, Saswati ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Algorithms; cognitive radio networks; spectrum auctions

Indexed keywords

ALLOCATION PROBLEMS; COGNITIVE RADIO NETWORK; INCENTIVE COMPATIBILITY; MAXIMUM MATCHINGS; POLYNOMIAL-TIME ALGORITHMS; POLYNOMIAL-TIME DYNAMIC PROGRAMMING; SECONDARY NETWORKS; SPECTRUM AUCTIONS;

COGNITIVE RADIO; DESIGN; OPTIMIZATION; POLYNOMIALS; RADIO SYSTEMS;

ALGORITHMS;

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

References (22)

1. Q. Zhao and B. Sadler, "A survey of dynamic spectrum access, " IEEE Signal Process. Mag., vol. 24, no. 3, pp. 79-89, May 2007.
2. "Report of the Spectrum Efficiency Working Group, " FCC Spectrum Policy Task Force, Nov. 2002 [Online]. Available: http://www.fcc.gov/ sptf/reports.html
3. "FCC auctions" [Online]. Available: http://wireless.fcc.gov/ auctions/
4. I. Akyildiz, W.-Y. Lee, M. Vuran, and S. Mohanty, "NeXt generation/dynamic spectrum access/cognitive radio wireless networks:Asurvey, " Comput. Netw., vol. 50, no. 13, pp. 2127-2159, 2006.
5. D. Bertsekas and R. Gallager, Data Networks, second ed. Englewood Cliffs, NJ: Prentice-Hall, 1992.
6. S. Gandhi, C. Buragohain, L. Cao, H. Zheng, and S. Suri, "Towards real-time dynamic spectrum auctions, " Comput. Netw., vol. 52, no. 4, pp. 879-897, Mar. 2008.
7. S. Sengupta and M. Chatterjee, "Sequential and concurrent auction mechanisms for dynamic spectrum access, " in Proc. CROWNCOM, 2007, pp. 448-455.
8. J. Huang, R. Berry, and M. Honig, "Auction mechanisms for distributed spectrum sharing, " in Proc. 42nd Allerton Conf., 2004.
9. Z. Ji and K. J. Ray Liu, "Belief-assisted pricing for dynamic spectrum allocation in wireless networks with selfish users, " in Proc. IEEE SECON, 2006, pp. 119-127.
10. J. Peha, "Emerging technology and spectrum policy reform, " in Proc. ITU Workshop Market Mech. Spectrum Manage., Jan. 2007.
11. M. Tennenholtz, "Some tractable combinatorial auctions, " in Proc. AAAI, 2000, pp. 98-103.
12. P. Cramton, Y. Shoham, and R. Steinberg, Combinatorial Auctions. Cambridge, MA: MIT Press, 2006.
13. T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. Cambridge, MA: MIT Press, 2001.
14. J. Edmonds, "Maximum matching and a polyhedron with 0, 1-vertices, " J. Res. Nat. Bur. Stand., vol. 69B, pp. 125-130, 1965.
15. L. White, "A parametric study of matchings and coverings in weighted graphs, " Ph.D. dissertation, University of Michigan, Ann Arbor, 1967.
16. L. White, "An efficient algorithm for maximum matching in weighted graphs, " in Proc. 12th Allerton Conf. Circuits Syst. Theory, 1974.
17. D. Bertsimas and J. Tsitsiklis, Introduction to Linear Optimization. Belmont, MA: Athena-Scientific, 1997.
18. A. Mas-Colell, M. Whinston, and J. Green, Microeconomic Theory. London, U.K.: Oxford Univ. Press, 1995.
19. J. Kleinberg and E. Tardos, Algorithm Design. Reading, MA: Addison-Wesley, 2005.
20. N. Nisan and A. Ronen, "Computationally feasible VCG mechanisms, " in Proc. ACM Conf. Electron. Commerce, 2000, pp. 242-252.
21. A. Ronen, "Mechanism design with incomplete languages, " in Proc. ACM Conf. Electron. Commerce, 2001, pp. 105-114.
22. S. Sengupta and M. Chatterjee, "An economic framework for dynamic spectrum access and service pricing, " IEEE/ACMTrans. Netw., vol. 17, no. 4, pp. 1200-1213, Aug. 2009.