Abstract
Wireless communication technologies such as Wi-Fi offer the use of multiple channels in different radio frequency ranges. Synchronously switching among channels supports the robustness of network operation and is also applied in cognitive radio networks to avoid conflicts with licensed users. In our previous work, we have devised quality metrics and algorithms for the derivation of communication schedules, i.e., finite sequences of channels actively used for message transfer. In this paper, we extend these results by constructing sensing schedules, i.e., finite sequences of channels passively used for channel quality measurement. Sensing schedules have the following properties. First, they are balanced in the sense that all available channels are sensed equally often. Second, they are conflict-minimal w.r.t. the current communication schedule regarding overlap of channels placed in the same position of both schedules. Third, under these constraints, they maximize overlap-fairness.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Engel, M., Gotzhein, R.: Dynamic computation and adjustment of channel hopping sequences for cognitive radio networks based on quality metrics. In: Proceedings of the 2018 International Conference on Embedded Wireless Systems and Networks, EWSN 2018, USA, pp. 79–89. Junction Publishing (2018)
Aragao, P., Engel, M., Gotzhein, R.: A three-dimensional stabilization protocol for time-slotted multi-hop cognitive radio networks with channel hopping. In: 32nd IEEE International Conference on Advanced Information Networking and Applications, AINA 2018, Krakow, Poland, 16-18 May 2018, pp. 32–39 (2018)
Jain, R., Chiu, D., Hawe, W.: A Quantitative Measure of Fairness and Discrimination for Resource Allocation in Shared Computer Systems. arXiv e-prints, page cs/9809099, September 1998
Mishra, A., Shrivastava, V., Banerjee, S., Arbaugh, W.: Partially overlapped channels not considered harmful, vol. 34, pp. 63–74, June 2006
Bonomo, F., Chudnovsky, M., Maceli, P., Schaudt, O., Stein, M., Zhong, M.: Three-coloring and list three-coloring of graphs without induced paths on seven vertices. Combinatorica 38(4), 779–801 (2018)
Galinier, P., Hamiez, J.P., Hao, J.K., Porumbel, D.: Recent advances in graph vertex coloring, pp. 505–528. Springer, Heidelberg (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Aragao, P., Gotzhein, R. (2020). Constructing Balanced, Conflict-Minimal, Overlap-Fair Channel Sensing Schedules. In: Barolli, L., Amato, F., Moscato, F., Enokido, T., Takizawa, M. (eds) Advanced Information Networking and Applications. AINA 2020. Advances in Intelligent Systems and Computing, vol 1151. Springer, Cham. https://doi.org/10.1007/978-3-030-44041-1_71
Download citation
DOI: https://doi.org/10.1007/978-3-030-44041-1_71
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-44040-4
Online ISBN: 978-3-030-44041-1
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)