Abstract
This research considers the router allocation problem in situations with sensitive, highest-priority, and severe demand constraints. Examples include bespoke communication, masquerade communication, war, disasters, and various crises (political, social, etc.). Specifically, by introducing a network component called the scheduler. The scheduler is established to provide the intelligencers the highest priority to forwarding their packets based on their preferences at any time. Intelligencers define their preferences to control the data release time, due time, and static window transmission time-slot. Each window represents a reserved time-slot for the intelligencer. A window is an interval when the intelligencer can send data without any contention and can block any other user trying to gain access to the router during this interval. The reserved interval is called a “static urgent window pass”. For each block of the received data, the scheduler solves a scheduling problem with the windows reserved for the router based on the given constraints, which is an NP-hard problem. This work proposes eight heuristics based on dispatching with constraints, iterative randomization method, and subset-sum method to solve the studied problem. These heuristics are utilized by the two proposed algorithms to forward data from the sender to the receiver based on the specified constraints. The first algorithm prioritizes the set of packets to be sent and is called the “priority packet-based algorithm”. The second algorithm is called the “cumulative packet-based algorithm” and is based on the non-priority set of the remaining packets. At any time other than the specified window, the scheduler rearranges and reschedules all the remaining (non-scheduled) packets. Experimental results showed the performance of the proposed heuristics in terms of gap and time. In the performed experiments, the scheduler was capable to pass the router role and gain the control to send the required data based on the specified constraints.
Similar content being viewed by others
References
Ahmed, Z., Hamma, S., & Nasir, Z. (2019). An optimal bandwidth allocation algorithm for improving qos in wimax. Multimedia Tools and Applications pp. 1–40.
Alquhayz, H. (2019). User preferences with urgent-time intervals in a wireless-network. Communications in Mathematics and Applications, 10(1), 123–130.
Anajemba, J.H., Yue, T., Iwendi, C., Chatterjee, P., Ngabo, D., & Alnumay, W.S. (2021). A secure multi-user privacy technique for wireless iot networks using stochastic privacy optimization. IEEE Internet of Things Journal
Bhatt, S., & Ragiri, P. R., et al. (2021). Security trends in internet of things: a survey. SN Applied Sciences, 3(1), 1–14.
Dabhade, V.D., & Alvi, A. (2021). Review of wireless sensor network security schemes. In: Intelligent Computing and Networking, pp. 41–51. Springer
Dardari, D., & Massari, D. (2021). Using metaprisms for performance improvement in wireless communications. IEEE Transactions on Wireless Communications.
Dziubinski, K., & Bandai, M. (2021). Bandwidth efficient iot traffic shaping technique for protecting smart home privacy from data breaches in wireless lan. IEICE Transactions on Communications p. 2020EBP3182
Elhoseny, M., Farouk, A., Zhou, N., Wang, M. M., Abdalla, S., & Batle, J. (2017). Dynamic multi-hop clustering in a wireless sensor network: performance improvement. Wireless Personal Communications, 95(4), 3733–3753.
Hajar, M.S., Al-Kadri, M.O., & Kalutarage, H.K. (2021). A survey on wireless body area networks: Architecture, security challenges and research opportunities. Computers & Security p. 102211
Haoxiang, W., & Smys, S. (2020). Soft computing strategies for optimized route selection in wireless sensor network. Journal of Soft Computing Paradigm (JSCP), 2(01), 1–12.
Jemmali, M., & Alquhayz, H. (2020). Time-slots transmission data algorithms into network. In: 2020 International Conference on Computing and Information Technology (ICCIT-1441), pp. 1–4. IEEE
Kulin, M., Kazaz, T., De Poorter, E., & Moerman, I. (2021). A survey on machine learning-based performance improvement of wireless networks: Phy, mac and network layer. Electronics, 10(3), 318.
Naik, D., Dora, S., & De, T., et al. (2019). Normalized uplink bandwidth scheduling algorithm for wimax networks. In: Advances in Computer, Communication and Control, pp. 311–325. Springer
Sreenivasulu, U., Naganjaneyulu, P., & Giriprasad, M. (2018). Downlink scheduling algorithm for wimax protocol to improve qos. Arabian Journal for Science and Engineering, 43(8), 4105–4114.
Yadav, A., Vyavahare, P., & Bansod, P. (2015). Review of wimax scheduling algorithms and their classification. Journal of The Institution of Engineers (India): Series B, 96(2), 197–208.
Acknowledgements
The authors would like to thank the Deanship of Scientific Research at Majmaah University for supporting this work under Project Number No. 38/90.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Alquhayz, H., Jemmali, M. Fixed Urgent Window Pass for a Wireless Network with User Preferences. Wireless Pers Commun 120, 1565–1591 (2021). https://doi.org/10.1007/s11277-021-08524-x
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-021-08524-x