A Highly Efficient DAG Task Scheduling Algorithm for Wireless Sensor Networks

2008 ◽  
Author(s):  
Zhiwen Zeng ◽  
Anfeng Liu ◽  
Deng Li ◽  
Jun Long
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Wireless Sensor ◽  
Highly Efficient ◽  
Task Scheduling Algorithm

scholarly journals An Optimal Task Scheduling Algorithm in Wireless Sensor Networks

2011 ◽  
Vol 6 (1) ◽  
pp. 101 ◽  
Author(s):  
Liang Dai ◽  
Yilin Chang ◽  
Zhong Shen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Optimal Number ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Network Resource ◽  
Task Scheduling Algorithm ◽  
Two Phases

Sensing tasks should be allocated and processed among sensor nodes in minimum times so that users can draw useful conclusions through analyzing sensed data. Furthermore, finishing sensing task faster will benefit energy saving, which is critical in system design of wireless sensor networks. To minimize the execution time (makespan) of a given task, an optimal task scheduling algorithm (OTSA-WSN) in a clustered wireless sensor network is proposed based on divisible load theory. The algorithm consists of two phases: intra-cluster task scheduling and inter-cluster task scheduling. Intra-cluster task scheduling deals with allocating different fractions of sensing tasks among sensor nodes in each cluster; inter-cluster task scheduling involves the assignment of sensing tasks among all clusters in multiple rounds to improve overlap of communication with computation. OTSA-WSN builds from eliminating transmission collisions and idle gaps between two successive data transmissions. By removing performance degradation caused by communication interference and idle, the reduced finish time and improved network resource utilization can be achieved. With the proposed algorithm, the optimal number of rounds and the most reasonable load allocation ratio on each node could be derived. Finally, simulation results are presented to demonstrate the impacts of different network parameters such as the number of clusters, computation/communication latency, and measurement/communication speed, on the number of rounds, makespan and energy consumption.

DMTA: A Task Scheduling Algorithm in Multi-Sinks Wireless Sensor Networks Based on Divisible Load Theory

2010 ◽  
Vol 143-144 ◽  
pp. 143-147
Author(s):  
Liang Dai ◽  
Zhong Shen ◽  
Yi Lin Chang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Wireless Sensor ◽  
Task Completion ◽  
Divisible Load Theory ◽  
Divisible Load ◽  
Load Theory ◽  
Task Scheduling Algorithm

Multi-Sinks wireless sensor networks, a current research focus, has better stability and effectiveness compared to the traditional single-SINK structure. To solve the problem how to complete the tasks within the possibly shortest time, a task scheduling algorithm(DMTA) based on divisible load theory in multi-Sinks wireless sensor networks is proposed. In DMTA, the tasks are distributed to wireless sensor network based on the processing and communication capacity of each sensor by multiple Sinks respectively. By removing communications interference between each sensor, reduced task completion time and improved network resource utilization achieved. Simulation results show that DMTA reasonably distributes tasks to each node in wireless sensor networks, and effectively reduces the time-consuming of task completion.

Sign in / Sign up

Export Citation Format

Share Document