An Enhanced Dynamic Multilevel Priority Packet Scheduling Scheme for Wireless Sensor Networks

Author(s):

Shakeel Ahmed , CVR College of Engineering, Hyderabad, India; Humaira Nishat, CVR College of Engineering, Hyderabad, India

Keywords:

Bandwidth, Delay, Overhead, Packet Schedule, Power Consumption

Abstract:

Among many network design issues, such as routing protocols and data aggregation, that reduce sensor energy consumption and data transmission delay, packet scheduling at sensor nodes is highly important since it ensures delivery of different types of data packets based on their priority and fairness with a minimum latency. According to priority of packet, node will route the packet to destination. Indeed, most existing Wireless Sensor Network (WSN) operating systems use First Come First Serve schedulers that process data packets in the order of their arrival time and, thus, require a lot of time to be delivered to a relevant base station. However, sensed data have to reach the Base Station (BS) with in a specific time period or before the expiration of a deadline. Additionally, real-time emergency data should be delivered to BS with the shortest possible end-to-end delay. In the existing scheme, node schedules only priority packet buffering. In this paper a new dynamic multilevel priority packet scheduling scheme is proposed. In the proposed work, node can check whether expire packets are buffered or not, if buffered then node deletes dead packets. Due to this operation buffering delay is reduced. Also, to reduce processing overhead and to save bandwidth, tasks with expired deadlines are removed from the medium thereby achieving a very high saving in energy.

Other Details:

Manuscript Id	:	IJSTEV1I11129
Published in	:	Volume : 1, Issue : 11
Publication Date	:	01/06/2015
Page(s)	:	469-477

Download Article