Hybrid Model for Packet Scheduling in Wireless Sensor Network

Abstract

The Wireless Sensor Network (WSN) is the wide area as compared to the others in networking domain. So when we deal with it, there are many things on which we have to concentrate. One of the most important among them is "Scheduling of the packets through the Network". It is having so much importance for the energy consumption and end to end data transmission delay. So the focused area should be the end to end data transmission delay. There are lot many Schemes used before like First Come First Serve also called as FCFS, Earliest Deadline First that is EDF and others to achieve the less end to end delay while sending the packet from one end to another. Some Schemes like Pre-emptive priority, Non Pre-emptive priority also used. But these Schemes are having certain disadvantages. These Scheduling algorithms incurred high processing overhead and it is not recommended. These Schemes also suffers from the large data transmission delay. In this paper, we are improving the Scheme that is used before named as "Dynamic Multilevel Priority Packet Scheduling Scheme". In the DMP scheme, except the nodes that are present at the last level of the hierarchy in the topology have the three levels of the priority queues. The three levels are priority one, priority two, and priority three. In this paper we are mostly focused on avoiding the drop of the packets. So we are avoiding this by using taking other queue for non real time packets so that they don't have to wait long time because of continuous arrival of real time packets. We are also reducing the hop count of the packet while sending to neighbour nodes. Keywords: Multi-hop, Hoping, Non-real time packets, Packet Scheduling, Real time packets, Wireless Sensor Network I. INTRODUCTIONThere are different big design issues in the wireless sensor network such as the data aggregation, routing protocols but among them the most important is Scheduling of the different types of packets through the network. Because of the delivery of the packet is notified through this. So here we are focusing on the packet scheduling with different schemes and priorities for different packets. So there are mainly two types of packets such as Real time packets and the non-real time packets. Real time packets are those which should be used as fast as they can and non-real time packets are those which are not that important as real time packets. These real time packets should have the highest priority. Most of the operating systems in the Wireless Sensor Networks uses First Come First Serve (FCFS) [1] scheme. This scheme processes the data packets as their arrival time. Means that whichever packet comes earlier that packet will process first. So here the drawback of the scheme is that the data packets which are at the back they will have higher processing overhead. Those packets will wait for longer time and it can be expire. So it requires more time to reach the destination. The packets should reach the destination in its given interval of time otherwise they will get expired. Other schemes whi...