6TiSCH Autonomous Scheduling Function (ASF)
draft-duquennoy-6tisch-asf-01

Document Type Active Internet-Draft (individual)
Last updated 2018-03-02
Stream (None)
Intended RFC status (None)
Formats plain text xml 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)
6TiSCH                                                 S. Duquennoy, Ed.
Internet-Draft                                                 RISE SICS
Intended status: Standards Track                           X. Vilajosana
Expires: September 2, 2018               Universitat Oberta de Catalunya
                                                             T. Watteyne
                                                                   Inria
                                                           March 1, 2018

              6TiSCH Autonomous Scheduling Function (ASF)
                     draft-duquennoy-6tisch-asf-01

Abstract

   This document defines a Scheduling Function called "ASF": the 6TiSCH
   Autonomous Scheduling Function.  With ASF, nodes maintain their TSCH
   schedule based on local neighborhood knowledge, without any signaling
   after association.  Hashes of the nodes' MAC address are used to
   deterministically derive the [slotOffset,channelOffset] location of
   cells in the TSCH schedule.  Different traffic types (e.g.  TSCH EB,
   RPL DIO, UDP etc.) are assigned to distinct slotframes, for isolation
   and flexible dimensioning.  This approach provides over-provisioned
   schedules with low maintenance, in pursuit for simplicity rather than
   optimality.

Requirements Language

   The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
   "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and
   "OPTIONAL" in this document are to be interpreted as described in RFC
   2119 [RFC2119].

Status of This Memo

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

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF).  Note that other groups may also distribute
   working documents as Internet-Drafts.  The list of current Internet-
   Drafts is at https://datatracker.ietf.org/drafts/current/.

   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."

   This Internet-Draft will expire on September 2, 2018.

Duquennoy, et al.       Expires September 2, 2018               [Page 1]
Internet-Draft 6TiSCH Autonomous Scheduling Function (ASF)    March 2018

Copyright 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
   (https://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.  TEMPORARY EDITORIAL NOTES . . . . . . . . . . . . . . . . . .   3
   2.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   3
     2.1.  Application Domains . . . . . . . . . . . . . . . . . . .   3
   3.  General Operation . . . . . . . . . . . . . . . . . . . . . .   4
     3.1.  Cell Coordinates  . . . . . . . . . . . . . . . . . . . .   4
     3.2.  Types of Slotframes . . . . . . . . . . . . . . . . . . .   4
       3.2.1.  Rendez-vous slotframe . . . . . . . . . . . . . . . .   4
       3.2.2.  Receiver-based slotframe  . . . . . . . . . . . . . .   4
       3.2.3.  Sender-based slotframe  . . . . . . . . . . . . . . .   5
     3.3.  Conditional Cells . . . . . . . . . . . . . . . . . . . .   5
     3.4.  Interaction between Slotframes  . . . . . . . . . . . . .   5
   4.  Configuration . . . . . . . . . . . . . . . . . . . . . . . .   6
   5.  Scheduling Function Identifier  . . . . . . . . . . . . . . .   9
   6.  Rules for Adding/Deleting Cells . . . . . . . . . . . . . . .   9
   7.  Rules for CellList  . . . . . . . . . . . . . . . . . . . . .   9
   8.  6P Timeout Value  . . . . . . . . . . . . . . . . . . . . . .  10
   9.  Rule for Ordering Cells . . . . . . . . . . . . . . . . . . .  10
   10. Meaning of the Metadata Field . . . . . . . . . . . . . . . .  10
   11. Node Behavior at Boot . . . . . . . . . . . . . . . . . . . .  10
   12. 6P Error Handling . . . . . . . . . . . . . . . . . . . . . .  10
   13. Examples  . . . . . . . . . . . . . . . . . . . . . . . . . .  11
   14. [TEMPORARY] Implementation Status . . . . . . . . . . . . . .  11
   15. Security Considerations . . . . . . . . . . . . . . . . . . .  11
   16. IANA Considerations . . . . . . . . . . . . . . . . . . . . .  12
     16.1.  6P Scheduling Function Identifiers 'ASF' . . . . . . . .  12
   17. References  . . . . . . . . . . . . . . . . . . . . . . . . .  12
Show full document text