Skip to main content

Comparison of Hyper-DAG Based Task Mapping and Scheduling Heuristics for Wireless Sensor Networks

  • Conference paper
Computer and Information Sciences - ISCIS 2005 (ISCIS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3733))

Included in the following conference series:

  • 2623 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    Google Scholar 

  2. Wang, A., Chandrakasan, A.: Energy-efficient DSPs for wireless sensor networks. IEEE Signal Processing Magazine, 68–78 (2002)

    Google Scholar 

  3. 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)

    Google Scholar 

  4. 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)

    Article  Google Scholar 

  5. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York (1979)

    Google Scholar 

  6. 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)

    Google Scholar 

  7. 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)

    Article  Google Scholar 

  8. 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)

    Google Scholar 

  9. 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)

    Google Scholar 

  10. 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)

    Google Scholar 

  11. 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)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics