skip to main content
article

Dynamic data fusion for future sensor networks

Published:01 August 2006Publication History
Skip Abstract Section

Abstract

DFuse is an architectural framework for dynamic application-specified data fusion in sensor networks. It bridges an important abstraction gap for developing advanced fusion applications that takes into account the dynamic nature of applications and sensor networks. Elements of the DFuse architecture include a fusion API, a distributed role assignment algorithm that dynamically adapts the placement of the application task graph on the network, and an abstraction migration facility that aids such dynamic role assignment. Experimental evaluations show that the API has low overhead, and simulation results show that the role assignment algorithm significantly increases the network lifetime over static placement.

References

  1. Adhikari, S., Paul, A., and Ramachandran, U. 2002. D-stampede: Distributed programming system for ubiquitous computing. In Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS, Vienna). Google ScholarGoogle Scholar
  2. Ahamad, Y. and Cetintemel, U. 2004. Network-aware query processing for stream-based applications. In Proceedings of the International Conference on Very Large Databases (VLDB). Google ScholarGoogle Scholar
  3. Bhardwaj, M. and Chandrakasan, A. 2002. Bounding the lifetime of sensor networks via optimal role assignments. In Proceedings of IEEE INFOCOM.Google ScholarGoogle Scholar
  4. Bhattacharya, S., Kim, H., Prabh, S., and Abdelzaher, T. 2003. Energy-conserving data placement and asynchronous multicast in wireless sensor networks. In MobiSys '03: Proceedings of the 1st International Conference on Mobile Systems, Applications and Services. ACM Press, New York, NY, 173--185. Google ScholarGoogle Scholar
  5. Boulis, A., Han, C. C., and Srivastava, M. B. 2003. Design and implementation of a framework for programmable and efficient sensor networks. In Proceedings of the 1st International Conference on Mobile Systems, Applications, and Services (MobiSys, San Francisco, CA). Google ScholarGoogle Scholar
  6. Cayirci, E., Su, W., and Sankarasubramanian, Y. 2002. Wireless sensor networks: A survey. Comput. Netw. 38, 4 (Mar.), 393--422. Google ScholarGoogle Scholar
  7. Chandrasekaran, S., Cooper, O., Deshpande, A., Franklin, M. J., Hellerstein, J. M., Hong, W., Krishnamurthy, S., Madden, S. R., Raman, V., Reiss, F., and Shah, M. A. 2003. TelegraphCQ: Continuous dataflow processing for an uncertain world. In Proceedings of the 1st Biennial Conference on Innovative Data Systems Research (CIDR).Google ScholarGoogle Scholar
  8. Chen, J., DeWitt, D. J., Tian, F., and Wang, Y. 2000. NiagaraCQ: A scalable continuous query system for internet databases. In Proceedings of the ACM SIGMOD Conference on Management of Data. Google ScholarGoogle Scholar
  9. Cherniack, M., Balakrishnan, H., Carney, D., Cetintemel, U., Xing, Y., and Zdonik, S. 2003. Scalable distributed stream processing. In Proceedings of the Conference on Innovative Database Research (CIDR).Google ScholarGoogle Scholar
  10. Garey, M. R. and Johnson, D. S. 1979. Computers and Intractablility: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, CA. Google ScholarGoogle Scholar
  11. Gu, X. and Nahrstedt, K. 2006. On composing stream applications in peer-to-peer environments. IEEE Trans. Parall. Distrib. Syst. 17, 8(Aug.), 824--837. Google ScholarGoogle Scholar
  12. Heidemann, J. S., Silva, F., Intanagonwiwat, C., Govindan, R., Estrin, D., and Ganesan, D. 2001. Building efficient wireless sensor networks with low-level naming. In Proceedings of the Symposium on Operating Systems Principles. 146--159. Google ScholarGoogle Scholar
  13. Hill, J., Szewczyk, R., Woo, A., Hollar, S., Culler, D. E., and Pister, K. S. J. 2000. System architecture directions for networked sensors. In Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems. 93--104. Google ScholarGoogle Scholar
  14. Intanagonwiwat, C., Govindan, R., and Estrin, D. 2000. Directed diffusion: A scalable and robust communication paradigm for sensor networks. In Proceedings of the MobiCom '00. 56--67. Google ScholarGoogle Scholar
  15. Jae-Hwan, C. and Leandros, T. 2000. Energy conserving routing in wireless ad-hoc networks. In Proceedings of IEEE INFOCOM. 22--31.Google ScholarGoogle Scholar
  16. Kumar, R., Wolenetz, M., Agarwalla, B., Shin, J., Hutto, P. W., Paul, A., and Ramachandran, U. 2003. DFuse: Framework for distributed data fusion. In Proceedings of ACM SenSys 2003. Google ScholarGoogle Scholar
  17. Liu, H., Roeder, T., Walsh, K., Barr, R., and Sirer, E. G. 2005. Design and implementation of a single system image operating system for ad hoc networks. In MobiSys '05: Proceedings of the 3rd International Conference on Mobile Systems, Applications, and Services. ACM Press, New York, NY, 149--162. Google ScholarGoogle Scholar
  18. Madden, S. R., Franklin, M. J., Hellerstein, J. M., and Hong, W. 2002. Tag: A tiny aggregation service for ad-hoc sensor networks. In Proceedings of the Conference on Operating System Design and Implementation (OSDI, Boston, MA). Google ScholarGoogle Scholar
  19. Motwani, R., Widom, J., Arasu, A., Babcock, B., Babu, S., Datar, M., Manku, G., Olston, C., Rosenstein, J., and Varma, R. 2003. Query processing, resource management, and approximation in a data stream management system. In Proceedings of the 1st Biennial Conference on Innovative Data Systems Research (CIDR).Google ScholarGoogle Scholar
  20. Netperf. 2003. The public Netperf homepage: http://www.netperf.org/.Google ScholarGoogle Scholar
  21. Ori. 2003. ORiNOCO PC Card (Silver/Gold). For the specification, go online to http://www. hyperlinktech.com/web/orinoco/-orinoco_pc_card_spec.html.Google ScholarGoogle Scholar
  22. Papadimitriou, C. and Yannakakis, M. 1988. Towards an architecture-independent analysis of parallel algorithms. In STOC '88: Proceedings of the 20th Annual ACM Symposium on Theory of Computing. ACM Press, New York, NY, 510--513. Google ScholarGoogle Scholar
  23. Pietzuch, P., Ledlie, J., Shneidman, J., Welsh, M., Seltzer, M., and Roussopoulos, M. 2006. Network-aware operator placement for stream-processing systems. In Proceedings of the International Conference on Data Engineering (ICDE). Google ScholarGoogle Scholar
  24. Polastre, J., Tolle, G., and Hui, J. 2004. Low power mesh networking with telos and IEEE 802.15.4. In Proceedings of SenSys. 319. Google ScholarGoogle Scholar
  25. Ramachandran, U., Nikhil, R. S., Harel, N., Rehg, J. M., and Knobe, K. 1999. Space-time memory: A parallel programming abstraction for interactive multimedia applications. In Proceedings of the ACM Conference on Principles and Practices of Parallel Programming. 183--192. Google ScholarGoogle Scholar
  26. Rehg, J. M., Loughlin, M., and Waters, K. 1997. Vison for a smart kiosk. In Proceedings of the Conference on Computer Vision and Pattern Recognition. 690--696. Google ScholarGoogle Scholar
  27. Robins, G. and Zelikovsky, A. 2000. Improved Steiner tree approximation in graphs. In SODA '00: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 770--779. Google ScholarGoogle Scholar
  28. Singh, S., Woo, M., and Raghavendra, C. S. 1998. Power-aware routing in mobile ad hoc networks. In Proceedings of MobiCom '98. 181--190. Google ScholarGoogle Scholar
  29. Srivastava, U., Munagala, K., and Widom, J. 2005. Operator placement for in-network stream query processing. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS). Google ScholarGoogle Scholar
  30. Tewari, R., Dahlin, M., Vin, H. M., and Kay, J. S. 1999. Design considerations for distributed caching on the internet. In Proceedings of ICDCS. 273--284. Google ScholarGoogle Scholar
  31. Viola, P. and Jones, M. 2001. Rapid object detection using a boosted cascade of simple features. In Proceedings of CVPR. 511--518.Google ScholarGoogle Scholar
  32. Wolenetz, M. 2005. Characterizing middleware mechanisms for future sensor networks. Ph.D. dissertation. College of Computing, Georgia Institute of Technology, Atlanta, GA. Google ScholarGoogle Scholar
  33. Wolenetz, M., Kumar, R., Shin, J., and Ramachandran, U. 2004. Middleware guidelines for future sensor networks. In Proceedings of the 1st Workshop on Broadband Advanced Sensor Networks.Google ScholarGoogle Scholar
  34. Wolenetz, M., Kumar, R., Shin, J., and Ramachandran, U. 2005. A simulation-based study of wireless sensor network middleware. Int. J. Netw. Manage. (Special Issue on Sensor Networks) 15, 4 (Jul.), 255--267. Google ScholarGoogle Scholar
  35. Zayas, E. 1987. Attacking the process migration bottleneck. In Proceedings of the 11th ACM Symposium on Operating Systems Principles. ACM Press, New York, NY, 13--24. Google ScholarGoogle Scholar

Index Terms

  1. Dynamic data fusion for future sensor networks

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader