抽象的な

Priority based Packet Scheduling Approach for Wireless Sensor Networks

R.Karthikeyan, R.Nandha Kumar,M.Ramesh

A priority based packet scheduling scheme is proposed which aims at scheduling different types of data packets, such as real time and non-real-time data packets at sensor nodes with resource constraints in Wireless Sensor Networks. Most of the existing packet-scheduling mechanisms of Wireless Sensor Networks use First Come First Served (FCFS), non-preemptive priority and preemptive priority scheduling algorithms. These algorithms results in long end-to-end data transmission delay, high energy consumption, deprivation of high priority real-time data packets also it results in improper allocation of data packets to queues. Moreover, these algorithms are not dynamic to the changing requirements of Wireless Sensor Network applications since their scheduling policies are predetermined. 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. Index terms- Wireless sensor networks, FCFS, priority packet scheduling, pre-emptive, nonpreemptive, real-time packets, non real-time packets