Fast Response Multilevel Scheduling Scheme for Wireless Sensor Networks
Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2014, Vol 16, Issue 2
Abstract
Abstract: Wireless sensor networks (WSNs) have a wide variety of military and civil applications. The sensor nodes are powered by batteries with limited energy. Hostile or hazardous environments where the sensor nodes are deployed or the sheer number of the sensors prevents replacement or recharge of the batteries. Therefore in WSNs, scheduling of different types of packets 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 delay due to the FCFS concept, starvation of high priority real-time data packets due to the transmission of a large data packet in non- preemptive priority scheduling, starvation of non-real-time data packets due to the probable continuous arrival of real-time data in preemptive priority scheduling, and improper allocation of data packets to queues in multilevel queue scheduling algorithms. Moreover, these algorithms are not dynamic to the changing requirements of WSN applications since their scheduling policies are predetermined. In this paper, we propose a Dynamic Multilevel Priority (DMP) packet scheduling scheme. In the proposed scheme, each node, except those at the last level of the virtual hierarchy in the zone- based topology of WSN, has three levels of priority queues. Real-time packets are placed into the highest-priority queue and can preempt data packets in other queues. Non-real-time packets are placed into two other queues based on a certain threshold of their estimated processing time. Leaf nodes have two queues for real-time and non-real-time data packets since they do not receive data from other nodes and thus, reduce end- to-end delay.
Authors and Affiliations
Mrs. Vaishali S. Nikam, , Prof. Shiv Om Tiwari
Keywords
Related Articles
- EP ID EP142077
- DOI 10.9790/0661-162813814
- Views 68
- Downloads 0
An Analytical Study of Genetic Algorithm for Generating Frequent Itemset and Framing Association Rules At Various Support Levels
Abstract: In customary, frequent itemsets are propogated from large data sets by employing association rule mining algorithms like Apriori, Partition, Pincer-Search, Incremental and Border algorithm etc., which gains ino...
Efficient Optimization of Multiple SPARQL Queries
A W3C standard for processing RDF data is a SPARQL query language, a technique that is used to encode data in meaningful manner. We investigate the foundations of SPARQL query optimization by grouping into ind...
Task Allocation in heterogeneous Distributed Real Time System for Optimal Utilization of Processor’s Capacity
Abstract: In Distributed Real Time System (DRTS), systematic allocation of the tasks among processors is one of the important parameter, which determine the optimal utilization of available resources. If this step is not...
Heart Disease Detection using EKSTRAP Clustering with Statistical and Distance based Classifiers
Abstract : The heart is the most important organ in the human body which pumps blood to various parts of the body. If there is inefficient circulation of blood in body organs like brain will suffer. If heart stops pumpin...
An Integrated Approach to Design an EAF for the CCS of ICDSin India
Abstract: E-government is getting a positive thrust in view of `Digital India Project` initiatives by the currentgovernment in India. At present, information and communication technology (ICT) has become an essenti...