6TiSCH Autonomous Scheduling Function (ASF)
draft-duquennoy-6tisch-asf-01
| Document | Type | Expired Internet-Draft (individual) | |
|---|---|---|---|
| Last updated | 2018-09-03 (latest revision 2018-03-02) | ||
| Stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats |
Expired & archived
pdf
htmlized
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) | ||
https://www.ietf.org/archive/id/draft-duquennoy-6tisch-asf-01.txt
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.
Authors
Simon Duquennoy
(simon.duquennoy@ri.se)
Xavier Vilajosana
(xvilajosana@uoc.edu)
Thomas Watteyne
(thomas.watteyne@inria.fr)
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)