JETIREXPLORE- Search Thousands of research papers



Published in:

Volume 2 Issue 4
April-2015
eISSN: 2349-5162

Unique Identifier

JETIR1504070

Page Number

1220-1225

Share This Article


Title

Advanced Dynamic Multilevel Priority Packet Scheduling

ISSN

2349-5162

Cite This Article

"Advanced Dynamic Multilevel Priority Packet Scheduling", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.2, Issue 4, page no.1220-1225, April-2015, Available :http://www.jetir.org/papers/JETIR1504070.pdf

Abstract

Scheduling different types of packets, such as real-time and non-real-time data packets, at sensor nodes with resource constraints in Wireless Sensor Networks (WSN) is of vital importance to reduce sensors’ energy consumptions and end-to-end data transmission delays. Most of the existing 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 delays. Moreover, these algorithms are not dynamic to the changing requirements of WSN applications since their scheduling policies are predetermined. Then there comes a method for scheduling packets dynamically for wireless sensor network. In this approach the packet is scheduled by prioritization. Initially packet has to classify according to packet type (i.e. real time and non-real time packets).The data packets that are received by a node from the lower level nodes are given higher priority than the data packets sensed at the node itself. Dynamic Multilevel Priority packet scheduling scheme that ensures a tradeoff between priority and reliability. In the Advanced Multilevel Priority packet scheduling scheme, each node except those at the last level has three levels of priority queues. According to the priority of the packet and availability of the queue, node will schedule the packet for transmission. Due to separated queue availability, packet transmission delay is reduced. Due to reduction in packet transmission delay, node can goes into sleep mode as soon as possible. And Expired packets are deleted at the particular node at itself before reaching the base station, so that processing burden on the node is reduced. Thus, energy of the node is saved. We evaluate the performance of the proposed Advanced Dynamic Multilevel Queue scheduling scheme through simulations for real-time and non-real time data. Simulation results illustrate that the Multilevel Priority packet scheduling scheme overcomes the conventional methods in terms of average data waiting time and end-to-end delay.

Key Words

Wireless sensor network, packet scheduling, preemptive priority scheduling, non-preemptive priority scheduling, real-time, non-real-time, data waiting time, FCFS,Q-MAC.

Cite This Article

"Advanced Dynamic Multilevel Priority Packet Scheduling", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.2, Issue 4, page no. pp1220-1225, April-2015, Available at : http://www.jetir.org/papers/JETIR1504070.pdf

Publication Details

Published Paper ID: JETIR1504070
Registration ID: 150253
Published In: Volume 2 | Issue 4 | Year April-2015
DOI (Digital Object Identifier):
Page No: 1220-1225
ISSN Number: 2349-5162

Download Paper

Preview Article

Download Paper




Cite This Article

"Advanced Dynamic Multilevel Priority Packet Scheduling", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.2, Issue 4, page no. pp1220-1225, April-2015, Available at : http://www.jetir.org/papers/JETIR1504070.pdf




Preview This Article


Downlaod

Click here for Article Preview