Thumbnail
Access Restriction
Subscribed

Author Woo, Alec ♦ Gay, David ♦ Polastre, Joe ♦ Shenker, Scott ♦ Szewczyk, Robert ♦ Brewer, Eric ♦ Madden, Samuel ♦ Patel, Neil ♦ Culler, David ♦ Levis, Philip
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
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.
Description Affiliation: Arch Rock Corporation, San Francisco, CA (Woo, Alec) || U.C. Berkeley, Berkeley, CA (Brewer, Eric; Culler, David; Gay, David; Shenker, Scott) || Sentilla Corporation, Redwood City, CA (Polastre, Joe; Szewczyk, Robert) || Stanford University, Stanford, CA (Levis, Philip; Patel, Neil) || MIT CSAIL, Cambridge, MA (Madden, Samuel)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 51
Issue Number 7
Page Count 8
Starting Page 99
Ending Page 106


Open content in new tab

   Open content in new tab
Source: ACM Digital Library