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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Shih, E., Cho, S., Ickes, N., Min, R., Sinha, A., Wang, A., Chandrakasan, A.: Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks. In: Proc. of ACM MobiCom 2001, pp. 272–286 (2001)
Wang, A., Chandrakasan, A.: Energy-efficient DSPs for wireless sensor networks. IEEE Signal Processing Magazine, 68–78 (2002)
Kumar, R., Tsiatsis, V., Srivastava, M.B.: Computation hierarchy for in-network processing. In: Proc. of the 2nd ACM international conference on Wireless Sensor Networks and Applications (WSNA 2003), pp. 68–77 (2003)
Dogan, A., Özgüner, F.: Matching and scheduling algorithms for minimizing execution time and failure probability of applications in heterogenous computing. IEEE Transaction on Parallel and Distributed Systems 13, 308–323 (2002)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York (1979)
Giannecchini, S., Caccamo, M., Shih, C.S.: Collaborative resource allocation in wireless sensor networks. In: Proc. of Euromicro Conference on Real-Time Systems (ECRTS 2004), pp. 35–44 (2004)
Basu, P., Ke, W., Little, T.D.C.: Dynamic task-based anycasting in mobile ad hoc networks. Mobile Networks and Applications 8, 593–612 (2003)
Kumar, R., Wolenetz, M., Agarwalla, B., Shin, J., Hutto, P., Paul, A., Ramachandran, U.: DFuse: A framework for distributed data fusion. In: Proc. of The ACM Conference on Embedded Networked Sensor Systems (SenSys 2003), pp. 114–125 (2003)
Shivle, S., Castain, R., Siegel, H.J., Maciejewski, A.A., Banka, T., Chindam, K., Dussinger, S., Pichumani, P., Satyasekaan, P., Saylor, W., Sendek, D., Sousa, J., Sridharan, J., Sugavanam, P., Velazco, J.: Static mapping of subtasks in a heterogeneous ad hoc grid environment. In: Proc. of Parallel and Distributed Processing Symposium (2004)
Hagras, T., Janecek, J.: A high performance, low complexity algorithm for compile-time job scheduling in homogeneous computing environments. In: Proc. of International Conference on Parallel Processing Workshops (ICPPW 2003), pp. 149–155 (2003)
Heinzelman, W.B., Chandrakasan, A., Balakrishnan, H.: An application-specific protocol architecture for wireless microsensor networks. IEEE Transactions on Wireless Communications 1, 660–670 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tian, Y., Özgüner, F., Ekici, E. (2005). Comparison of Hyper-DAG Based Task Mapping and Scheduling Heuristics for Wireless Sensor Networks. In: Yolum, p., Güngör, T., Gürgen, F., Özturan, C. (eds) Computer and Information Sciences - ISCIS 2005. ISCIS 2005. Lecture Notes in Computer Science, vol 3733. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11569596_10
Download citation
DOI: https://doi.org/10.1007/11569596_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29414-6
Online ISBN: 978-3-540-32085-2
eBook Packages: Computer ScienceComputer Science (R0)