@misc{rfc6206,
    series =    {Request for Comments},
    number =    6206,
    howpublished =  {RFC 6206},
    publisher = {RFC Editor},
    doi =       {10.17487/RFC6206},
    url =       {https://www.rfc-editor.org/info/rfc6206},
    author =    {P Levis and Thomas H. Clausen and Omprakash Gnawali and Jonathan Hui and JeongGil Ko},
    title =     {{The Trickle Algorithm}},
    pagetotal = 13,
    year =      2011,
    month =     mar,
    abstract =  {The Trickle algorithm allows nodes in a lossy shared medium (e.g., low-power and lossy networks) 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 mechanism and transmission point selection allow Trickle's communication rate to scale logarithmically with density. This document describes the Trickle algorithm and considerations in its use. {[}STANDARDS-TRACK{]}},
}