Scheduling Algorithm in Infrastructure Less Network for PQ

S. Priyadharsini; K. Thamizhmaran

doi:10.48001/jofsn.2023.114-6

Authors

S. Priyadharsini Department of Electronics and Communication Engineering, Government College of Engineering, Theni, Tamil Nadu, India
K. Thamizhmaran Assistant Professor & NSS Programme Officer & Deputy Warden, Department of Electronics and Communication Engineering, Government College of Engineering, Theni, Tamil Nadu, India. E-mail: tamil10_happy@rediffmail.com

DOI:

https://doi.org/10.48001/jofsn.2023.114-6

Keywords:

Black holes, NS2, Priority queuing, Quality of Service (QoS), Wireless sensor network

Abstract

Due to its inherent resource limitations, wireless based dipole networks are increasingly being used in security-critical applications. As a result, they are more vulnerable to different security assaults, including the Grey-hole attack, which has a significant impact on data collecting. For WSNs, the Active Trust security and trust routing technique is suggested as a means of overcoming that difficulty. By using the NS2 Simulator to define the path for security in the priority queuing in scheduling algorithm, hostile nodes are reduced, speed is further improved, and at the same time, excellent security is created with minimal routing overhead. In order to fulfil security targets for the following metrics packet delivery ratio, routing overhead, and throughput, we are implementing a secure dynamic on-demand routing protocol. The performance of the priority queuing algorithm is assessed in this proposed scheduling task in order to achieve Quality of Service (QoS). The HHLS-MARS4 method improves the effectiveness of the network topology, allowing the proposed protocol to provide secure transmission while also reducing routing overhead, delay, and packet loss.

Downloads

Download data is not yet available.

References

Ba, W., & Zhang, D. (2006, June). Analysis of the Delays of Switched Industrial Ethernet Based on Priority Queue Model. In 2006 6th World Congress on Intelligent Control and Automation (Vol. 1, pp. 4626-4629). IEEE. https://doi.org/10.1109/WCICA.2006.1713258.

Cheng, J., Yang, S. H., Wang, C. Y., Tang, H. H., & Tang, B. (2021). On efficient constructions of optical priority queues. IEEE Transactions on Communications, 70(3), 1861-1874.

https://doi.org/10.1109/TCOMM.2021.3132911.

Jagerman, D. L., Balcıoglu, B., Altiok, T., & Melamed, B. (2004). Mean waiting time approximations in the G/G/1 queue. Queueing Systems, 46, 481-506. https://link.springer.com/article/10.1023/B:QUES.0000027996.28824.89.

Jin, X., & Min, G. (2009). Modelling and analysis of priority queueing systems with multi-class self-similar network traffic: A novel and efficient queue-decomposition approach. IEEE Transactions on Communications, 57(5), 1444-1452. https://doi.org/10.1109/TCOMM.2009.05.070376.

Mirtchev, S. T. (2019, May). Study of preemptive priority single-server queue with peaked arrival flow. In 2019 X National Conference with International Participation (ELECTRONICA) (pp. 1-4). IEEE. https://doi.org/10.1109/ELECTRONICA.2019.8825636.

Thamizhmaran, K. (2018). Evaluation of traditional SPAs with AODV routing protocol for MANETs. Networking and Communication Engineering, 10(3). http://www.ciitresearch.org/dl/index.php/nce/article/view/NCE032018003.

Thamizhmaran, K., Anitha, M., & Nachiappan, A. (2018). Reduced end-to-end delay for manets using SHSP-EA3ACK algorithm. i-Manager's Journal on Communication Engineering and Systems, 7(3), 9. https://www.proquest.com/openview/f6a696a6c4e653cca65c299940b5614d/1?pq-origsite=gscholar&cbl=2030626.

Xin, J., Zhu, Q., Liang, G., & Zhang, T. (2019). Performance analysis of D2D underlying cellular networks based on dynamic priority queuing model. IEEE Access, 7, 27479-27489.

https://doi.org/10.1109/ACCESS.2019.2894678.