Wireless networks generally contain a large number of sensors, which are arbitrarily and densely located. These networks find use in various applications such as process management, health care monitoring, traffic analysis, and industrial process monitoring. Scheduling is commonly a technique which is used for controlling the process order of a Computer CPU. In wireless sensor networks for reducing the sensor’s energy consumption and terminal delays, scheduling plays an important role for a choice of data packets like real-time data packets and non-real time data packets. Scheduling algorithms for instance First Come First Serve, preemptive and non-preemptive priority algorithms puts large processing overhead and long terminal delays in data transmission. The development of packet scheduling algorithms can efficiently improve the delivery of packets between various wireless links in wireless networks. With the use of algorithms like packet scheduling, quality of service can be assured and transmission rate can be improved for wireless sensor networks. This paper fundamentally focuses on the wireless sensor network nodes as for each node the process execution requires the minimum reach to target. In this work the First Come First Serve Algorithm and Priority Scheduling algorithm has been applied for calculating the end-to-end delay. It can further be used for combining the coverage area for next processes. Shortest Job First (SJF) scheduling algorithm is then applied for finding the execution time on the basis of priority time reduction. Finally, a contrast of end-to-end delay with process execution time is done.

Wireless sensor networks consist of hundreds or thousands of applications such as environmental monitoring, traffic analysis, tactical systems and industrial process monitoring. Most of the packet-scheduling mechanisms of WSN use First Come First Served (FCFS), non-preemptive priority and preemptive priority scheduling algorithms. These algorithms incur a high processing overhead and long end-to-end data transmission delay due to the FCFS concept .These algorithms are not dynamic to the changing requirements of WSN applications since their scheduling policies are predetermined. Developing packet scheduling algorithms in wireless sensor networks can efficiently enhance delivery of packets through wireless links. Packet scheduling can guarantee quality of service and improve transmission rate in wireless sensor networks. Considering this combination we are basically focusing on the nodes of wireless sensor network as the process required shortest coverage area to reach. We apply FCFS algorithm & priority algorithm for calculating delay. We can use it for mixing with coverage area for further process. After priority on the basis of time reduction we have to apply SJF (shortest job first) execution time finding. Finally, we have to compare on the basis of delay and execution time. Improve the performance of task scheduling schemes in terms of end to end delay and deadlock prevention.