|
Twitter
|
Facebook
|
Google+
|
VKontakte
|
LinkedIn
|
Viadeo
|
English
|
Français
|
Español
|
العربية
|
 
International Journal of Innovation and Applied Studies
ISSN: 2028-9324     CODEN: IJIABO     OCLC Number: 828807274     ZDB-ID: 2703985-7
 
 
Saturday 21 December 2024

About IJIAS

News

Submission

Downloads

Archives

Custom Search

Contact

  • Contact us
  • Newsletter:

Connect with IJIAS

  Now IJIAS is indexed in EBSCO, ResearchGate, ProQuest, Chemical Abstracts Service, Index Copernicus, IET Inspec Direct, Ulrichs Web, Google Scholar, CAS Abstracts, J-Gate, UDL Library, CiteSeerX, WorldCat, Scirus, Research Bible and getCited, etc.  
 
 
 

In Press: A Hybrid Scheduling Algorithm for Reducing Average Waiting Time of Processes in Wireless Sensor Nodes



                 

Deepak Kapila1

1 Electronics & Communication, Chandigarh University, Gharuan, Mohali, Punjab, India

Original language: English

Copyright © 2024 ISSR Journals. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract


Wireless networks generally contain a large number of sensors, which are arbitrarily and densely located. These networks find use in various applications such as process management, health care monitoring, traffic analysis, and industrial process monitoring. Scheduling is commonly a technique which is used for controlling the process order of a Computer CPU. In wireless sensor networks for reducing the sensor’s energy consumption and terminal delays, scheduling plays an important role for a choice of data packets like real-time data packets and non-real time data packets. Scheduling algorithms for instance First Come First Serve, preemptive and non-preemptive priority algorithms puts large processing overhead and long terminal delays in data transmission. The development of packet scheduling algorithms can efficiently improve the delivery of packets between various wireless links in wireless networks. With the use of algorithms like packet scheduling, quality of service can be assured and transmission rate can be improved for wireless sensor networks. This paper fundamentally focuses on the wireless sensor network nodes as for each node the process execution requires the minimum reach to target. In this work the First Come First Serve Algorithm and Priority Scheduling algorithm has been applied for calculating the end-to-end delay. It can further be used for combining the coverage area for next processes. Shortest Job First (SJF) scheduling algorithm is then applied for finding the execution time on the basis of priority time reduction. Finally, a contrast of end-to-end delay with process execution time is done.

Author Keywords: WSN, Delay, Matlab, Scheduling, FCFS, CPU, SJF.