User Preferences With Urgent-Time Intervals in a Wireless-Network


  • Hani Alquhayz Department of Computer Science and Information, College of Science at Zulfi, Majmaah University, Majmaah 11952



Data transmission, Wireless network, Packets, Heuristics, Scheduling into networks


This paper focuses on a scheduler component in a wireless network, with constraints based on user preferences. These constraints reflect the fact that users wish to privatize networks for fixed periods (intervals) in order to send urgent data. The user sets in advance certain data constraints and time periods. Each time period is presented as a frozen interval for the router and other users. Only the administrator can send data during these specifics periods and all others users will be frozen. During this interval, the intelligencer can send confidential and emergency data without any concurrency with other data through this interval, which is called an "emergency and secret interval”. Each time, a scheduling problem due to unavailable machines and jobs will be solved. This problem is NP-hard. In this research, we develop two algorithms for transmitting data from the sender to the receiver.


Download data is not yet available.


F. Angel-Bello, A. Alvarez, J. Pacheco and I. Martinez, A single machine scheduling problem with availability constraints and sequence-dependent setup costs, Applied Mathematical Modelling 35(4) (2011), 2041 – 2050, DOI: 10.1016/j.apm.2010.11.017.

W.W. Cui and Z.Q. Lu, Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates, Computers and Operations Research 80 (2017), 11 – 22, DOI: 10.1016/j.cor.2016.11.008.

M. Haouari, A. Gharbi and M. Jemmali, Tight bounds for the identical parallel machine scheduling problem, International Transactions in Operational Research 13(6) (2006), 529 – 548, DOI: 10.1111/j.1475-3995.2006.00562.x.

W. Hfaiedh, C. Sadfi, I. Kacem and A. Hadj-Alouane, A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization, Applied Mathematics and Computation 252 (2015), 496 – 502, DOI: 10.1016/j.amc.2014.11.103.

I. Kacem and H. Kellerer, Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints, Algorithmica 80 (12) (2018), 3825 – 3843 DOI: 10.1007/s00453-018-0417-6.

D. Ma and G. Tsudik, Security and privacy in emerging wireless networks, IEEE Wireless Communications 17(5) (2010), 12 – 21, DOI: 10.1109/MWC.2010.5601953.

A. Mahjoub, J. Kaabi and Y. Harrath, Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods, International Transactions in Operational Research (2018), 1 – 17, DOI: 10.1111/itor.12589.

H.K.D. Sarma and A. Kar, Security threats in wireless sensor networks, Carnahan Conferences Security Technology, Proceedings 2006 40th Annual IEEE International. IEEE, 2006, DOI: 10.1109/CCST.2006.313457.

S. Sharma, R. Mishra and K. Singh, A review on wireless network security, International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, Springer, Berlin, Heidelberg, 2013, DOI: 10.1007/978-3-642-37949-9_58.

M. Yazdani, S.M. Khalili, M. Babagolzadeh and F. Jolai, A single-machine scheduling problem with multiple unavailability constraints: A mathematical model and an enhanced variable neighborhood search approach, Journal of Computational Design and Engineering 4(1) (2017), 46 – 59, DOI: 10.1016/j.jcde.2016.08.001.




How to Cite

Alquhayz, H. (2019). User Preferences With Urgent-Time Intervals in a Wireless-Network. Communications in Mathematics and Applications, 10(1), 123–130.



Research Article