Comparison of Hyper-DAG based task mapping and scheduling heuristics for wireless sensor networks

Authors:
Yuan Tian;Füsun Özgüner;Eylem Ekici
Affiliations:
Department of Electrical and Computer Engineering, The Ohio State University;Department of Electrical and Computer Engineering, The Ohio State University;Department of Electrical and Computer Engineering, The Ohio State University
Venue:
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Year:
2005

Citing 8
Cited 0

Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks

Proceedings of the 7th annual international conference on Mobile computing and networking
Matching and Scheduling Algorithms for Minimizing Execution Time and Failure Probability of Applications in Heterogeneous Computing

IEEE Transactions on Parallel and Distributed Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Computation hierarchy for in-network processing

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Dynamic task-based anycasting in mobile ad hoc networks

Mobile Networks and Applications
DFuse: a framework for distributed data fusion

Proceedings of the 1st international conference on Embedded networked sensor systems
Collaborative Resource Allocation in Wireless Sensor Networks

ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
An application-specific protocol architecture for wireless microsensor networks

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In-network processing emerges as an approach to reduce energy consumption in Wireless Sensor Networks (WSN) by decreasing the overall transferred data volume. Parallel processing among sensors is a promising approach to provide the computation capacity required by in-network processing methods. In this paper, Hyper-DAG based Mapping and Scheduling (HDMS) algorithms for energy constrained WSNs are introduced. The design objective of these algorithms is to minimize schedule lengths subject to energy consumption constraints. Simulation results show that the CNPT-based HDMS algorithm outperforms other heuristic algorithms with respect to schedule lengths and heuristic execution times subject to energy consumption constraints.