The emergence of a networking primitive in wireless sensor networks

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.

[1]  GovindanRamesh,et al.  The Tenet architecture for tiered sensor networks , 2010 .

[2]  senior researcher , 2022 .

[3]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[4]  ZHANGLi-xia,et al.  A reliable multicast framework for light-weight sessions and application level framing , 1995 .

[5]  David E. Culler,et al.  Taming the underlying challenges of reliable multihop routing in sensor networks , 2003, SenSys '03.

[6]  Kamin Whitehouse,et al.  Clairvoyant: a comprehensive source-level debugger for wireless sensor networks , 2007, SenSys '07.

[7]  Limin Wang,et al.  MNP: Multihop Network Reprogramming Service for Sensor Networks , 2004, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[8]  Ramesh Govindan,et al.  RCRT: rate-controlled reliable transport for wireless sensor networks , 2007, SenSys '07.

[9]  Philip Levis,et al.  Data Discovery and Dissemination with DIP , 2008, 2008 International Conference on Information Processing in Sensor Networks (ipsn 2008).

[10]  David E. Culler,et al.  TOSSIM: accurate and scalable simulation of entire TinyOS applications , 2003, SenSys '03.

[11]  Robert Tappan Morris,et al.  a high-throughput path metric for multi-hop wireless routing , 2003, MobiCom '03.

[12]  Scott Shenker,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[13]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[14]  David E. Culler,et al.  Active sensor networks , 2005, NSDI.

[15]  Robert Szewczyk,et al.  System architecture directions for networked sensors , 2000, ASPLOS IX.

[16]  Lili Qiu,et al.  S4: Small State and Small Stretch Routing Protocol for Large Wireless Sensor Networks , 2007, NSDI.

[17]  David E. Culler,et al.  The dynamic behavior of a data dissemination protocol for network programming at scale , 2004, SenSys '04.

[18]  Wei Hong,et al.  TinyDB: an acquisitional query processing system for sensor networks , 2005, TODS.

[19]  Deborah Estrin,et al.  The Tenet architecture for tiered sensor networks , 2006, SenSys '06.

[20]  Philip Levis,et al.  Four-Bit Wireless Link Estimation , 2007, HotNets.

[21]  Ramesh Govindan,et al.  Interference-aware fair rate control in wireless sensor networks , 2006, SIGCOMM.

[22]  David E. Culler,et al.  Design of an application-cooperative management system for wireless sensor networks , 2005, Proceeedings of the Second European Workshop on Wireless Sensor Networks, 2005..