Task mapping and scheduling in wireless sensor networks

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Collaborative processing among sensors to fulfill given tasks is a promising solution to save significant energy in resource - limited wireless sensor networks. Quality of Service such as lifetime and latency is largely affected by how tasks are mapped to sensors in a network. Due to the limitations of wireless sensor networks, existing algorithms cannot be directly used. This paper presents an efficient allocating algorithm that allocates a set of real-time tasks with dependencies onto a sensor network. The proposed algorithm comprises linear task clustering algorithm and sensor assignment mechanism based on a task duplication and migration scheme. It simultaneously schedules the computation tasks and associated communication events of real time applications. It reduces inter-task communication costs and moderates local communication overhead incurred due to communication medium contention. Performance is evaluated through experiments with both randomly generated Directed Acyclic Graph (DAG) and real-world applications. Simulated results and qualitative comparisons with the most related literature, Multi-Hop Task Mapping and Scheduling (MTMS), Distributed Computing Architecture (DCA), and Energy-Balance Task Allocation (EBTA), demonstrated that the proposed scheme significantly surpasses the other approaches in terms of deadline missing ratio, schedule length, and total application energy consumption.

Original languageEnglish
Pages (from-to)257-265
Number of pages9
JournalIAENG International Journal of Computer Science
Volume40
Issue number4
Publication statusPublished - Nov 2013

Fingerprint

Wireless sensor networks
Scheduling
Communication
Sensors
Distributed computer systems
Energy balance
Clustering algorithms
Sensor networks
Quality of service
Energy utilization
Processing
Costs
Experiments

Keywords

  • Clustering
  • Real time applications
  • Task duplication and migration
  • Task scheduling
  • Terms-wireless sensor networks

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Task mapping and scheduling in wireless sensor networks. / Awadalla, M. H A.

In: IAENG International Journal of Computer Science, Vol. 40, No. 4, 11.2013, p. 257-265.

Research output: Contribution to journalArticle

@article{6797569efeee455a8e519e5568cc7eeb,
title = "Task mapping and scheduling in wireless sensor networks",
abstract = "Collaborative processing among sensors to fulfill given tasks is a promising solution to save significant energy in resource - limited wireless sensor networks. Quality of Service such as lifetime and latency is largely affected by how tasks are mapped to sensors in a network. Due to the limitations of wireless sensor networks, existing algorithms cannot be directly used. This paper presents an efficient allocating algorithm that allocates a set of real-time tasks with dependencies onto a sensor network. The proposed algorithm comprises linear task clustering algorithm and sensor assignment mechanism based on a task duplication and migration scheme. It simultaneously schedules the computation tasks and associated communication events of real time applications. It reduces inter-task communication costs and moderates local communication overhead incurred due to communication medium contention. Performance is evaluated through experiments with both randomly generated Directed Acyclic Graph (DAG) and real-world applications. Simulated results and qualitative comparisons with the most related literature, Multi-Hop Task Mapping and Scheduling (MTMS), Distributed Computing Architecture (DCA), and Energy-Balance Task Allocation (EBTA), demonstrated that the proposed scheme significantly surpasses the other approaches in terms of deadline missing ratio, schedule length, and total application energy consumption.",
keywords = "Clustering, Real time applications, Task duplication and migration, Task scheduling, Terms-wireless sensor networks",
author = "Awadalla, {M. H A}",
year = "2013",
month = "11",
language = "English",
volume = "40",
pages = "257--265",
journal = "IAENG International Journal of Computer Science",
issn = "1819-656X",
publisher = "International Association of Engineers",
number = "4",

}

TY - JOUR

T1 - Task mapping and scheduling in wireless sensor networks

AU - Awadalla, M. H A

PY - 2013/11

Y1 - 2013/11

N2 - Collaborative processing among sensors to fulfill given tasks is a promising solution to save significant energy in resource - limited wireless sensor networks. Quality of Service such as lifetime and latency is largely affected by how tasks are mapped to sensors in a network. Due to the limitations of wireless sensor networks, existing algorithms cannot be directly used. This paper presents an efficient allocating algorithm that allocates a set of real-time tasks with dependencies onto a sensor network. The proposed algorithm comprises linear task clustering algorithm and sensor assignment mechanism based on a task duplication and migration scheme. It simultaneously schedules the computation tasks and associated communication events of real time applications. It reduces inter-task communication costs and moderates local communication overhead incurred due to communication medium contention. Performance is evaluated through experiments with both randomly generated Directed Acyclic Graph (DAG) and real-world applications. Simulated results and qualitative comparisons with the most related literature, Multi-Hop Task Mapping and Scheduling (MTMS), Distributed Computing Architecture (DCA), and Energy-Balance Task Allocation (EBTA), demonstrated that the proposed scheme significantly surpasses the other approaches in terms of deadline missing ratio, schedule length, and total application energy consumption.

AB - Collaborative processing among sensors to fulfill given tasks is a promising solution to save significant energy in resource - limited wireless sensor networks. Quality of Service such as lifetime and latency is largely affected by how tasks are mapped to sensors in a network. Due to the limitations of wireless sensor networks, existing algorithms cannot be directly used. This paper presents an efficient allocating algorithm that allocates a set of real-time tasks with dependencies onto a sensor network. The proposed algorithm comprises linear task clustering algorithm and sensor assignment mechanism based on a task duplication and migration scheme. It simultaneously schedules the computation tasks and associated communication events of real time applications. It reduces inter-task communication costs and moderates local communication overhead incurred due to communication medium contention. Performance is evaluated through experiments with both randomly generated Directed Acyclic Graph (DAG) and real-world applications. Simulated results and qualitative comparisons with the most related literature, Multi-Hop Task Mapping and Scheduling (MTMS), Distributed Computing Architecture (DCA), and Energy-Balance Task Allocation (EBTA), demonstrated that the proposed scheme significantly surpasses the other approaches in terms of deadline missing ratio, schedule length, and total application energy consumption.

KW - Clustering

KW - Real time applications

KW - Task duplication and migration

KW - Task scheduling

KW - Terms-wireless sensor networks

UR - http://www.scopus.com/inward/record.url?scp=84890218339&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84890218339&partnerID=8YFLogxK

M3 - Article

VL - 40

SP - 257

EP - 265

JO - IAENG International Journal of Computer Science

JF - IAENG International Journal of Computer Science

SN - 1819-656X

IS - 4

ER -