Analysis and modeling of task scheduling in wireless sensor network based on divisible load theory. (20th June 2012)

• Record Type: Journal Article
• Authors: Dai, Liang; Shen, Zhong; Chen, Ting; Chang, Yilin
• Is Part Of: International journal of communication systems. Volume 27:Number 5(2014:May)
• Page Start: 721
• Page End: 731
• Publication Date: 2012-06-20
• Subjects: Telecommunication systems -- Periodicals; 621.382
• DOI: 10.1002/dac.2378
• Languages: English
• ISSNs: 1074-5351

Abstract

<abstract abstract-type="main" id="dac2378-abs-0001"> <title>SUMMARY</title> <p id="dac2378-para-0005">In this paper, we propose a novel task scheduling algorithm (Divisible Task scheduling Algorithm for Wireless sensor networks (DTAW)) based on divisible load theory in heterogeneous wireless sensor networks to complete the tasks within the shortest possible time and reduce the sensors' energy‐consuming. In DTAW, the tasks are distributed to the wireless sensor network by the (SINK) on the basis of the processing and communication capacity of each sensor. After receiving the subtasks, the intracluster sensors carry out its tasks simultaneously and send the results to cluster head sequentially. By removing communication interference between each sensor, reduced task completion time and improved network resource utilization are achieved. Each cluster head simultaneously finishes sending fused data to the SINK after fusing the data obtained from intracluster sensors. In this way, the overlap between the task performing and communication phase would be much better. Simulation results are presented to demonstrate the impacts of different network parameters on the makespan and energy consumption. The results show that the algorithm enables to reasonably distribute tasks to each sensor and then effectively reduces the time‐consuming and energy‐consuming. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p> </abstract>