ACM Home Page
Please provide us with feedback. Feedback
The emergence of a networking primitive in wireless sensor networks
Full text Digital EditionDigital Edition HtmlHtml (1 KB),  PdfPdf (2.08 MB)
Source
Communications of the ACM archive
Volume 51 ,  Issue 7  (July 2008) table of contents
Web science
SECTION: Research highlights table of contents
Pages 99-106  
Year of Publication: 2008
ISSN:0001-0782
Authors
Philip Levis  Stanford University, Stanford, CA
Eric Brewer  U.C. Berkeley, Berkeley, CA
David Culler  U.C. Berkeley, Berkeley, CA
David Gay  U.C. Berkeley, Berkeley, CA
Samuel Madden  MIT CSAIL, Cambridge, MA
Neil Patel  Stanford University, Stanford, CA
Joe Polastre  Sentilla Corporation, Redwood City, CA
Scott Shenker  U.C. Berkeley, Berkeley, CA
Robert Szewczyk  Sentilla Corporation, Redwood City, CA
Alec Woo  Arch Rock Corporation, San Francisco, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 133,   Downloads (12 Months): 856,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1364782.1364804
What is a DOI?

ABSTRACT

The wireless sensor network community approached networking abstractions as an open question, allowing answers to emerge with time and experience. The Trickle algorithm has become a basic mechanism used in numerous protocols and systems. Trickle brings nodes to eventual consistency quickly and efficiently while remaining remarkably robust to variations in network density, topology, and dynamics. Instead of flooding a network with packets, Trickle uses a "polite gossip" policy to control send rates so each node hears just enough packets to stay consistent. This simple mechanism enables Trickle to scale to 1000-fold changes in network density, reach consistency in seconds, and require only a few bytes of state yet impose a maintenance cost of a few sends an hour. Originally designed for disseminating new code, experience has shown Trickle to have much broader applicability, including route maintenance and neighbor discovery. This paper provides an overview of the research challenges wireless sensor networks face, describes the Trickle algorithm, and outlines several ways it is used today.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Arch Rock Corporation. An IPv6 Network Stack for Wireless Sensor Networks. http://www.archrock.com.
2
 
3
Crossbow, Inc. Mote in Network Programming User Reference. http://webs.cs.berkeley.edu/tos/tinyos-1.x/doc/Xnp.pdf.
4
5
 
6
Fonseca, R., Gnawali, O., Jamieson, K., and Levis, P. Four bit wireless link estimation. Proceedings of the Sixth Workshop on Hot Topics in Networks (HotNets VI), 2007.
7
8
9
10
 
11
12
 
13
 
14
15
 
16
Mao, Y., Wang, F., Qiu, L., Lam, S., and Smith, J. S4: small state and small stretch routing protocol for large wireless sensor networks. Proceedings of the Fourth USENIX Symposium on Networked Systems Design and Implementation (NSDI), 2007.
17
18
19
 
20
Sun Microsystems Laboratories. Project Sun SPOT: Small Programmable Object Technology. http://www.sunspotworld.com/.
 
21
TinyOS Network Protocol Working Group. TEP 123: The Collection Tree Protocol. http://www.tinyos.net//tinyos-2.x/doc/txt/tep123.txt, 2007.
 
22
Tolle, G. and Culler, D. Design of an application-cooperative management system for wireless sensor networks. Proceedings of the Second European Workshop of Wireless Sensor Netw orks (EWSN), 2005.
23
24
25


Collaborative Colleagues:
Philip Levis: colleagues
Eric Brewer: colleagues
David Culler: colleagues
David Gay: colleagues
Samuel Madden: colleagues
Neil Patel: colleagues
Joe Polastre: colleagues
Scott Shenker: colleagues
Robert Szewczyk: colleagues
Alec Woo: colleagues