Dynamic Opportunistic Spectrum Access with Channel Bonding in Mesh Networks: A Game-Theoretic Approach
The opportunistic spectrum access with dynamic users and channel bonding technology in mesh networks is studied in this paper. Different from the traditional static and fixed transmitting model, nodes would change their states between active and silent, due to their traffic demand. Also, the channel bonding technology, which mitigates interference and improves throughput significantly, is employed in this paper. The interference mitigation problem with channel bonding is modeled as a distributed and non-cooperative game. We proved it to be an exact potential game. Based on the good property of the potential game, it guarantees the existence of at least one pure Nash equilibrium (NE). Due to the potential function is formulated as the aggregate interference of the network, the final optimal NE point also achieves the minimization of the system’s total interference. A multiple-agent learning algorithm is designed to approach the NE points. Compared with other algorithms, simulation results show that the modified algorithm achieves a lower interference performance, and the channel bonding contributes to the throughput performance.
KeywordsOpportunistic spectrum access Dynamic users Channel bonding Potential game
This work was supported in part by the Natural Science Foundation for Distinguished Young Scholars of Jiangsu Province under Grant BK20160034, in part by the National Science Foundation of China under Grant 61631020, Grant 61401508, and Grant 61671473, and in part by the Open Research Foundation of Science and Technology on Communication Networks Laboratory.
- 6.Zhang, Y., Xu, Y., Wu, Q.: Opportunistic spectrum access with dynamic users: directional graphical game and stochastic learning. KSII Trans. Internet Inf. Syst. 11(12–8), 5820–5824 (2017)Google Scholar
- 7.Zhang, Y., Zhao, Q.: Distributed opportunistic spectrum access with dynamic users: a game-theoretic learning approach. In: 2015 International Conference on Wireless Communications & Signal Processing (WCSP), Nanjing, pp. 1–5, October 2015Google Scholar
- 9.Zhu, X., Liu, X., Xu, Y., Zhang, Y., Ruan, L., Yang, Y.: Dynamic spectrum access for D2D networks: a hypergraph game approach. In: IEEE ICCT 2017, Chengdu, China (2017)Google Scholar
- 13.Zhang, Y., Xu, Y., Wu, Q., Yao, K., Anpalagan, A.: A game-theoretic approach for optimal distributed cooperative hybrid caching in D2D networks. IEEE Wirel. Commun. Lett. (2018, to appear)Google Scholar