अमूर्त

An Efficient Packet Scheduling Scheme in Wireless Sensor Networks to Prevent the Deadlock

J.Nivetha, A.Deepa

Scheduling different types of packet in wireless sensor network is highly important since it ensures delivery of different types of data packets based on their priority and fairness with a minimum latency. In the existing Dynamic Multilevel Priority (DMP) packet scheduling scheme the sensor nodes are virtually organized into a hierarchical structure. Each node maintains three levels of priority queues. We classify as (i) real-time (priority 1), (ii) non-real-time remote data packet that are received from lower level nodes (priority2), and (iii) non-real-time local data packets that are sensed at the node itself (priority 3). If a real-time task holds the resources for a longer period of time, other tasks need to wait for an undefined period time, causing the occurrence of a deadlock. This deadlock situation degrades the performance of task scheduling schemes in terms of end-to-end delay. In the proposed scheme is to provide an improvement over other deadlock prevention algorithms. A process request resources; and if the resources are not available at that time, it enters a wait state and may never execute. This paper aims to present a resource allocation algorithm that ensures that the requested resources are made available to the processes while incurring lower overhead for deciding about the resource allocation.