Research Article Open Access

DYNAMIC PLANNING BASED SCHEDULING APPROACH FOR WIRELESS SENSOR NETWORKS

M. Senthil Kumaran1 and R. Rangarajan2
  • 1 SCSVMV University, India
  • 2 , India

Abstract

Energy efficiency is an important issue in wireless sensor networks. A sensor node has a microprocessor and a small amount of memory for signal processing and task scheduling. Dynamic Planning is a method is used in this approach it combines the flexibility of dynamic scheduling with the predictability offered by schedulabilty check. Whenever a node wants to transmit data packet to the other node, the cluster head attempts to guarantee data packets by constructing a plan for its transmission without violating the guarantees of the previously scheduled transmission. ParMyopic scheduling technique is used for transmission. The simulation results shows that the degree of parallelization increases the success ratio for the speedup function used. The resources or file sharing can be done effectively using this Parmyopic scheduling scheme in the wireless sensor network with the deployment of nodes. The query response time is reduced by allowing more than one applications to be executed simultaneously.

Journal of Computer Science
Volume 9 No. 10, 2013, 1318-1322

DOI: https://doi.org/10.3844/jcssp.2013.1318.1322

Submitted On: 16 March 2012 Published On: 5 September 2013

How to Cite: Kumaran, M. S. & Rangarajan, R. (2013). DYNAMIC PLANNING BASED SCHEDULING APPROACH FOR WIRELESS SENSOR NETWORKS. Journal of Computer Science, 9(10), 1318-1322. https://doi.org/10.3844/jcssp.2013.1318.1322

  • 2,543 Views
  • 2,084 Downloads
  • 0 Citations

Download

Keywords

  • Data Packets
  • Deadline
  • Earliest Deadline First
  • Myopic
  • Scheduling
  • Task