Packet Scheduling for minimizing delay in wireless sensor network

Scheduling different types of packets such as real-time and non-real time data packets in wireless links is necessary to reduce energy consumption of the wireless device. Most of the existing packet scheduling mechanism uses opportunistic transmission scheduling, in which communication is postponed upto an acceptable time deadline until the best expected channel conditions to transmit are found. This algorithm incurs a large processing overhead and more energy consumption. In this paper we propose a Packet Scheduling algorithm. In which, the ready queue is partitioned into three levels of priority queues. Real-time packets are placed into the highest priority queue and non-real time data packets are placed into two other queues. We evaluate the performance of the proposed Packet Scheduling scheme through simulations for real-time and non-real time data. Simulation results illustrate that the Dynamic Multilevel Priority packet scheduling scheme overcomes the conventional methods interms of average data waiting time and end-to-end delay, packet since they do not receive data from other nodes and thus reduces end to end delay. This scheme reduces the average waiting time and end-to-end delay of data packets.