Multiround Algorithms for Scheduling Divisible Loads
IEEE Transactions on Parallel and Distributed Systems
Improved Methods for Divisible Load Distribution on k-Dimensional Meshes Using Multi-Installment
IEEE Transactions on Parallel and Distributed Systems
A Highly Efficient DAG Task Scheduling Algorithm for Wireless Sensor Networks
ICYCS '08 Proceedings of the 2008 The 9th International Conference for Young Computer Scientists
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
Hi-index | 0.00 |
To minimize the execution time (makespan) of a given task, an efficient task scheduling algorithm (ETSA) 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. ETSA builds from eliminating transmission collisions and idle gaps between two successive data transmissions. Simulation results are presented to demonstrate the impacts of different network parameters on the number of rounds, makespan and energy consumption.