Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1031495.1031506acmconferencesArticle/Chapter ViewAbstractPublication PagessensysConference Proceedingsconference-collections
Article

The dynamic behavior of a data dissemination protocol for network programming at scale

Published:03 November 2004Publication History

ABSTRACT

To support network programming, we present Deluge, a reliable data dissemination protocol for propagating large data objects from one or more source nodes to many other nodes over a multihop, wireless sensor network. Deluge builds from prior work in density-aware, epidemic maintenance protocols. Using both a real-world deployment and simulation, we show that Deluge can reliably disseminate data to all nodes and characterize its overall performance. On Mica2-dot nodes, Deluge can push nearly 90 bytes/second, one-ninth the maximum transmission rate of the radio supported under TinyOS. Control messages are limited to 18% of all transmissions. At scale, the protocol exposes interesting propagation dynamics only hinted at by previous dissemination work. A simple model is also derived which describes the limits of data propagation in wireless networks. Finally, we argue that the rates obtained for dissemination are inherently lower than that for single path propagation. It appears very hard to significantly improve upon the rate obtained by Deluge and we identify establishing a tight lower bound as an open problem.

References

  1. A. Demers, D. Greene, C. Hauser, W. Irish, and J. Larson. Epidemic algorithms for replicated database maintenance. In Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, pages 1--12. ACM Press, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. D. Ganesan, B. Krishnamachari, A. Woo, D. Culler, D. Estrin, and S. Wicker. Complex behavior at scale: An experimental study of low-power wireless sensor networks. Technical Report UCLA/CSD-TR 02-0013, UCLA, 2002.Google ScholarGoogle Scholar
  3. J. Jeong, S. Kim, and A. Broad. Network Reprogramming. University of California at Berkeley, Berkeley, CA, USA, August 2003.Google ScholarGoogle Scholar
  4. S. K. Kasera, G. Hjálmtýsson, D. F. Towsley, and J. F. Kurose. Scalable reliable multicast using multiple multicast channels. IEEE / ACM Transactions on Networking, 8(3):294--310, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. J. Kulik, W. R. Heinzelman, and H. Balakrishnan. Negotiation-based protocols for disseminating information in wireless sensor networks. Wireless Networks, 8(2-3):169--185, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. P. Levis and D. Culler. Maté: a tiny virtual machine for sensor networks. In 10th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-X), pages 85--95. ACM Press, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. P. Levis, N. Lee, M. Welsh, and D. Culler. TOSSIM: Accurate and scalable simulation of entire tinyos applications. In Proceedings of the First ACM Conference on Embedded Networked Sensor Systems (SenSys 2003). ACM Press, November 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. P. Levis, N. Patel, S. Shenker, and D. Culler. Trickle: A self-regulating algorithm for code propagation and maintenance in wireless sensor networks. Technical report, University of California at Berkeley, 2004.Google ScholarGoogle Scholar
  9. S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu. The broadcast storm problem in a mobile ad hoc network. In Proceedings of the Fifth Annual ACM/IEEE International Conference on Mobile Computing and Networking, pages 151--162. ACM Press, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. F. Stann and J. Heidemann. RMST: Reliable data transport in sensor networks. In Proceedings of the First International Workshop on Sensor Net Protocols and Applications, pages 102--112, Anchorage, Alaska, USA, April 2003. IEEE.Google ScholarGoogle ScholarCross RefCross Ref
  11. T. Stathopoulos, J. Heidemann, and D. Estrin. A remote code update mechanism for wireless sensor networks. Technical report, UCLA, Los Angeles, CA, USA, 2003.Google ScholarGoogle Scholar
  12. R. Szewczyk, J. Polastre, A. Mainwaring, and D. Culler. Lessons from a sensor network expedition. In Proceedings of the First European Workshop on Sensor Networks (EWSN), Berlin, Germany, Jan. 2004.Google ScholarGoogle ScholarCross RefCross Ref
  13. University of California, Berkeley. Smote testbed. http://smote.cs.berkeley.edu/.Google ScholarGoogle Scholar
  14. University of California, Berkeley. Mica2-dot schematics.Google ScholarGoogle Scholar
  15. http://webs.cs.berkeley.edu/tos/hardware/design/ORCAD_FILES/MICA2/6310-%0306-01ACLEAN.pdf, March 2003.Google ScholarGoogle Scholar
  16. University of California, Berkeley. Tinyos. http://www.tinyos.net/, 2004.Google ScholarGoogle Scholar
  17. C.-Y. Wan, A. T. Campbell, and L. Krishnamurthy. PSFQ: A reliable transport protocol for wireless sensor networks. In Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications, pages 1--11. ACM Press, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. The dynamic behavior of a data dissemination protocol for network programming at scale

        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
        • Published in

          cover image ACM Conferences
          SenSys '04: Proceedings of the 2nd international conference on Embedded networked sensor systems
          November 2004
          338 pages
          ISBN:1581138792
          DOI:10.1145/1031495

          Copyright © 2004 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 3 November 2004

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          Overall Acceptance Rate174of867submissions,20%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader