Abstract
We consider the following fundamental problem of dynamic spectrum scheduling in cognitive radio networks. There are N secondary users, each of which gets access to a set of K channels through a collection of M base stations for data communications. Our aim is at addressing the so-called Joint Optimization of Base Station and Channel Allocation (JOBC) towards maximizing the total throughput of the users with the diverse uncertainties of the channels across different base stations and users. To serve this goal, we first investigate a simplified off-line version of the problem where we propose a greedy 1/M-approximation algorithm with the qualities of the channels assumed to be known. By taking the greedy off-line algorithm as a subroutine, we then propose an on-line learning-based algorithm by leveraging a combinatorial multi-armed bandit, which entails polynomial storage overhead and results in a regret (with respect to its off-line counterpart) logarithmic in time.
This work is partially supported by National Key R&D Program of China (Grant No. 2019YFB2102600), NSFC (Grant No. 61702304, 61971269, 61832012), Shandong Provincial Natural Science Foundation (Grant No. ZR2017QF005), Industrial Internet Innovation and Development Project in 2019 of China, the DFG Priority Programme Cyber-Physical Networking (SPP 1914), and German Research Foundation grant (NICCI).
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
Notes
- 1.
In this paper, let \([M]=\{1,2,\cdots ,M\}\) where M is a positive integer.
- 2.
For simplicity, we assume that \(\mu _v \ne \mu _{v'}\) for \(\forall v, v'\in \mathcal {V}\) such that \(\bar{\varDelta }_{min}\) (and thus \(\widetilde{\varDelta }_{min}\)) is non-zero without compromising the practical rationality of our later theoretical analysis.
References
Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2–3), 235–256 (2002). https://doi.org/10.1023/A:1013689704352
Avner, O., Mannor, S.: Multi-user lax communications: a multi-armed bandit approach. In: Proceedings of the 35th IEEE INFOCOM, pp. 1–9 (2016)
Avrachenkov, K., Cottatellucci, L., Maggi, L.: Dynamic rate allocation in Markovian quasi-static multiple access channels: a game theoretic approach. In: Proceedings of the 11th WiOpt, pp. 162–169 (2013)
Besson, L., Kaufmann, E., Moy, C.: Aggregation of multi-armed bandits learning algorithms for opportunistic spectrum access. In: Proceedings of IEEE WCNC, pp. 1–6 (2018)
Cai, K., Liu, X., Chen, Y., Lui, J.C.S.: An online learning approach to network application optimization with guarantee. In: Proceedings of IEEE INFOCOM, pp. 2006–2014 (2018)
Cai, Z., Duan, Y., Bourgeois, A.: Delay efficient opportunistic routing in asynchronous multi-channel cognitive radio networks. J. Comb. Optim. 29(4), 815–835 (2015)
Chen, Q., Cai, Z., Cheng, L., Gao, H.: Low-latency data aggregation scheduling for cognitive radio networks with non-predetermined structure. IEEE Trans. Mobile Comput. (2020). https://doi.org/10.1109/TMC.2020.2979710
Gai, Y., Krishnamachari, B.: Decentralized online learning algorithms for opportunistic spectrum access. In: Processing of IEEE GLOBECOM, pp. 1–6 (2011)
Kang, S., Joo, C.: Low-complexity learning for dynamic spectrum access in multi-user multi-channel networks. In: Proceedings of The 37th IEEE INFOCOM, pp. 1–9 (2018)
Li, F., Yu, D., Yang, H., Yu, J., Holger, K., Cheng, X.: Multi-armed-bandit-based spectrum scheduling algorithms in wireless networks: a survey. IEEE Wirel Commun. 27(1), 24–30 (2020)
Liu, J., Zhao, B., Xin, Q., Liu, H.: Dynamic channel allocation for satellite internet of things via deep reinforcement learning. In: Proceedings of ICOIN, pp. 465–470 (2020)
Maghsudi, S., Stanczak, S.: Joint channel selection and power control in infrastructureless wireless networks: a multiplayer multiarmed bandit framework. IEEE Trans. Veh. Technol. 64(10), 4565–4578 (2015)
Stahlbuhk, T., Shrader, B., Modiano, E.: Learning algorithms for scheduling in wireless networks with unknown channel statistics. Ad Hoc Netw. 85, 131–144 (2019)
Teotia, V., Dhurandher, S., Woungang, I., Obaidat, S.: Markovian model based channel allocation in cognitive radio networks. In: Proceedings of IEEE International Conference on Data Science and Data Intensive Systems, pp. 478–482 (2015)
Gai, Y., Krishnamachari, B., Jain, R.: Learning multiuser channel allocations in cognitive radio networks: a combinatorial multi-armed bandit formulation. In: Proceedings of IEEE DySPAN, pp. 1–9 (2010)
Zheng, W., Wu, G., Qie, W., Zhang, Y.: Deep reinforcement learning for joint channel selection and power allocation in cognitive internet of things. In: Milošević, D., Tang, Y., Zu, Q. (eds.) HCC 2019. LNCS, vol. 11956, pp. 683–692. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-37429-7_69
Zhou, Y., Li, X., Li, F., Liu, M., Li, Z., Yin, Z.: Almost optimal channel access in multi-hop networks with unknown channel variables. In: Proceedings of the 34th IEEE ICDCS, pp. 461–470 (2014)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Liu, Z., Li, F., Yu, D., Karl, H., Sheng, H. (2020). On-Line Learning-Based Allocationof Base Stations and Channels in Cognitive Radio Networks. In: Yu, D., Dressler, F., Yu, J. (eds) Wireless Algorithms, Systems, and Applications. WASA 2020. Lecture Notes in Computer Science(), vol 12384. Springer, Cham. https://doi.org/10.1007/978-3-030-59016-1_29
Download citation
DOI: https://doi.org/10.1007/978-3-030-59016-1_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-59015-4
Online ISBN: 978-3-030-59016-1
eBook Packages: Computer ScienceComputer Science (R0)