Utilizing priority-based packet scheduling based on preemptive priority scheduling in wireless sensor networks

Abstract

In this paper, each node has three levels of priority queues. Real-time packets are placed into the highest-priority queue and can preempt data packets in other queues. Non-real-time packets are placed into two other queues based on a certain threshold of their estimated processing time. Leaf nodes have two queues for real-time and non-real-time data packets since they do not receive data from other nodes and thus, reduce end-to-end delay. The priority packet scheduling scheme outperforms conventional schemes in terms of average data waiting time and end-to-end delay and also it reduces sensor energy consumption.