Dynamic multilevel priority packet scheduling design for WSN

In wireless sensor network (WSN) we need to schedule different types of packets, Such as real time and non real time packets with some restrictions on resources. There are lots of existing packet scheduling mechanism of wireless sensor network uses first come first serve (FCFS), preemptive priority and non-preemptive priority scheduling algorithm. Our focus to improve delivery ratio, average packet delay and throughput. The algorithm which is not dynamic gives long end to end delay and high processing overhead transmission in wireless sensor network. These algorithms are not dynamic in nature so there scheduling policies are pre determine. To solve these problems, we propose a dynamic multilevel priority packet scheduling method. In this scheme each node has three types of priority queues, real time data packets are put into the higher priority queue and they can preempt packets present in supplementary queues. Non real time packets are put into to other queues which are based on threshold of their probable dispensation time. Lower level nodes have two queues for non real time and real time packets so from other nodes they do not gather data and reduce end to end delay transmission. The dynamic multi priority data packet scheduling method do better than conventional scheme in terms of throughput and end to end delay transmission. This paper present a fuzzy based algorithm to overcome all related problems which are explained earlier other advantage of using fuzzy logic is that it does not require complex mathematical calculations. The simulation of the proposed algorithm is performed using NS2 and the results shows that the proposed algorithm satisfactorily fulfill the system requirements.