6TiSCH Minimal Scheduling Function (MSF)
draft-ietf-6tisch-msf-02
|
| Document |
Type |
|
Active Internet-Draft (6tisch WG)
|
|
Last updated |
|
2019-03-11
|
|
Stream |
|
IETF
|
|
Intended RFC status |
|
(None)
|
|
Formats |
|
plain text
pdf
html
bibtex
|
| Stream |
WG state
|
|
WG Document
|
|
On Agenda |
|
6tisch at IETF-104
|
|
Document shepherd |
|
No shepherd assigned
|
| IESG |
IESG state |
|
I-D Exists
|
|
Consensus Boilerplate |
|
Unknown
|
|
Telechat date |
|
|
|
Responsible AD |
|
(None)
|
|
Send notices to |
|
(None)
|
6TiSCH T. Chang, Ed.
Internet-Draft M. Vucinic
Intended status: Standards Track Inria
Expires: September 12, 2019 X. Vilajosana
Universitat Oberta de Catalunya
S. Duquennoy
RISE SICS
D. Dujovne, Ed.
Universidad Diego Portales
March 11, 2019
6TiSCH Minimal Scheduling Function (MSF)
draft-ietf-6tisch-msf-02
Abstract
This specification defines the 6TiSCH Minimal Scheduling Function
(MSF). This Scheduling Function describes both the behavior of a
node when joining the network, and how the communication schedule is
managed in a distributed fashion. MSF builds upon the 6TiSCH
Operation Sublayer Protocol (6P) and the Minimal Security Framework
for 6TiSCH.
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
[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 12, 2019.
Chang, et al. Expires September 12, 2019 [Page 1]
Internet-Draft 6TiSCH Minimal Scheduling Function (MSF) March 2019
Copyright Notice
Copyright (c) 2019 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. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 3
2. Interface to the Minimal 6TiSCH Configuration . . . . . . . . 4
3. Autonomous Cells . . . . . . . . . . . . . . . . . . . . . . 5
4. Node Behavior at Boot . . . . . . . . . . . . . . . . . . . . 6
4.1. Start State . . . . . . . . . . . . . . . . . . . . . . . 7
4.2. Step 1 - Choosing Frequency . . . . . . . . . . . . . . . 7
4.3. Step 2 - Receiving EBs . . . . . . . . . . . . . . . . . 7
4.4. Step 3 - Setting up Autonomous Cells during Join Process 7
4.5. Step 4 - Installing Autonomous Cells for each neighbor in
neighbor table . . . . . . . . . . . . . . . . . . . . . 8
4.6. Step 5 - Acquiring a RPL rank . . . . . . . . . . . . . . 8
4.7. Step 6 - Send EBs and DIOs . . . . . . . . . . . . . . . 8
4.8. Step 7 - Neighbor Polling . . . . . . . . . . . . . . . . 8
4.9. End State . . . . . . . . . . . . . . . . . . . . . . . . 9
5. Rules for Adding/Deleting Cells . . . . . . . . . . . . . . . 9
5.1. Adapting to Traffic . . . . . . . . . . . . . . . . . . . 9
5.2. Switching Parent . . . . . . . . . . . . . . . . . . . . 11
5.3. Handling Schedule Collisions . . . . . . . . . . . . . . 12
6. 6P SIGNAL command . . . . . . . . . . . . . . . . . . . . . . 13
7. Scheduling Function Identifier . . . . . . . . . . . . . . . 13
8. Rules for CellList . . . . . . . . . . . . . . . . . . . . . 13
9. 6P Timeout Value . . . . . . . . . . . . . . . . . . . . . . 14
10. Rule for Ordering Cells . . . . . . . . . . . . . . . . . . . 14
11. Meaning of the Metadata Field . . . . . . . . . . . . . . . . 14
12. 6P Error Handling . . . . . . . . . . . . . . . . . . . . . . 14
13. Schedule Inconsistency Handling . . . . . . . . . . . . . . . 15
Show full document text