The emergence of a networking primitive in wireless sensor networks

The wireless sensor network community approached netabstractions 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 thousand-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 challeng...

• Type: Journal
• Year: 2008
• Where: CACM
• Authors: Philip Levis, Eric A. Brewer, David E. Culler, David Gay, Samuel Madden, Neil Patel, Joseph Polastre, Scott Shenker, Robert Szewczyk, Alec Woo
• Keywords: CACM 2008, Trickle, Trickle Algorithm, Wireless Sensor Networks