z-logo
open-access-imgOpen Access
Scate: A Scalable Time and Energy Aware Actor Task Allocation Algorithm in Wireless Sensor and Actor Networks
Author(s) -
Sharifi Mohsen,
Okhovvat Morteza
Publication year - 2012
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.12.0111.0366
Subject(s) - computer science , scalability , task (project management) , wireless sensor network , scheduling (production processes) , distributed computing , wireless , job shop scheduling , execution time , energy (signal processing) , real time computing , computer network , mathematical optimization , engineering , routing (electronic design automation) , telecommunications , statistics , mathematics , systems engineering , database
In many applications of wireless sensor actor networks (WSANs) that often run in harsh environments, the reduction of completion times of tasks is highly desired. We present a new time‐aware, energy‐aware, and starvation‐free algorithm called Scate for assigning tasks to actors while satisfying the scalability and distribution requirements of WSANs with semi‐automated architecture. The proposed algorithm allows concurrent executions of any mix of small and large tasks and yet prevents probable starvation of tasks. To achieve this, it estimates the completion times of tasks on each available actor and then takes the remaining energies and the current workloads of these actors into account during task assignment to actors. The results of our experiments with a prototyped implementation of Scate show longer network lifetime, shorter makespan of resulting schedules, and more balanced loads on actors compared to when one of the three well‐known task‐scheduling algorithms, namely, the max‐min, min‐min, and opportunistic load balancing algorithms, is used.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here