Light allocation of tasks in clustered-based wireless sensor networks

Abstract EN

The problem of task allocation in Wireless Sensor Networks (WSNs) is addressed to cooperatively execute a complex application that can be divided into dependent tasks using Directed Acyclic Graph (DAG).

Light Allocation of Tasks (LAT) algorithm is introduced to map and schedule the application tasks among the sensor nodes so that the energy efficiency, network lifetime and application execution time are enhanced subject to meet the application deadline.

The LAT algorithm is a heuristic approach that minimizes the execution time of the application by scheduling the bigger tasks and sorting the DAG level in non-increasing order according to the number of tasks in the level that can be parallelized.

The network lifetime is also improved by selecting the mapping sensor nodes with the highest number of neighbors and energy remaining.

The simulation results show that the application execution time and the network lifetime are improved in LAT algorithm compared with other wellknown task allocation algorithms.