Drizzle Algorithm
draft-baraq-roll-drizzle-00

Document Type Active Internet-Draft (individual)
Last updated 2018-03-23
Stream (None)
Intended RFC status (None)
Formats plain text pdf html bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state I-D Exists
Telechat date
Responsible AD (None)
Send notices to (None)
ROLL                                                                    
INTERNET-DRAFT                                                  B.Ghaleb
Intended Status: Standards Track                              A.Al-Dubai
Expires: September 23, 2018                                   I.Romdhani
                                                                 M.Qasem
                                             Edinburgh Napier University
                                                          March 22, 2018

                           Drizzle Algorithm
                      draft-baraq-roll-drizzle-00

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. 

Status of this Memo

   This Internet-Draft is submitted to IETF in full conformance with the
   provisions of BCP 78 and BCP 79.

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF), its areas, and its working groups.  Note that
   other groups may also distribute working documents as
   Internet-Drafts.

   Internet-Drafts are draft documents valid for a maximum of six months
   and may be updated, replaced, or obsoleted by other documents at any
   time.  It is inappropriate to use Internet-Drafts as reference
   material or to cite them other than as "work in progress."

   The list of current Internet-Drafts can be accessed at
   http://www.ietf.org/1id-abstracts.html
 

Ghaleb, et al.         Expires September 23, 2018               [Page 1]
INTERNET DRAFT             Drizzle Algorithm              March 22, 2018

   The list of Internet-Draft Shadow Directories can be accessed at
   http://www.ietf.org/shadow.html

Copyright and License Notice

   Copyright (c) 2018 IETF Trust and the persons identified as the
   document authors. All rights reserved.

   This document is subject to BCP 78 and the IETF Trust's Legal
   Provisions Relating to IETF Documents
   (http://trustee.ietf.org/license-info) in effect on the date of
   publication of this document. Please review these documents
   carefully, as they describe your rights and restrictions with respect
   to this document. Code Components extracted from this document must
   include Simplified BSD License text as described in Section 4.e of
   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

Table of Contents

   1  Introduction  . . . . . . . . . . . . . . . . . . . . . . . . .  3
     1.1  Terminology . . . . . . . . . . . . . . . . . . . . . . . .  3
   2.  Drizzle Algorithm  . . . . . . . . . . . . . . . . . . . . . .  4
     2.1 Drizzle Variables  . . . . . . . . . . . . . . . . . . . . .  4
     2.1 Drizzle Parameters . . . . . . . . . . . . . . . . . . . . .  4
     2.1 Drizzle Operations . . . . . . . . . . . . . . . . . . . . .  5
   3  Security Considerations . . . . . . . . . . . . . . . . . . . .  7
   4  References  . . . . . . . . . . . . . . . . . . . . . . . . . .  7
     4.1  Normative References  . . . . . . . . . . . . . . . . . . .  7
     4.2  Informative References  . . . . . . . . . . . . . . . . . .  7
   Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . .  8

 

Ghaleb, et al.         Expires September 23, 2018               [Page 2]
INTERNET DRAFT             Drizzle Algorithm              March 22, 2018

1  Introduction

   A key design principle of any routing protocol is to have an
   efficient mechanism for disseminating routing information through the
   network, and maintaining up-to-date information. One of the
   mechanisms to perform this task is to periodically propagate the
   routing information so often which is widely used in unconstrained
   wired networks. A major issue with adopting this approach is the high
   volume of traffic overhead that may affect negatively the performance
   of the resource-constrained large-scale LLNs [1]. The simplicity of
   route update and maintenance adopted by those routing protocols is
   the primary reason behind this issue. This is because that routing
   information must be propagated periodically by each sensor node even
Show full document text