By Topic

Dynamic critical-path task mapping and scheduling for collaborative in-network processing in multi-hop 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

4 Author(s)
Yuan Tian ; Dept. of Electr. & Comput. Eng., Ohio State Univ., Columbus, OH ; Yaoyao Gu ; Ekici, E. ; Ozguner, F.

Although task mapping and scheduling in wired networks of processors has been extensively studied, their application to WSNs remains largely unexplored. Existing algorithms cannot be directly implemented in WSNs due to limited resource availability and shared communication medium. In this work, an application-independent task mapping and scheduling solution in multi-hop WSNs is presented that provides realtime guarantees. Using a novel multi-hop channel model and a communication scheduling algorithm, computation tasks and associated communication events are scheduled simultaneously with a dynamic critical-path scheduling algorithm. Dynamic voltage scaling (DVS) mechanism is implemented to further optimize energy consumption. According to the simulation results, the proposed solution outperforms existing mechanisms in terms of guaranteeing application deadlines with minimum energy consumption

Published in:

Parallel Processing Workshops, 2006. ICPP 2006 Workshops. 2006 International Conference on

Date of Conference:

0-0 0