BibTeX:

@article{IJIRSTV1I9021,
     title={A Novel and Efficient Packet Scheduling Scheme for Wireless Sensor Network},
     author={E.Indumathi , J.Antony Jeyanna and Dr.D.Shalini Punithavathani },
     journal={International Journal for Innovative Research in Science & Technology},
     volume={1},
     number={9},
     pages={126--132},
     year={},
     url={http://www.ijirst.org/articles/IJIRSTV1I9021.pdf},
     publisher={IJIRST (International Journal for Innovative Research in Science & Technology)},
}

Scheduling different types of packets, such as real time and non-real time data packet at sensor nodes with resource constraints in wireless sensor network, to reduce the sensor energy consumption and end- to-end data transmission delay. Most of the existing system based on the FCFS (First Come First Serve), non-preemptive priority and preemptive priority concepts. This algorithm incurs a large processing overhead and more energy consumption. It does not support dynamic packet scheduling scheme. In this paper, a Dynamic Multilevel Priority packet scheduling scheme proposed. In this scheme, it should maintain the virtual hierarchy the zone based topology of WSN, has three levels of priority queues. Real time packets are placed in to the highest priority queue. 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. According to the priority of packet node will route the packet to the destination. The result of this paper is reduce average data waiting time and end to end delay.

Wireless sensor networks, FCFS, priority packet scheduling, pre-emptive, non-preemptive, real-time packets, non-real-time packets, Dynamic Multilevel priority (DMP)