• S.Gurumoorthy
• T. Ganesh Kumar
• S. Dhanasekar

Wireless Sensor Networks (WSNs) comprise numerous tiny sensor nodes connected wirelessly. In WSNs, data packets are transmitted from a source node to a destination node through various intermediate nodes, which forward the packets to the next one-hop neighbor. These sensor networks transmit various types of data packets, notably real-time and non-real-time data packets. The real time data packets must be transmitted without any delay. Thus to minimize the delay in data packets, a customized priority scheduling scheme is proposed. By using this proposed algorithm, each incoming data packets are scheduled and prioritized, and a shortest path algorithm is used for the choosing a shortest path between source node and destination node and the shortest path reduces packet transmission delays. By minimizing the number of hops and distance travelled, data packets can reach their destination more quickly. This system aims to optimize the overall performance of the wireless sensor network by considering the end to end delay requirements of different types of data packets in a dynamic and adaptive manner. Ensuring high quality of service (QoS) in wireless sensor networks (WSNs) is crucial for reliable and efficient data transmission.

Wireless Sensor Networks, priority packet scheduling, delay.

"AN EFFICIENT PRIORITY PACKET SCHEDULING SCHEME TO IMPROVE THE QUALITY OF SERVICE IN WIRELESS SENSOR NETWORKS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.11, Issue 3, page no.g506-g509, March-2024, Available :http://www.jetir.org/papers/JETIR2403669.pdf

"AN EFFICIENT PRIORITY PACKET SCHEDULING SCHEME TO IMPROVE THE QUALITY OF SERVICE IN WIRELESS SENSOR NETWORKS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.11, Issue 3, page no. ppg506-g509, March-2024, Available at : http://www.jetir.org/papers/JETIR2403669.pdf