Drizzle Algorithm
draft-baraq-roll-drizzle-00

Document Type Expired Internet-Draft (individual)
Last updated 2018-09-24 (latest revision 2018-03-23)
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-baraq-roll-drizzle-00.txt

Abstract

Trickle algorithm used in RPL routing protocol suffers from some issues related to power, network convergence time and overhead and load-distribution. To optimize this algorithm for Low-power and Lossy Networks (LLNs), a new algorithm called Drizzle is introduced. Drizzle uses an adaptive suppression mechanism that permits the nodes to have different transmission probabilities, which are consistent with their transmission history. Compared to Trickle, Drizzle removes the listen-only period from Drizzle's intervals, thus, leading to faster convergence time. Furthermore, a new policy for setting the redundancy coefficient has been used to mitigate the negative effect of the short-listen problem presented when removing the listen-only period and to further boost the fairness in the network.

Authors

Baraq Ghaleb (b.ghaleb@napier.ac.uk)
Ahmed Al-Dubai (a.al-dubai@napier.ac.uk)
Imed Romdhani (i.romdhani@napier.ac.uk)
Mamoun Qasem (m.qasem@napier.ac.uk)

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