Bounding Data Fusion for Ubiquitous-Applications within Wireless Sensor Networks
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 sensor’s 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 centers’ limitations. Our experimental results provide excellent bounds on how early and how late to schedule all sensors’ tasks with the variation of the number of data collection centers.
wireless sensor network data fusion ubiquitous-applications task flow graph schedule as soon as possible algorithm as late as possible algorithm
Sami Habib Maytham Safar
Kuwait University Computer Engineering Department P.O.Box 5969 Safat 13060 Kuwait
国际会议
The First IEEE International Conference on Ubi-Media Coputing and Workshops(第一届泛媒体处理国际会议)
兰州
英文
2008-07-15（万方平台首次上网日期，不代表论文的发表时间）