Abstract
Most of the existing packet scheduling mechanisms of the wireless sensor network use First Come First Served (FCFS) non pre emptive priority and pre emptive priority scheduling algorithms. The above algorithms have high processing overhead and also long end-to-end data transmission delay. In FCFS concept the data packet which is entering the node first will go out first from the node, and the packet which will enter last will leave at last. But in FCFS scheduling of real time data packets coming to the node have to wait for a long time period.In non pre emptive priority scheduling algorithm there is starvation of real time data packets because once the processor enters the running state, it will not allow remove until it is completed, so there is starvation of real time data packets. In pre emptive scheduling, starvation of non real time data packets, due to continuous arrival of real time data. Therefore the data packets are to be schedule in multilevel queue. But the multilevel queue scheduling scheme is not suitable for dynamic inputs, and hence the scheme is designed for dynamically change in the inputs. The Dynamic Multilevel Priority (DMP) packet scheduling is the scheme for dynamically changes in the inputs. In this scheme each node except the last level of the virtual hierarchy in the zone based topology of wireless sensor network has three levels of priority queues. Real time data packets are placed into highest priority queue and can preempt the data packets in the other queues. Non real time data packets are placed into other two queues based on threshold of their estimated processing time. The leaf node have two queues, one for real time data packet and another for non real time data 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.