Abstract
In the emerging networked sensor systems, collaborative in-network processing provides a viable solution to overcome the limited energy and resource constraints of one single node. In this novel computing paradigm, it is very critical to perform task assignment. In this paper, we formally model TETA, an energy efficient topology-aware real time task assignment problem in wireless sensor networks, and prove its NP-completeness.We also propose an ant-based meta-heuristic algorithm to solve the TETA problem.We implement our algorithm and conduct experiments based on a simulation environment. The experimental results show that our approach can archive significant energy saving and improve the system lifetime effectively as well.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. R. Garey and D. S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1990.
C.-H. Lee and K. G. Shin. Optimal task assignment in homogeneous networks. IEEE Trans. Parallel Distrib. Syst., 8(2):119–129, 1997.
G. Malewicz, A. L. Rosenberg, and M. Yurkewych. On scheduling complex dags for internetbased computing. In IPDPS ’05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium, page 66, Washington, DC, USA, 2005.
H. Park and M. B. Srivastava. Energy-efficient task assignment framework for wireless sensor networks. Technical report, September 7 2003.
Y. Tian. Cross-layer collaborative in-network processing in multihop wireless sensor networks. IEEE Transactions on Mobile Computing, 6(3):297–310, 2007.
Y. Tian, J. Boangoat, E. Ekici, and F. Ozguner. Real-time task mapping and scheduling for collaborative in-network processing in dvs-enabled wireless sensor networks. ipdps, 2006.
Y. Tian, E. Ekici, and F. Ozguner. Energy-constrained task mapping and scheduling in wireless sensor networks. IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005., pages 8 pp.– 12, 7-10 Nov. 2005.
A. Wang and A. Chandrakasan. Energy-efficient dsps for wireless sensor networks. IEEE Signal Processing Magazine, 43(5):68–78, 2002.
C.-C. Yeh. Power-aware allocation of chain-like real-time tasks on dvs processors. IEICE - Trans. Inf. Syst., E89-D(12):2907–2918, 2006.
Y. Yu, B. Hong, and V. K. Prasanna. On communication models for algorithm design in networked sensor systems: a case study. Pervasive Mob. Comput., 1(1):95–121, 2005.
Y. Yu and V. K. Prasanna. Energy-balanced task allocation for collaborative processing in wireless sensor networks. Mob. Netw. Appl., 10(1-2):115–131, 2005.
M. Yurkewych. Toward a theory for scheduling dags in internet-based computing. IEEE Trans. Comput., 55(6):757–768, 2006.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this paper
Cite this paper
Zhao, B., Wang, M., Shao, Z., Cao, J., Chan, K.C., Su, J. (2008). Topology-Aware Energy Efficient Task Assignment for Collaborative In-Network Processing in Distributed Sensor Systems. In: Kleinjohann, B., Wolf, W., Kleinjohann, L. (eds) Distributed Embedded Systems: Design, Middleware and Resources. DIPES 2008. IFIP – The International Federation for Information Processing, vol 271. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09661-2_20
Download citation
DOI: https://doi.org/10.1007/978-0-387-09661-2_20
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-09660-5
Online ISBN: 978-0-387-09661-2
eBook Packages: Computer ScienceComputer Science (R0)