By Topic

Bounding data fusion for ubiquitous-applications within wireless sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Habib, S. ; Comput. Eng. Dept., Kuwait Univ., Safat ; Safar, M.

We have formulated the data collection process within wireless sensor networks as a scheduling problem to alleviate workload on the data collection centers. A sensor device has three tasks, which are mainly sensing data, processing and transmitting the collected data. We modeled the sensorpsilas three tasks as a task-flow graph (TFG), and then we combined all TFGs for all sensors within WSN as a super task-flow graph (STFG). We have utilized two scheduling algorithms, as soon as possible (ASAP) and as late as possible (ALAP), to order all tasks within STFG subject to the data collection centerspsila limitations. Our experimental results provide excellent bounds on how early and how late to schedule all sensorspsila tasks with the variation of the number of data collection centers.

Published in:

Ubi-Media Computing, 2008 First IEEE International Conference on

Date of Conference:

July 31 2008-Aug. 1 2008