Weitere Artikel dieser Ausgabe durch Wischen aufrufen
Cognitive radio (CR) is applied to solve spectrum scarcity. Although the auction theory and learning algorithm have been discussed in previous works, their combination is not yet researched in the distributed CR networks, where secondary users (SUs) can occupy several channels simultaneously by assuming that one channel can be accessed by at most one SU. A parallel repeated auction scheme is proposed to solve resource allocation in multi-user multi-channel distributed spectrum-overlay CR networks. A novel bid scheme in the light of the first-price sealed auction is designed to balance the system utility and allocation fairness. The proposed auction scheme can be developed based on a learning algorithm and be applied to the scenarios where the cooperation among SUs is unavailable. Under the assumption of limited entry budget, SUs can directly decide whether or not to participate in spectrum auction by comparing the possible bid with access threshold which can be applied into situations that SUs have different transmit power. Theoretical analysis and simulation results show that, compared with original myopic scheme and original genie-aided scheme, the proposed auction scheme can obtain a considerable improvement in efficiency and fairness, especially with adequate available resources.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten
Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:
Wang, B. B., & Liu, K. J. R. (2011). Advances in cognitive radio networks: A survey. IEEE Journal of Selected Topics in Signal Processing, 5(1), 5–23. CrossRef
Dong, M., Sun, G. F., Wang, X. B., & Zhang, Q. (2012). Combinatorial auction with time-frequency flexibility in cognitive radio networks. In IEEE INFOCOM (pp. 2282–2290), Orlando, FL.
Zhang, Y., Niyato, D., Wang, P., & Ekram, H. (2012). Auction-based resource allocation in cognitive radio systems. IEEE Communication Magazine, 50(11), 108–120. CrossRef
Danak, A., & Mannor, S. (2009). Bidding efficiently in repeated auctions with entry and observation costs. In International conference on game theory for networks (pp. 299–307). Istanbul.
Zhou, X., & Zheng, H. (2009). TRUST: A general framework for truthful double spectrum auctions. In IEEE INFOCOM (pp. 999–1007), Rio de Janeiro.
Chen, Y., Wu, Y. L., Wang, B. B., & Liu, K. J. R. (2010). Spectrum auction games for multimedia streaming over cognitive radio networks. IEEE Transactions on Communications, 58(8), 2381–2390. CrossRef
Wang, X. B., Li, Z., Xu, P. C., Gao, X. B., & Chen, H. H. (2010). Spectrum sharing in cognitive radio networks-an auction-based approach. IEEE Transactions on Systems, Man and Cybernetics-Part B: Cybernetics, 40(3), 587–596. CrossRef
Zaclanos, M. M., Spesicesev, L., & Pappas, G. J. (2008). A distributed auction algorithm for the assignment problem. In 47th IEEE conference on decision and control (pp. 1212–1217), Cancun.
Eraslan, B., Gozupek, D., & Alagoz, F. (2011). An auction theory based algorithm for throughput maximizing scheduling in centralized cognitive radio networks. IEEE Communications Letters, 15(7), 734–736. CrossRef
Naparstek, O., & Leshem, A. (2011). Fully distributed auction algorithm for spectrum sharing in unlicensed bands. In 2011 4th IEEE international workshop on computational advances in multi-sensor adaptive processing (CAMSAP) (pp. 233–236), San Juan.
Leshem, A., Zehavi, E., & Yaffe, Y. (2012). Multichannel opportunistic carrier sensing for stable channel access control in cognitive radio systems. IEEE Journal on Selected Areas Communications, 30(1), 82–95. CrossRef
Peng, C. Y., Zheng, H. T., & Zhao, B. Y. (2006). Utilization and fairness in spectrum assignment for opportunistic spectrum access. Mobile Networks and Applications (SCI), 11(4), 555–576. CrossRef
Ganesan, G., & Li, Y. (2007). Cooperative spectrum sensing in cognitive radio, part I: Two user networks. IEEE Transactions on Wireless Communications, 6(6), 2204–2213. CrossRef
Han, Z., Zheng, R., & Poor, H. V. (2011). Repeated auctions with Bayesian nonparametric learning for spectrum access in cognitive radio networks. IEEE Transactions on Wireless Communications, 10(3), 890–900.
Tehrani, M. N., & Uysal, M. (2013). Auction based spectrum trading for cognitive radio networks. IEEE Communications letters, 17(6), 1168–1171. CrossRef
Eraslan, B., Gozupek, D., & Alagoz, F. (2011). An auction theory based algorithm for throughput maximizing scheduling in centralized cognitive radio networks. IEEE Communications letters, 15(7), 734–736.
Akkarajitsakul, K., Hossain, E. E., & Niyato, D. (2011). Distributed resource allocation in wireless networks under uncertainty and application of Bayesian game. IEEE Communications Magazine, 49(8), 120–127. CrossRef
Brahma, S., & Chatterjee, M. (2012). A Bayesian based incetive-compatible routing mechanism for dynamic spectrum access networks. In IEEE INFOCOM (pp. 2781–2785), Orlando, FL.
Jiang, L. B., & Walrand, J. (2011). Approaching throughput-optimality in distributed CSMA scheduling algorithms with collision. IEEE/ACM Transactions on Networking, 19(3), 816–829. CrossRef
Jain, R., Chiu, D., & Haws, W. (1984). A quantitative measure of fairness and discrimination for resource allocation in shared computer system. Resource document, Technical report. http://www1.cse.wustl.edu/jain/papers/ftp/fairness.pdf. Accessed 26 Sept 1984.
- A Parallel Repeated Auction for Spectrum Allocation in Distributed Cognitive Radio Networks
- Springer US