Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


osu1155694115.pdf (1.09 MB)

ETD Abstract Container

Abstract Header

Energy-efficient computation and communication scheduling for cluster-based in-network processing in large-scale wireless sensor networks

Tian, Yuan
http://rave.ohiolink.edu/etdc/view?acc_num=osu1155694115

Abstract Details

2006, Doctor of Philosophy, Ohio State University, Electrical Engineering.
Emerging Wireless Sensor Networks (WSN) applications demand considerable computation capacity for in-network processing. To achieve the required processing capacity, cross-layer collaborative in-network processing among sensors emerges as a promising solution: Sensors not only process information at the application layer, but also synchronize their communication activities to exchange partially processed data for parallel processing. Task mapping and scheduling plays an important role in parallel processing. Though this problem has been extensively studied in the high performance computing area, its counterpart in WSNs remains largely unexplored. Scheduling computation and communication events is a challenging problem in WSNs due to limited resource availability and shared communication medium. This research investigates the energy-efficient task mapping and scheduling problem in large-scale WSNs composed of homogeneous wireless sensors. A hierarchical WSN architecture is assumed to be composed of sensor clusters, where applications are iteratively executed. Given this environment, task mapping and scheduling in single-hop clustered WSNs is investigated for energy-constrained applications. Based on the proposed Hyper-DAG model and single-hop channel model, the EcoMapS solution minimizes schedule lengths subject to energy consumption constraints. Secondly, real-time applications are also considered in single-hop clustered WSNs. Incorporating the novel Dynamic Voltage Scaling (DVS) algorithm, the RT-MapS solution provides deadline guarantee with the minimum balanced energy consumption. Next, the task mapping and scheduling problem is further addressed in its general form for multi-hop clustered WSNs. A novel multi-hop channel model is developed, and a multi-hop communication scheduling algorithm is presented, based on which the MTMS solution minimizes application energy consumption subject to deadline constraints. Finally, low-complexity sensor failure handling algorithms are developed to recover network functionality when sensors failures occur in single-hop and multi-hop clustered WSNs.
Fusun Ozguner (Advisor)
wireless sensor networks; clusered networks; task mapping and scheduling

Recommended Citations

Citations

  • Tian, Y. (2006). Energy-efficient computation and communication scheduling for cluster-based in-network processing in large-scale wireless sensor networks [Doctoral dissertation, Ohio State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=osu1155694115

    APA Style (7th edition)

  • Tian, Yuan. Energy-efficient computation and communication scheduling for cluster-based in-network processing in large-scale wireless sensor networks. 2006. Ohio State University, Doctoral dissertation. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=osu1155694115.

    MLA Style (8th edition)

  • Tian, Yuan. "Energy-efficient computation and communication scheduling for cluster-based in-network processing in large-scale wireless sensor networks." Doctoral dissertation, Ohio State University, 2006. http://rave.ohiolink.edu/etdc/view?acc_num=osu1155694115

    Chicago Manual of Style (17th edition)

osu1155694115
1,120
© 2006, all rights reserved.
This open access ETD is published by The Ohio State University and OhioLINK.