Skip to main content

The Trickle Algorithm
draft-levis-roll-trickle-00

Document Type Replaced Internet-Draft (individual)
Authors P Levis , Thomas H. Clausen
Last updated 2013-02-19 (Latest revision 2010-02-25)
Replaced by RFC 6206
Stream (None)
Formats
Expired & archived
Stream Stream state (No stream defined)
Consensus boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Replaced by draft-ietf-roll-trickle
Telechat date (None)
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:

Abstract

The Trickle algorithm allows wireless nodes to exchange information in a highly robust, energy efficient, simple, and scalable manner. Dynamically adjusting transmission windows allows Trickle to spread new information on the scale of link-layer transmission times while sending only a few messages per hour when information does not change. A simple suppression nechanism and transmission point selection allows Trickle's communication rate to scale logarithmically with density. This document describes Trickle and considerations in its use.

Authors

P Levis
Thomas H. Clausen

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)