6TiSCH Autonomous Scheduling Function (ASF)
draft-duquennoy-6tisch-asf-00
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Expired".
Expired & archived
|
|
|---|---|---|---|
| Authors | Simon Duquennoy , Xavier Vilajosana , Thomas Watteyne | ||
| Last updated | 2018-01-04 (Latest revision 2017-07-03) | ||
| RFC stream | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
This document defines a Scheduling Function called "ASF": the 6TiSCH Autoonomous Scheduling Function. With ASF, nodes maintain their TSCH schedule based on local neighborhood knowledge, without any signaling. Hashes of the nodes' MAC address are used to deterministically derive the [slotOffset,channelOffset] location of cells in the TSCH schedule. The MAC, control, and application traffic planes 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
Xavier Vilajosana
Thomas Watteyne
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)