Modeling Data-Aggregation within Wireless Sensor Networks as Scheduling of Super Task-Flow-Graph

The paper examines the resources needed to carry on all the tasks within wireless sensor networks (WSN) by modeling the data-aggregation within WSN as a scheduling problem. A typical sensor executes three tasks periodically, which are mainly sensing, processing and transmitting. We have modeled the...

Full description

Saved in:
Bibliographic Details
Published in2009 11th International Conference on Computer Modeling and Simulation pp. 502 - 507
Main Author Habib, S.J.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.03.2009
Subjects
as late as possible
as soon as possible
Batteries
branch-and-bound
Capacitive sensors
Computer networks
data-aggregation
gateway
Optical fiber communication
Processor scheduling
Radio frequency
schedule
Scheduling algorithm
Sensor phenomena and characterization
task-flow-graph
Transceivers
wireless sensor network
Wireless sensor networks
Online AccessGet full text

Cover

More Information
Summary:The paper examines the resources needed to carry on all the tasks within wireless sensor networks (WSN) by modeling the data-aggregation within WSN as a scheduling problem. A typical sensor executes three tasks periodically, which are mainly sensing, processing and transmitting. We have modeled the sensorpsilas three tasks as a task-flow graph (TFG), and then we have combined all TFGs for all sensors within WSN as a super task-flow-graph (STFG). Three scheduling algorithms (as soon as possible (ASAP), as late as possible (ALAP) and branch-and-bound (BB)) are utilized to order all tasks within STFG, subject to the concurrency of executions among the sensorspsila tasks. The computational results have provided excellent bounds on the number of gateways, which are needed to retrieve the collected data by the sensors.
ISBN:9781424437719
1424437717
DOI:10.1109/UKSIM.2009.19