Performance analysis of queue based scheduling schemes in wireless sensor networks

Wireless sensor networks (WSN) consist of a huge number of low-power, short-lived and unreliable sensors. Sensor nodes are battery - powered devices, and have higher energy consumption and network life time for transmitting of data frequently. The aim of the paper is to increase the life time, reduce end to end delay and high reliability with maximum performance of WSN. Most of the existing scheduling schemes of WSN use First Come First Serve (FCFS), it schedules the data packets based on arrival time, in which real time (RT) data packets are having long delay due to the transmission of other non-real time (NRT) data packets. Moreover the algorithms are not dynamic to change the requirements of WSN applications since the scheduling procedures of these algorithms are predetermined. In this paper, we proposed a Dynamic Multilevel Priority (DMP) scheduling scheme in which each node having three levels of priority queues. Real time packets are assigned to high priority queue for emergency data´s and non real time packets are assigned to other two queues based on priority. Simulation results demonstrate that the DMP scheduling scheme performs better than conventional schemes in terms of average data waiting time, end to end delay, energy consumption and network lifetime.