Packet Scheduling Algorithm Based on Priority Adjustment in Wireless Sensor Networks

Abstract

The quality of service in wireless sensor networks is significantly affected by delays. The existing dynamic multilevel priority (DMP) scheduling algorithm suffers from the problem of starvation where low-priority services cannot be fulfilled in time, leading to higher group delay in the case of sudden traffic flow. To address the limitations of the DMP algorithm, this paper proposes a priority dynamic adjustment packet scheduling (PAS) algorithm to effectively reduce the queuing delay of packets in a node, improve the starvation problem associated with low-priority services, and ensure the quality of different services. The algorithm optimizes the queuing method of different service types in the ready queue and is dynamically adjusted according to the service type and backlog of packets. Consequently, queuing delays of non-real-time service packets are reduced, thereby leading to a reduction in end-to-end delays. The simulation results show that, in a scenario with a high arrival rate of service flows, the PAS algorithm can reduce the end-to-end delays by 30% compared with the DMP scheduling algorithm.