| 1 |
<pre>Internet Engineering Task Force (IETF) T. Watteyne, Ed. |
| 2 |
Request for Comments: 7554 Linear Technology |
| 3 |
Category: Informational M. Palattella |
| 4 |
ISSN: 2070-1721 University of Luxembourg |
| 5 |
L. Grieco |
| 6 |
Politecnico di Bari |
| 7 |
May 2015 |
| 8 |
|
| 9 |
|
| 10 |
<span class="h1">Using IEEE 802.15.4e Time-Slotted Channel Hopping (TSCH) in the</span> |
| 11 |
<span class="h1">Internet of Things (IoT): Problem Statement</span> |
| 12 |
|
| 13 |
Abstract |
| 14 |
|
| 15 |
This document describes the environment, problem statement, and goals |
| 16 |
for using the Time-Slotted Channel Hopping (TSCH) Medium Access |
| 17 |
Control (MAC) protocol of IEEE 802.14.4e in the context of Low-Power |
| 18 |
and Lossy Networks (LLNs). The set of goals enumerated in this |
| 19 |
document form an initial set only. |
| 20 |
|
| 21 |
Status of This Memo |
| 22 |
|
| 23 |
This document is not an Internet Standards Track specification; it is |
| 24 |
published for informational purposes. |
| 25 |
|
| 26 |
This document is a product of the Internet Engineering Task Force |
| 27 |
(IETF). It represents the consensus of the IETF community. It has |
| 28 |
received public review and has been approved for publication by the |
| 29 |
Internet Engineering Steering Group (IESG). Not all documents |
| 30 |
approved by the IESG are a candidate for any level of Internet |
| 31 |
Standard; see <a href="./rfc5741#section-2">Section 2 of RFC 5741</a>. |
| 32 |
|
| 33 |
Information about the current status of this document, any errata, |
| 34 |
and how to provide feedback on it may be obtained at |
| 35 |
<a href="http://www.rfc-editor.org/info/rfc7554">http://www.rfc-editor.org/info/rfc7554</a>. |
| 36 |
|
| 37 |
|
| 38 |
|
| 39 |
|
| 40 |
|
| 41 |
|
| 42 |
|
| 43 |
|
| 44 |
|
| 45 |
|
| 46 |
|
| 47 |
|
| 48 |
|
| 49 |
|
| 50 |
|
| 51 |
|
| 52 |
<span class="grey">Watteyne, et al. Informational [Page 1]</span></pre> |
| 53 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-2" ></span> |
| 54 |
<span class="grey"><a href="./rfc7554">RFC 7554</a> 6TiSCH-TSCH May 2015</span> |
| 55 |
|
| 56 |
|
| 57 |
Copyright Notice |
| 58 |
|
| 59 |
Copyright (c) 2015 IETF Trust and the persons identified as the |
| 60 |
document authors. All rights reserved. |
| 61 |
|
| 62 |
This document is subject to <a href="https://www.rfc-editor.org/bcp/bcp78">BCP 78</a> and the IETF Trust's Legal |
| 63 |
Provisions Relating to IETF Documents |
| 64 |
(<a href="http://trustee.ietf.org/license-info">http://trustee.ietf.org/license-info</a>) in effect on the date of |
| 65 |
publication of this document. Please review these documents |
| 66 |
carefully, as they describe your rights and restrictions with respect |
| 67 |
to this document. Code Components extracted from this document must |
| 68 |
include Simplified BSD License text as described in Section 4.e of |
| 69 |
the Trust Legal Provisions and are provided without warranty as |
| 70 |
described in the Simplified BSD License. |
| 71 |
|
| 72 |
|
| 73 |
|
| 74 |
|
| 75 |
|
| 76 |
|
| 77 |
|
| 78 |
|
| 79 |
|
| 80 |
|
| 81 |
|
| 82 |
|
| 83 |
|
| 84 |
|
| 85 |
|
| 86 |
|
| 87 |
|
| 88 |
|
| 89 |
|
| 90 |
|
| 91 |
|
| 92 |
|
| 93 |
|
| 94 |
|
| 95 |
|
| 96 |
|
| 97 |
|
| 98 |
|
| 99 |
|
| 100 |
|
| 101 |
|
| 102 |
|
| 103 |
|
| 104 |
|
| 105 |
|
| 106 |
|
| 107 |
|
| 108 |
<span class="grey">Watteyne, et al. Informational [Page 2]</span></pre> |
| 109 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-3" ></span> |
| 110 |
<span class="grey"><a href="./rfc7554">RFC 7554</a> 6TiSCH-TSCH May 2015</span> |
| 111 |
|
| 112 |
|
| 113 |
Table of Contents |
| 114 |
|
| 115 |
<a href="#section-1">1</a>. Introduction . . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-4">4</a> |
| 116 |
<a href="#section-2">2</a>. TSCH in the LLN Context . . . . . . . . . . . . . . . . . . . <a href="#page-5">5</a> |
| 117 |
<a href="#section-3">3</a>. Problems and Goals . . . . . . . . . . . . . . . . . . . . . <a href="#page-7">7</a> |
| 118 |
<a href="#section-3.1">3.1</a>. Network Formation . . . . . . . . . . . . . . . . . . . . <a href="#page-8">8</a> |
| 119 |
<a href="#section-3.2">3.2</a>. Network Maintenance . . . . . . . . . . . . . . . . . . . <a href="#page-8">8</a> |
| 120 |
<a href="#section-3.3">3.3</a>. Multi-Hop Topology . . . . . . . . . . . . . . . . . . . <a href="#page-8">8</a> |
| 121 |
<a href="#section-3.4">3.4</a>. Routing and Timing Parents . . . . . . . . . . . . . . . <a href="#page-8">8</a> |
| 122 |
<a href="#section-3.5">3.5</a>. Resource Management . . . . . . . . . . . . . . . . . . . <a href="#page-9">9</a> |
| 123 |
<a href="#section-3.6">3.6</a>. Dataflow Control . . . . . . . . . . . . . . . . . . . . <a href="#page-9">9</a> |
| 124 |
<a href="#section-3.7">3.7</a>. Deterministic Behavior . . . . . . . . . . . . . . . . . <a href="#page-9">9</a> |
| 125 |
<a href="#section-3.8">3.8</a>. Scheduling Mechanisms . . . . . . . . . . . . . . . . . . <a href="#page-10">10</a> |
| 126 |
<a href="#section-3.9">3.9</a>. Secure Communication . . . . . . . . . . . . . . . . . . <a href="#page-10">10</a> |
| 127 |
<a href="#section-4">4</a>. Security Considerations . . . . . . . . . . . . . . . . . . . <a href="#page-11">11</a> |
| 128 |
<a href="#section-5">5</a>. References . . . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-11">11</a> |
| 129 |
<a href="#section-5.1">5.1</a>. Normative References . . . . . . . . . . . . . . . . . . <a href="#page-11">11</a> |
| 130 |
<a href="#section-5.2">5.2</a>. Informative References . . . . . . . . . . . . . . . . . <a href="#page-11">11</a> |
| 131 |
<a href="#appendix-A">Appendix A</a>. TSCH Protocol Highlights . . . . . . . . . . . . . . <a href="#page-15">15</a> |
| 132 |
<a href="#appendix-A.1">A.1</a>. Time Slots . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-15">15</a> |
| 133 |
<a href="#appendix-A.2">A.2</a>. Slotframes . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-15">15</a> |
| 134 |
<a href="#appendix-A.3">A.3</a>. Node TSCH Schedule . . . . . . . . . . . . . . . . . . . <a href="#page-15">15</a> |
| 135 |
<a href="#appendix-A.4">A.4</a>. Cells and Bundles . . . . . . . . . . . . . . . . . . . . <a href="#page-16">16</a> |
| 136 |
<a href="#appendix-A.5">A.5</a>. Dedicated vs. Shared Cells . . . . . . . . . . . . . . . <a href="#page-17">17</a> |
| 137 |
<a href="#appendix-A.6">A.6</a>. Absolute Slot Number . . . . . . . . . . . . . . . . . . <a href="#page-17">17</a> |
| 138 |
<a href="#appendix-A.7">A.7</a>. Channel Hopping . . . . . . . . . . . . . . . . . . . . . <a href="#page-17">17</a> |
| 139 |
<a href="#appendix-A.8">A.8</a>. Time Synchronization . . . . . . . . . . . . . . . . . . <a href="#page-18">18</a> |
| 140 |
<a href="#appendix-A.9">A.9</a>. Power Consumption . . . . . . . . . . . . . . . . . . . . <a href="#page-19">19</a> |
| 141 |
<a href="#appendix-A.10">A.10</a>. Network TSCH Schedule . . . . . . . . . . . . . . . . . . <a href="#page-19">19</a> |
| 142 |
<a href="#appendix-A.11">A.11</a>. Join Process . . . . . . . . . . . . . . . . . . . . . . <a href="#page-19">19</a> |
| 143 |
<a href="#appendix-A.12">A.12</a>. Information Elements . . . . . . . . . . . . . . . . . . <a href="#page-20">20</a> |
| 144 |
<a href="#appendix-A.13">A.13</a>. Extensibility . . . . . . . . . . . . . . . . . . . . . . <a href="#page-20">20</a> |
| 145 |
<a href="#appendix-B">Appendix B</a>. TSCH Features . . . . . . . . . . . . . . . . . . . <a href="#page-21">21</a> |
| 146 |
<a href="#appendix-B.1">B.1</a>. Collision-Free Communication . . . . . . . . . . . . . . <a href="#page-21">21</a> |
| 147 |
<a href="#appendix-B.2">B.2</a>. Multi-Channel vs. Channel Hopping . . . . . . . . . . . . <a href="#page-21">21</a> |
| 148 |
<a href="#appendix-B.3">B.3</a>. Cost of (Continuous) Synchronization . . . . . . . . . . <a href="#page-21">21</a> |
| 149 |
<a href="#appendix-B.4">B.4</a>. Topology Stability . . . . . . . . . . . . . . . . . . . <a href="#page-21">21</a> |
| 150 |
<a href="#appendix-B.5">B.5</a>. Multiple Concurrent Slotframes . . . . . . . . . . . . . <a href="#page-22">22</a> |
| 151 |
Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-22">22</a> |
| 152 |
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-23">23</a> |
| 153 |
|
| 154 |
|
| 155 |
|
| 156 |
|
| 157 |
|
| 158 |
|
| 159 |
|
| 160 |
|
| 161 |
|
| 162 |
|
| 163 |
|
| 164 |
<span class="grey">Watteyne, et al. Informational [Page 3]</span></pre> |
| 165 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-4" ></span> |
| 166 |
<span class="grey"><a href="./rfc7554">RFC 7554</a> 6TiSCH-TSCH May 2015</span> |
| 167 |
|
| 168 |
|
| 169 |
<span class="h2"><a class="selflink" id="section-1" href="#section-1">1</a>. Introduction</span> |
| 170 |
|
| 171 |
IEEE 802.15.4e [<a href="#ref-IEEE.802.15.4e">IEEE.802.15.4e</a>] was published in 2012 as an amendment |
| 172 |
to the Medium Access Control (MAC) protocol defined by the IEEE |
| 173 |
802.15.4 standard (of 2011) [<a href="#ref-IEEE.802.15.4">IEEE.802.15.4</a>]. IEEE 802.15.4e will be |
| 174 |
rolled into the next revision of IEEE 802.15.4, scheduled to be |
| 175 |
published in 2015. The Time-Slotted Channel Hopping (TSCH) mode of |
| 176 |
IEEE 802.15.4e is the object of this document. The term "TSCH" |
| 177 |
refers to TSCH as used in [<a href="#ref-IEEE.802.15.4e">IEEE.802.15.4e</a>]. |
| 178 |
|
| 179 |
This document describes the main issues arising from the adoption of |
| 180 |
the TSCH in the LLN context, following the terminology defined in |
| 181 |
[<a href="#ref-TERMS-6TISCH">TERMS-6TISCH</a>]. <a href="#appendix-A">Appendix A</a> further gives an overview of the key |
| 182 |
features of the TSCH amendment to IEEE 802.15.4e. <a href="#appendix-B">Appendix B</a> details |
| 183 |
features of TSCH, which might be interesting for the work of the |
| 184 |
6TiSCH WG. |
| 185 |
|
| 186 |
TSCH was designed to allow IEEE 802.15.4 devices to support a wide |
| 187 |
range of applications including, but not limited to, industrial ones |
| 188 |
[<a href="#ref-IEEE.802.15.4e">IEEE.802.15.4e</a>]. At its core is a medium access technique that uses |
| 189 |
time synchronization to achieve low-power operation and channel |
| 190 |
hopping to enable high reliability. Synchronization accuracy impacts |
| 191 |
power consumption and can vary from microseconds to milliseconds |
| 192 |
depending on the solution. This is very different from the "legacy" |
| 193 |
IEEE 802.15.4 MAC protocol and is therefore better described as a |
| 194 |
"redesign". TSCH does not amend the physical layer, i.e., it can |
| 195 |
operate on any hardware that is compliant with IEEE 802.15.4. |
| 196 |
|
| 197 |
IEEE 802.15.4e is the latest generation of ultra-lower power and |
| 198 |
reliable networking solutions for LLNs. [<a href="./rfc5673" title=""Industrial Routing Requirements in Low-Power and Lossy Networks"">RFC5673</a>] discusses |
| 199 |
industrial applications and highlights the harsh operating conditions |
| 200 |
as well as the stringent reliability, availability, and security |
| 201 |
requirements for an LLN to operate in an industrial environment. In |
| 202 |
these environments, vast deployment environments with large |
| 203 |
(metallic) equipment cause multi-path fading and interference to |
| 204 |
thwart any attempt of a single-channel solution to be reliable; the |
| 205 |
channel agility of TSCH is the key to its ultra-high reliability. |
| 206 |
Commercial networking solutions are available today in which nodes |
| 207 |
consume 10's of microamps on average [<a href="#ref-CurrentCalculator">CurrentCalculator</a>] with end-to- |
| 208 |
end packet delivery ratios over 99.999% [<a href="#ref-Doherty07channel">Doherty07channel</a>]. |
| 209 |
|
| 210 |
IEEE 802.15.4e has been designed for low-power constrained devices, |
| 211 |
often called "motes". Several terms are used in the IETF to refer to |
| 212 |
those devices, including "LLN nodes" [<a href="./rfc7102" title=""Terms Used in Routing for Low-Power and Lossy Networks"">RFC7102</a>] and "constrained |
| 213 |
nodes" [<a href="./rfc7228" title=""Terminology for Constrained-Node Networks"">RFC7228</a>]. In this document, we use the generic (and shorter) |
| 214 |
term "node", used as a synonym for "LLN node", "constrained node", or |
| 215 |
"mote". |
| 216 |
|
| 217 |
|
| 218 |
|
| 219 |
|
| 220 |
<span class="grey">Watteyne, et al. Informational [Page 4]</span></pre> |
| 221 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-5" ></span> |
| 222 |
<span class="grey"><a href="./rfc7554">RFC 7554</a> 6TiSCH-TSCH May 2015</span> |
| 223 |
|
| 224 |
|
| 225 |
Enabling the LLN protocol stack to operate in industrial environments |
| 226 |
opens up new application domains for these networks. Sensors |
| 227 |
deployed in smart cities [<a href="./rfc5548" title=""Routing Requirements for Urban Low-Power and Lossy Networks"">RFC5548</a>] will be able to be installed for |
| 228 |
years without needing battery replacement. "Umbrella" networks will |
| 229 |
interconnect smart elements from different entities in smart |
| 230 |
buildings [<a href="./rfc5867" title=""Building Automation Routing Requirements in Low-Power and Lossy Networks"">RFC5867</a>]. Peel-and-stick switches will obsolete the need |
| 231 |
for costly conduits for lighting solutions in smart homes [<a href="./rfc5826" title=""Home Automation Routing Requirements in Low-Power and Lossy Networks"">RFC5826</a>]. |
| 232 |
|
| 233 |
TSCH focuses on the MAC layer only. This clean layering allows for |
| 234 |
TSCH to fit under an IPv6-enabled protocol stack for LLNs, running an |
| 235 |
IPv6 over Low-Power Wireless Personal Area Network (6LoWPAN) |
| 236 |
[<a href="./rfc6282" title=""Compression Format for IPv6 Datagrams over IEEE 802.15.4-Based Networks"">RFC6282</a>], the IPv6 Routing Protocol for Low-Power and Lossy Networks |
| 237 |
(RPL) [<a href="./rfc6550" title=""RPL: IPv6 Routing Protocol for Low-Power and Lossy Networks"">RFC6550</a>], and the Constrained Application Protocol (CoAP) |
| 238 |
[<a href="./rfc7252" title=""The Constrained Application Protocol (CoAP)"">RFC7252</a>]. What is missing is a functional entity that is in charge |
| 239 |
of scheduling TSCH time slots for frames to be sent on. In this |
| 240 |
document, we refer to this entity as the "Logical Link Control" |
| 241 |
(LLC), bearing in mind that realizations of this entity can be of |
| 242 |
different types, including a distributed protocol or a centralized |
| 243 |
server in charge of scheduling. |
| 244 |
|
| 245 |
While [<a href="#ref-IEEE.802.15.4e">IEEE.802.15.4e</a>] defines the mechanisms for a TSCH node to |
| 246 |
communicate, it does not define the policies to build and maintain |
| 247 |
the communication schedule, match that schedule to the multi-hop |
| 248 |
paths maintained by RPL, adapt the resources allocated between |
| 249 |
neighbor nodes to the data traffic flows, enforce a differentiated |
| 250 |
treatment for data generated at the application layer and signaling |
| 251 |
messages needed by 6LoWPAN and RPL to discover neighbors, react to |
| 252 |
topology changes, self-configure IP addresses, or manage keying |
| 253 |
material. |
| 254 |
|
| 255 |
In other words, TSCH is designed to allow optimizations and strong |
| 256 |
customizations, simplifying the merging of TSCH with a protocol stack |
| 257 |
based on IPv6, 6LoWPAN, and RPL. |
| 258 |
|
| 259 |
<span class="h2"><a class="selflink" id="section-2" href="#section-2">2</a>. TSCH in the LLN Context</span> |
| 260 |
|
| 261 |
To map the services required by the IP layer to the services provided |
| 262 |
by the link layer, an adaptation layer is used |
| 263 |
[<a href="#ref-Palattella12standardized">Palattella12standardized</a>]. In 2007, the 6LoWPAN WG started working |
| 264 |
on specifications for transmitting IPv6 packets over IEEE 802.15.4 |
| 265 |
networks [<a href="./rfc4919" title=""IPv6 over Low-Power Wireless Personal Area Networks (6LoWPANs): Overview, Assumptions, Problem Statement, and Goals"">RFC4919</a>]. A low-power Wireless Personal Area Network |
| 266 |
(WPAN) is typically composed of a large number of battery-powered |
| 267 |
devices that are deployed at locations that are unknown a priori. |
| 268 |
Nodes form a star or a mesh topology and communicate with one another |
| 269 |
at a low datarate and using short frames. The wireless nature of the |
| 270 |
links means that they are unreliable in nature. Nodes turn off their |
| 271 |
radio interface most of the time to conserve energy. Given these |
| 272 |
|
| 273 |
|
| 274 |
|
| 275 |
|
| 276 |
<span class="grey">Watteyne, et al. Informational [Page 5]</span></pre> |
| 277 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-6" ></span> |
| 278 |
<span class="grey"><a href="./rfc7554">RFC 7554</a> 6TiSCH-TSCH May 2015</span> |
| 279 |
|
| 280 |
|
| 281 |
features, it is clear that the adoption of IPv6 on top of a low-power |
| 282 |
WPAN is not straightforward but poses strong requirements for the |
| 283 |
optimization of this adaptation layer. |
| 284 |
|
| 285 |
For instance, due to the IPv6 default minimum MTU size (1280 bytes), |
| 286 |
an unfragmented IPv6 packet is too large to fit in an IEEE 802.15.4 |
| 287 |
frame. Moreover, the overhead due to the 40-byte-long IPv6 header |
| 288 |
wastes the scarce bandwidth available at the PHY layer [<a href="./rfc4944" title=""Transmission of IPv6 Packets over IEEE 802.15.4 Networks"">RFC4944</a>]. |
| 289 |
For these reasons, the 6LoWPAN WG has defined an effective adaptation |
| 290 |
layer [<a href="./rfc6282" title=""Compression Format for IPv6 Datagrams over IEEE 802.15.4-Based Networks"">RFC6282</a>]. Further issues encompass the autoconfiguration of |
| 291 |
IPv6 addresses [<a href="./rfc2460" title=""Internet Protocol, Version 6 (IPv6) Specification"">RFC2460</a>] [<a href="./rfc4862" title=""IPv6 Stateless Address Autoconfiguration"">RFC4862</a>], the compliance with the |
| 292 |
recommendation on supporting link-layer subnet broadcast in shared |
| 293 |
networks [<a href="./rfc3819" title=""Advice for Internet Subnetwork Designers"">RFC3819</a>], the reduction of routing and management overhead |
| 294 |
[<a href="./rfc6606" title=""Problem Statement and Requirements for IPv6 over Low-Power Wireless Personal Area Network (6LoWPAN) Routing"">RFC6606</a>], the adoption of lightweight application protocols (or |
| 295 |
novel data encoding techniques), and the support for security |
| 296 |
mechanisms (confidentiality and integrity protection, device |
| 297 |
bootstrapping, key establishment, and management). |
| 298 |
|
| 299 |
These features can run on top of TSCH. There are, however, important |
| 300 |
issues to solve, as highlighted in <a href="#section-3">Section 3</a>. |
| 301 |
|
| 302 |
Routing issues are challenging for 6LoWPAN, given the low-power and |
| 303 |
lossy radio links, the battery-powered nodes, the multi-hop mesh |
| 304 |
topologies, and the frequent topology changes due to mobility. |
| 305 |
Successful solutions take into account the specific application |
| 306 |
requirements, along with IPv6 behavior and 6LoWPAN mechanisms |
| 307 |
[<a href="#ref-Palattella12standardized">Palattella12standardized</a>]. The ROLL WG has defined RPL in |
| 308 |
[<a href="./rfc6550" title=""RPL: IPv6 Routing Protocol for Low-Power and Lossy Networks"">RFC6550</a>]. RPL can support a wide variety of link layers, including |
| 309 |
ones that are constrained, potentially lossy, or typically utilized |
| 310 |
in conjunction with host or router devices with very limited |
| 311 |
resources, as in building/home automation [<a href="./rfc5867" title=""Building Automation Routing Requirements in Low-Power and Lossy Networks"">RFC5867</a>] [<a href="./rfc5826" title=""Home Automation Routing Requirements in Low-Power and Lossy Networks"">RFC5826</a>], |
| 312 |
industrial environments [<a href="./rfc5673" title=""Industrial Routing Requirements in Low-Power and Lossy Networks"">RFC5673</a>], and urban applications [<a href="./rfc5548" title=""Routing Requirements for Urban Low-Power and Lossy Networks"">RFC5548</a>]. |
| 313 |
RPL is able to quickly build up network routes, distribute routing |
| 314 |
knowledge among nodes, and adapt to a changing topology. In a |
| 315 |
typical setting, nodes are connected through multi-hop paths to a |
| 316 |
small set of root devices, which are usually responsible for data |
| 317 |
collection and coordination. For each of them, a Destination- |
| 318 |
Oriented Directed Acyclic Graph (DODAG) is created by accounting for |
| 319 |
link costs, node attributes/status information, and an Objective |
| 320 |
Function, which maps the optimization requirements of the target |
| 321 |
scenario. |
| 322 |
|
| 323 |
The topology is set up based on a Rank metric, which encodes the |
| 324 |
distance of each node with respect to its reference root, as |
| 325 |
specified by the Objective Function. Regardless of the way it is |
| 326 |
computed, the Rank monotonically decreases along the DODAG towards |
| 327 |
the root, building a gradient. RPL encompass different kinds of |
| 328 |
traffic and signaling information. Multipoint-to-Point (MP2P) is the |
| 329 |
|
| 330 |
|
| 331 |
|
| 332 |
<span class="grey">Watteyne, et al. Informational [Page 6]</span></pre> |
| 333 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-7" ></span> |
| 334 |
<span class="grey"><a href="./rfc7554">RFC 7554</a> 6TiSCH-TSCH May 2015</span> |
| 335 |
|
| 336 |
|
| 337 |
dominant traffic in LLN applications. Data is routed towards nodes |
| 338 |
with some application relevance, such as the LLN gateway to the |
| 339 |
larger Internet or to the core of private IP networks. In general, |
| 340 |
these destinations are the DODAG roots and act as data collection |
| 341 |
points for distributed monitoring applications. Point-to-Multipoint |
| 342 |
(P2MP) data streams are used for actuation purposes, where messages |
| 343 |
are sent from DODAG roots to destination nodes. Point-to-Point (P2P) |
| 344 |
traffic allows communication between two devices belonging to the |
| 345 |
same LLN, such as a sensor and an actuator. A packet flows from the |
| 346 |
source to the common ancestor of those two communicating devices, |
| 347 |
then downward towards the destination. Therefore, RPL has to |
| 348 |
discover both upward routes (i.e., from nodes to DODAG roots) in |
| 349 |
order to enable MP2P and P2P flows and downward routes (i.e., from |
| 350 |
DODAG roots to nodes) to support P2MP and P2P traffic. |
| 351 |
|
| 352 |
<a href="#section-3">Section 3</a> highlights the challenges that need to be addressed to use |
| 353 |
RPL on top of TSCH. |
| 354 |
|
| 355 |
Open-source initiatives have emerged around TSCH, with the OpenWSN |
| 356 |
project [<a href="#ref-OpenWSN" title=""Berkeley's OpenWSN Project Homepage"">OpenWSN</a>] [<a href="#ref-OpenWSNETT">OpenWSNETT</a>] being the first open-source |
| 357 |
implementation of a standards-based protocol stack. This |
| 358 |
implementation was used as the foundation for an IP for the Smart |
| 359 |
Objects Alliance (IPSO) [<a href="#ref-IPSO" title=""IP for Smart Objects Alliance Homepage"">IPSO</a>] interoperability event in 2011. In |
| 360 |
the absence of a standardized scheduling mechanism for TSCH, a |
| 361 |
"slotted Aloha" schedule was used. |
| 362 |
|
| 363 |
<span class="h2"><a class="selflink" id="section-3" href="#section-3">3</a>. Problems and Goals</span> |
| 364 |
|
| 365 |
As highlighted in <a href="#appendix-A">Appendix A</a>, TSCH differs from other low-power MAC |
| 366 |
protocols because of its scheduled nature. TSCH defines the |
| 367 |
mechanisms to execute a communication schedule; yet, it is the entity |
| 368 |
that sets up the schedule that controls the topology of the network. |
| 369 |
This scheduling entity also controls the resources allocated to each |
| 370 |
link in that topology. |
| 371 |
|
| 372 |
How this entity should operate is out of scope of TSCH. The |
| 373 |
remainder of this section highlights the problems this entity needs |
| 374 |
to address. For simplicity, we refer to this entity by the generic |
| 375 |
name "LLC". Note that the 6top sublayer, currently being defined in |
| 376 |
[<a href="#ref-SUBLAYER-6top">SUBLAYER-6top</a>], can be seen as an embodiment of this generic "LLC". |
| 377 |
|
| 378 |
Some of the issues the LLC needs to target might overlap with the |
| 379 |
scope of other protocols (e.g., 6LoWPAN, RPL, and RSVP). In this |
| 380 |
case, the LLC will profit from the services provided by other |
| 381 |
protocols to pursue these objectives. |
| 382 |
|
| 383 |
|
| 384 |
|
| 385 |
|
| 386 |
|
| 387 |
|
| 388 |
<span class="grey">Watteyne, et al. Informational [Page 7]</span></pre> |
| 389 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-8" ></span> |
| 390 |
<span class="grey"><a href="./rfc7554">RFC 7554</a> 6TiSCH-TSCH May 2015</span> |
| 391 |
|
| 392 |
|
| 393 |
<span class="h3"><a class="selflink" id="section-3.1" href="#section-3.1">3.1</a>. Network Formation</span> |
| 394 |
|
| 395 |
The LLC needs to control the way the network is formed, including how |
| 396 |
new nodes join and how already joined nodes advertise the presence of |
| 397 |
the network. The LLC needs to: |
| 398 |
|
| 399 |
1. Define the Information Elements included in the Enhanced Beacons |
| 400 |
(EBs) [<a href="#ref-IEEE.802.15.4e">IEEE.802.15.4e</a>] advertising the presence of the network. |
| 401 |
|
| 402 |
2. (For a new node), define rules to process and filter received |
| 403 |
EBs. |
| 404 |
|
| 405 |
3. Define the joining procedure. This might include a mechanism to |
| 406 |
assign a unique 16-bit address to a node and the management of |
| 407 |
initial keying material. |
| 408 |
|
| 409 |
4. Define a mechanism to secure the joining process and the |
| 410 |
subsequent optional process of scheduling more communication |
| 411 |
cells. |
| 412 |
|
| 413 |
<span class="h3"><a class="selflink" id="section-3.2" href="#section-3.2">3.2</a>. Network Maintenance</span> |
| 414 |
|
| 415 |
Once a network is formed, the LLC needs to maintain the network's |
| 416 |
health, allowing for nodes to stay synchronized. The LLC needs to: |
| 417 |
|
| 418 |
1. Manage each node's time source neighbor. |
| 419 |
|
| 420 |
2. Define a mechanism for a node to update the join priority it |
| 421 |
announces in its EB. |
| 422 |
|
| 423 |
3. Schedule transmissions of EBs to advertise the presence of the |
| 424 |
network. |
| 425 |
|
| 426 |
<span class="h3"><a class="selflink" id="section-3.3" href="#section-3.3">3.3</a>. Multi-Hop Topology</span> |
| 427 |
|
| 428 |
RPL, given a weighted connectivity graph, determines multi-hop |
| 429 |
routes. The LLC needs to: |
| 430 |
|
| 431 |
1. Define a mechanism to gather topological information, node and |
| 432 |
link state, which it can then feed to RPL. |
| 433 |
|
| 434 |
2. Ensure that the TSCH schedule contains cells along the multi-hop |
| 435 |
routes identified by RPL (a cell in a TSCH schedule is an atomic |
| 436 |
"unit" of resource, see <a href="#section-3.5">Section 3.5</a>). |
| 437 |
|
| 438 |
3. Where applicable, maintain independent sets of cells to transport |
| 439 |
independent flows of data. |
| 440 |
|
| 441 |
|
| 442 |
|
| 443 |
|
| 444 |
<span class="grey">Watteyne, et al. Informational [Page 8]</span></pre> |
| 445 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-9" ></span> |
| 446 |
<span class="grey"><a href="./rfc7554">RFC 7554</a> 6TiSCH-TSCH May 2015</span> |
| 447 |
|
| 448 |
|
| 449 |
<span class="h3"><a class="selflink" id="section-3.4" href="#section-3.4">3.4</a>. Routing and Timing Parents</span> |
| 450 |
|
| 451 |
At all times, a TSCH node needs to have a time-source neighbor to |
| 452 |
which it can synchronize. Therefore, LLC needs to assign a time- |
| 453 |
source neighbor to allow for correct operation of the TSCH network. |
| 454 |
A time-source neighbor could, or not, be taken from the RPL routing |
| 455 |
parent set. |
| 456 |
|
| 457 |
<span class="h3"><a class="selflink" id="section-3.5" href="#section-3.5">3.5</a>. Resource Management</span> |
| 458 |
|
| 459 |
A cell in a TSCH schedule is an atomic "unit" of resource. The |
| 460 |
number of cells to assign between neighbor nodes needs to be |
| 461 |
appropriate for the size of the traffic flow. The LLC needs to: |
| 462 |
|
| 463 |
1. Define a mechanism for neighbor nodes to exchange information |
| 464 |
about their schedule and, if applicable, negotiate the addition/ |
| 465 |
deletion of cells. |
| 466 |
|
| 467 |
2. Allow for an entity (e.g., a set of devices, a distributed |
| 468 |
protocol, a Path Computation Element (PCE), etc.) to take control |
| 469 |
of the schedule. |
| 470 |
|
| 471 |
<span class="h3"><a class="selflink" id="section-3.6" href="#section-3.6">3.6</a>. Dataflow Control</span> |
| 472 |
|
| 473 |
TSCH defines mechanisms for a node to signal when it cannot accept an |
| 474 |
incoming packet. It does not, however, define the policy that |
| 475 |
determines when to stop accepting packets. The LLC needs to: |
| 476 |
|
| 477 |
1. Allow for the implementation and configuration of policy to queue |
| 478 |
incoming and outgoing packets. |
| 479 |
|
| 480 |
2. Manage the buffer space, and indicate to TSCH when to stop |
| 481 |
accepting incoming packets. |
| 482 |
|
| 483 |
3. Handle transmissions that have failed. A transmission is |
| 484 |
declared failed when TSCH has retransmitted the packet multiple |
| 485 |
times, without receiving an acknowledgment. This covers both |
| 486 |
dedicated and shared cells. |
| 487 |
|
| 488 |
<span class="h3"><a class="selflink" id="section-3.7" href="#section-3.7">3.7</a>. Deterministic Behavior</span> |
| 489 |
|
| 490 |
As highlighted in [<a href="./rfc5673" title=""Industrial Routing Requirements in Low-Power and Lossy Networks"">RFC5673</a>], in some applications, data is generated |
| 491 |
periodically and has a well-understood data bandwidth requirement, |
| 492 |
which is deterministic and predictable. The LLC needs to: |
| 493 |
|
| 494 |
1. Ensure that the data is delivered to its final destination before |
| 495 |
a deadline possibly determined by the application. |
| 496 |
|
| 497 |
|
| 498 |
|
| 499 |
|
| 500 |
<span class="grey">Watteyne, et al. Informational [Page 9]</span></pre> |
| 501 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-10" ></span> |
| 502 |
<span class="grey"><a href="./rfc7554">RFC 7554</a> 6TiSCH-TSCH May 2015</span> |
| 503 |
|
| 504 |
|
| 505 |
2. Provide a mechanism for such deterministic flows to coexist with |
| 506 |
bursty or infrequent traffic flows of different priorities. |
| 507 |
|
| 508 |
<span class="h3"><a class="selflink" id="section-3.8" href="#section-3.8">3.8</a>. Scheduling Mechanisms</span> |
| 509 |
|
| 510 |
Several scheduling mechanisms can be envisioned and could possibly |
| 511 |
coexist in the same network. For example, [<a href="#ref-RPL" title=""RPL applicability in industrial networks"">RPL</a>] describes how the |
| 512 |
allocation of bandwidth can be optimized by an external PCE |
| 513 |
[<a href="./rfc4655" title=""A Path Computation Element (PCE)-Based Architecture"">RFC4655</a>]. Another centralized (PCE-based) traffic-aware scheduling |
| 514 |
algorithm is defined in [<a href="#ref-TASA-PIMRC">TASA-PIMRC</a>]. Alternatively, two neighbor |
| 515 |
nodes can adapt the number of cells autonomously by monitoring the |
| 516 |
amount of traffic and negotiating the allocation to extra cell when |
| 517 |
needed. An example of a decentralized algorithm (i.e., no PCE is |
| 518 |
needed) is provided in [<a href="#ref-Tinka10decentralized">Tinka10decentralized</a>]. This mechanism can be |
| 519 |
used to establish multi-hop paths in a fashion similar to RSVP |
| 520 |
[<a href="./rfc2205" title=""Resource ReSerVation Protocol (RSVP) -- Version 1 Functional Specification"">RFC2205</a>]. The LLC needs to: |
| 521 |
|
| 522 |
1. Provide a mechanism for two devices to negotiate the allocation |
| 523 |
and deallocation of cells between them. |
| 524 |
|
| 525 |
2. Provide a mechanism for the device to monitor and manage the |
| 526 |
capabilities of a node several hops away. |
| 527 |
|
| 528 |
3. Define a mechanism for these different scheduling mechanisms to |
| 529 |
coexist in the same network. |
| 530 |
|
| 531 |
<span class="h3"><a class="selflink" id="section-3.9" href="#section-3.9">3.9</a>. Secure Communication</span> |
| 532 |
|
| 533 |
Given some keying material, TSCH defines mechanisms to encrypt and |
| 534 |
authenticate MAC frames. It does not define how this keying material |
| 535 |
is generated. The LLC needs to: |
| 536 |
|
| 537 |
1. Define the keying material and authentication mechanism needed by |
| 538 |
a new node to join an existing network. |
| 539 |
|
| 540 |
2. Define a mechanism to allow for the secure transfer of |
| 541 |
application data between neighbor nodes. |
| 542 |
|
| 543 |
3. Define a mechanism to allow for the secure transfer of signaling |
| 544 |
data between nodes and the LLC. |
| 545 |
|
| 546 |
|
| 547 |
|
| 548 |
|
| 549 |
|
| 550 |
|
| 551 |
|
| 552 |
|
| 553 |
|
| 554 |
|
| 555 |
|
| 556 |
<span class="grey">Watteyne, et al. Informational [Page 10]</span></pre> |
| 557 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-11" ></span> |
| 558 |
<span class="grey"><a href="./rfc7554">RFC 7554</a> 6TiSCH-TSCH May 2015</span> |
| 559 |
|
| 560 |
|
| 561 |
<span class="h2"><a class="selflink" id="section-4" href="#section-4">4</a>. Security Considerations</span> |
| 562 |
|
| 563 |
This memo is an informational overview of existing standards and does |
| 564 |
not define any new mechanisms or protocols. |
| 565 |
|
| 566 |
It does describe the need for the 6TiSCH WG to define a secure |
| 567 |
solution. In particular, <a href="#section-3.1">Section 3.1</a> describes security in the join |
| 568 |
process. <a href="#section-3.9">Section 3.9</a> discusses data-frame protection. |
| 569 |
|
| 570 |
<span class="h2"><a class="selflink" id="section-5" href="#section-5">5</a>. References</span> |
| 571 |
|
| 572 |
<span class="h3"><a class="selflink" id="section-5.1" href="#section-5.1">5.1</a>. Normative References</span> |
| 573 |
|
| 574 |
[<a id="ref-IEEE.802.15.4">IEEE.802.15.4</a>] |
| 575 |
IEEE, "IEEE Standard for Local and metropolitan area |
| 576 |
networks -- Part. 15.4: Low-Rate Wireless Personal Area |
| 577 |
Networks", IEEE Std. 802.15.4-2011, September 2011. |
| 578 |
|
| 579 |
[<a id="ref-IEEE.802.15.4e">IEEE.802.15.4e</a>] |
| 580 |
IEEE, "IEEE Standard for Local and metropolitan area |
| 581 |
networks -- Part 15.4: Low-Rate Wireless Personal Area |
| 582 |
Networks (LR-WPANs) Amendment 1: MAC sublayer", IEEE Std. |
| 583 |
802.15.4e-2012, April 2012. |
| 584 |
|
| 585 |
<span class="h3"><a class="selflink" id="section-5.2" href="#section-5.2">5.2</a>. Informative References</span> |
| 586 |
|
| 587 |
[<a id="ref-CurrentCalculator">CurrentCalculator</a>] |
| 588 |
Linear Technology, "Application Note: Using the Current |
| 589 |
Calculator to Estimate Mote Power", August 2012, |
| 590 |
<<a href="http://www.linear.com/docs/43189">http://www.linear.com/docs/43189</a>>. |
| 591 |
|
| 592 |
[<a id="ref-Doherty07channel">Doherty07channel</a>] |
| 593 |
Doherty, L., Lindsay, W., and J. Simon, "Channel-Specific |
| 594 |
Wireless Sensor Network Path Data", IEEE International |
| 595 |
Conference on Computer Communications and Networks |
| 596 |
(ICCCN), pp. 89-94, 2007. |
| 597 |
|
| 598 |
[<a id="ref-IPSO">IPSO</a>] IPSO Alliance, "IP for Smart Objects Alliance Homepage", |
| 599 |
<<a href="http://www.ipso-alliance.org/">http://www.ipso-alliance.org/</a>>. |
| 600 |
|
| 601 |
[<a id="ref-OpenWSN">OpenWSN</a>] "Berkeley's OpenWSN Project Homepage", |
| 602 |
<<a href="http://www.openwsn.org/">http://www.openwsn.org/</a>>. |
| 603 |
|
| 604 |
|
| 605 |
|
| 606 |
|
| 607 |
|
| 608 |
|
| 609 |
|
| 610 |
|
| 611 |
|
| 612 |
<span class="grey">Watteyne, et al. Informational [Page 11]</span></pre> |
| 613 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-12" ></span> |
| 614 |
<span class="grey"><a href="./rfc7554">RFC 7554</a> 6TiSCH-TSCH May 2015</span> |
| 615 |
|
| 616 |
|
| 617 |
[<a id="ref-OpenWSNETT">OpenWSNETT</a>] |
| 618 |
Watteyne, T., Vilajosana, X., Kerkez, B., Chraim, F., |
| 619 |
Weekly, K., Wang, Q., Glaser, S., and K. Pister, "OpenWSN: |
| 620 |
A Standards-Based Low-Power Wireless Development |
| 621 |
Environment", Transactions on Emerging Telecommunications |
| 622 |
Technologies, Volume 23: Issue 5, August 2012. |
| 623 |
|
| 624 |
[<a id="ref-Palattella12standardized">Palattella12standardized</a>] |
| 625 |
Palattella, MR., Accettura, N., Vilajosana, X., Watteyne, |
| 626 |
T., Grieco, LA., Boggia, G., and M. Dohler, "Standardized |
| 627 |
Protocol Stack For The Internet Of (Important) Things", |
| 628 |
IEEE Communications Surveys and Tutorials, Volume: 15, |
| 629 |
Issue 3, December 2012. |
| 630 |
|
| 631 |
[<a id="ref-RFC2205">RFC2205</a>] Braden, R., Ed., Zhang, L., Berson, S., Herzog, S., and S. |
| 632 |
Jamin, "Resource ReSerVation Protocol (RSVP) -- Version 1 |
| 633 |
Functional Specification", <a href="./rfc2205">RFC 2205</a>, DOI 10.17487/RFC2205, |
| 634 |
September 1997, <<a href="http://www.rfc-editor.org/info/rfc2205">http://www.rfc-editor.org/info/rfc2205</a>>. |
| 635 |
|
| 636 |
[<a id="ref-RFC2460">RFC2460</a>] Deering, S. and R. Hinden, "Internet Protocol, Version 6 |
| 637 |
(IPv6) Specification", <a href="./rfc2460">RFC 2460</a>, DOI 10.17487/RFC2460, |
| 638 |
December 1998, <<a href="http://www.rfc-editor.org/info/rfc2460">http://www.rfc-editor.org/info/rfc2460</a>>. |
| 639 |
|
| 640 |
[<a id="ref-RFC3819">RFC3819</a>] Karn, P., Ed., Bormann, C., Fairhurst, G., Grossman, D., |
| 641 |
Ludwig, R., Mahdavi, J., Montenegro, G., Touch, J., and L. |
| 642 |
Wood, "Advice for Internet Subnetwork Designers", <a href="https://www.rfc-editor.org/bcp/bcp89">BCP 89</a>, |
| 643 |
<a href="./rfc3819">RFC 3819</a>, DOI 10.17487/RFC3819, July 2004, |
| 644 |
<<a href="http://www.rfc-editor.org/info/rfc3819">http://www.rfc-editor.org/info/rfc3819</a>>. |
| 645 |
|
| 646 |
[<a id="ref-RFC4655">RFC4655</a>] Farrel, A., Vasseur, J., and J. Ash, "A Path Computation |
| 647 |
Element (PCE)-Based Architecture", <a href="./rfc4655">RFC 4655</a>, |
| 648 |
DOI 10.17487/RFC4655, August 2006, |
| 649 |
<<a href="http://www.rfc-editor.org/info/rfc4655">http://www.rfc-editor.org/info/rfc4655</a>>. |
| 650 |
|
| 651 |
[<a id="ref-RFC4862">RFC4862</a>] Thomson, S., Narten, T., and T. Jinmei, "IPv6 Stateless |
| 652 |
Address Autoconfiguration", <a href="./rfc4862">RFC 4862</a>, |
| 653 |
DOI 10.17487/RFC4862, September 2007, |
| 654 |
<<a href="http://www.rfc-editor.org/info/rfc4862">http://www.rfc-editor.org/info/rfc4862</a>>. |
| 655 |
|
| 656 |
[<a id="ref-RFC4919">RFC4919</a>] Kushalnagar, N., Montenegro, G., and C. Schumacher, "IPv6 |
| 657 |
over Low-Power Wireless Personal Area Networks (6LoWPANs): |
| 658 |
Overview, Assumptions, Problem Statement, and Goals", |
| 659 |
<a href="./rfc4919">RFC 4919</a>, DOI 10.17487/RFC4919, August 2007, |
| 660 |
<<a href="http://www.rfc-editor.org/info/rfc4919">http://www.rfc-editor.org/info/rfc4919</a>>. |
| 661 |
|
| 662 |
|
| 663 |
|
| 664 |
|
| 665 |
|
| 666 |
|
| 667 |
|
| 668 |
<span class="grey">Watteyne, et al. Informational [Page 12]</span></pre> |
| 669 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-13" ></span> |
| 670 |
<span class="grey"><a href="./rfc7554">RFC 7554</a> 6TiSCH-TSCH May 2015</span> |
| 671 |
|
| 672 |
|
| 673 |
[<a id="ref-RFC4944">RFC4944</a>] Montenegro, G., Kushalnagar, N., Hui, J., and D. Culler, |
| 674 |
"Transmission of IPv6 Packets over IEEE 802.15.4 |
| 675 |
Networks", <a href="./rfc4944">RFC 4944</a>, DOI 10.17487/RFC4944, September 2007, |
| 676 |
<<a href="http://www.rfc-editor.org/info/rfc4944">http://www.rfc-editor.org/info/rfc4944</a>>. |
| 677 |
|
| 678 |
[<a id="ref-RFC5548">RFC5548</a>] Dohler, M., Ed., Watteyne, T., Ed., Winter, T., Ed., and |
| 679 |
D. Barthel, Ed., "Routing Requirements for Urban Low-Power |
| 680 |
and Lossy Networks", <a href="./rfc5548">RFC 5548</a>, DOI 10.17487/RFC5548, May |
| 681 |
2009, <<a href="http://www.rfc-editor.org/info/rfc5548">http://www.rfc-editor.org/info/rfc5548</a>>. |
| 682 |
|
| 683 |
[<a id="ref-RFC5673">RFC5673</a>] Pister, K., Ed., Thubert, P., Ed., Dwars, S., and T. |
| 684 |
Phinney, "Industrial Routing Requirements in Low-Power and |
| 685 |
Lossy Networks", <a href="./rfc5673">RFC 5673</a>, DOI 10.17487/RFC5673, October |
| 686 |
2009, <<a href="http://www.rfc-editor.org/info/rfc5673">http://www.rfc-editor.org/info/rfc5673</a>>. |
| 687 |
|
| 688 |
[<a id="ref-RFC5826">RFC5826</a>] Brandt, A., Buron, J., and G. Porcu, "Home Automation |
| 689 |
Routing Requirements in Low-Power and Lossy Networks", |
| 690 |
<a href="./rfc5826">RFC 5826</a>, DOI 10.17487/RFC5826, April 2010, |
| 691 |
<<a href="http://www.rfc-editor.org/info/rfc5826">http://www.rfc-editor.org/info/rfc5826</a>>. |
| 692 |
|
| 693 |
[<a id="ref-RFC5867">RFC5867</a>] Martocci, J., Ed., De Mil, P., Riou, N., and W. Vermeylen, |
| 694 |
"Building Automation Routing Requirements in Low-Power and |
| 695 |
Lossy Networks", <a href="./rfc5867">RFC 5867</a>, DOI 10.17487/RFC5867, June |
| 696 |
2010, <<a href="http://www.rfc-editor.org/info/rfc5867">http://www.rfc-editor.org/info/rfc5867</a>>. |
| 697 |
|
| 698 |
[<a id="ref-RFC6282">RFC6282</a>] Hui, J., Ed. and P. Thubert, "Compression Format for IPv6 |
| 699 |
Datagrams over IEEE 802.15.4-Based Networks", <a href="./rfc6282">RFC 6282</a>, |
| 700 |
DOI 10.17487/RFC6282, September 2011, |
| 701 |
<<a href="http://www.rfc-editor.org/info/rfc6282">http://www.rfc-editor.org/info/rfc6282</a>>. |
| 702 |
|
| 703 |
[<a id="ref-RFC6550">RFC6550</a>] Winter, T., Ed., Thubert, P., Ed., Brandt, A., Hui, J., |
| 704 |
Kelsey, R., Levis, P., Pister, K., Struik, R., Vasseur, |
| 705 |
JP., and R. Alexander, "RPL: IPv6 Routing Protocol for |
| 706 |
Low-Power and Lossy Networks", <a href="./rfc6550">RFC 6550</a>, |
| 707 |
DOI 10.17487/RFC6550, March 2012, |
| 708 |
<<a href="http://www.rfc-editor.org/info/rfc6550">http://www.rfc-editor.org/info/rfc6550</a>>. |
| 709 |
|
| 710 |
[<a id="ref-RFC6606">RFC6606</a>] Kim, E., Kaspar, D., Gomez, C., and C. Bormann, "Problem |
| 711 |
Statement and Requirements for IPv6 over Low-Power |
| 712 |
Wireless Personal Area Network (6LoWPAN) Routing", |
| 713 |
<a href="./rfc6606">RFC 6606</a>, DOI 10.17487/RFC6606, May 2012, |
| 714 |
<<a href="http://www.rfc-editor.org/info/rfc6606">http://www.rfc-editor.org/info/rfc6606</a>>. |
| 715 |
|
| 716 |
[<a id="ref-RFC7102">RFC7102</a>] Vasseur, JP., "Terms Used in Routing for Low-Power and |
| 717 |
Lossy Networks", <a href="./rfc7102">RFC 7102</a>, DOI 10.17487/RFC7102, January |
| 718 |
2014, <<a href="http://www.rfc-editor.org/info/rfc7102">http://www.rfc-editor.org/info/rfc7102</a>>. |
| 719 |
|
| 720 |
|
| 721 |
|
| 722 |
|
| 723 |
|
| 724 |
<span class="grey">Watteyne, et al. Informational [Page 13]</span></pre> |
| 725 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-14" ></span> |
| 726 |
<span class="grey"><a href="./rfc7554">RFC 7554</a> 6TiSCH-TSCH May 2015</span> |
| 727 |
|
| 728 |
|
| 729 |
[<a id="ref-RFC7228">RFC7228</a>] Bormann, C., Ersue, M., and A. Keranen, "Terminology for |
| 730 |
Constrained-Node Networks", <a href="./rfc7228">RFC 7228</a>, |
| 731 |
DOI 10.17487/RFC7228, May 2014, |
| 732 |
<<a href="http://www.rfc-editor.org/info/rfc7228">http://www.rfc-editor.org/info/rfc7228</a>>. |
| 733 |
|
| 734 |
[<a id="ref-RFC7252">RFC7252</a>] Shelby, Z., Hartke, K., and C. Bormann, "The Constrained |
| 735 |
Application Protocol (CoAP)", <a href="./rfc7252">RFC 7252</a>, |
| 736 |
DOI 10.17487/RFC7252, June 2014, |
| 737 |
<<a href="http://www.rfc-editor.org/info/rfc7252">http://www.rfc-editor.org/info/rfc7252</a>>. |
| 738 |
|
| 739 |
[<a id="ref-RPL">RPL</a>] Phinney, T., Thubert, P., and R. Assimiti, "RPL |
| 740 |
applicability in industrial networks", Work in Progress, |
| 741 |
<a href="./draft-ietf-roll-rpl-industrial-applicability-02">draft-ietf-roll-rpl-industrial-applicability-02</a>, October |
| 742 |
2013. |
| 743 |
|
| 744 |
[<a id="ref-SUBLAYER-6top">SUBLAYER-6top</a>] |
| 745 |
Wang, Q., Vilajosana, X., and T. Watteyne, "6TiSCH |
| 746 |
Operation Sublayer (6top)", Work in Progress, <a href="./draft-wang-6tisch-6top-sublayer-01">draft-wang-</a> |
| 747 |
<a href="./draft-wang-6tisch-6top-sublayer-01">6tisch-6top-sublayer-01</a>, July 2014. |
| 748 |
|
| 749 |
[<a id="ref-TASA-PIMRC">TASA-PIMRC</a>] |
| 750 |
Palattella, MR., Accettura, N., Dohler, M., Grieco, LA., |
| 751 |
and G. Boggia, "Traffic Aware Scheduling Algorithm for |
| 752 |
reliable low-power multi-hop IEEE 802.15.4e networks", |
| 753 |
IEEE 23rd International Symposium on Personal, Indoor and |
| 754 |
Mobile Radio Communications (PIMRC), pp. 327-332, |
| 755 |
September 2012. |
| 756 |
|
| 757 |
[<a id="ref-TERMS-6TISCH">TERMS-6TISCH</a>] |
| 758 |
Palattella, M., Thubert, P., Watteyne, T., and Q. Wang, |
| 759 |
"Terminology in IPv6 over the TSCH mode of IEEE |
| 760 |
802.15.4e", Work in Progress, <a href="./draft-ietf-6tisch-terminology-04">draft-ietf-6tisch-</a> |
| 761 |
<a href="./draft-ietf-6tisch-terminology-04">terminology-04</a>, March 2015. |
| 762 |
|
| 763 |
[<a id="ref-Tinka10decentralized">Tinka10decentralized</a>] |
| 764 |
Tinka, A., Watteyne, T., and K. Pister, "A Decentralized |
| 765 |
Scheduling Algorithm for Time Synchronized Channel |
| 766 |
Hopping", Ad Hoc Networks, 2010. |
| 767 |
|
| 768 |
[<a id="ref-Watteyne09reliability">Watteyne09reliability</a>] |
| 769 |
Watteyne, T., Mehta, A., and K. Pister, "Reliability |
| 770 |
Through Frequency Diversity: Why Channel Hopping Makes |
| 771 |
Sense", Proceedings of the 6th ACM Symposium on |
| 772 |
Performance Evaluation of Wireless Ad Hoc, Sensor, and |
| 773 |
Ubiquitous Networks (PE-WASUN), pp. 116-123, October 2009. |
| 774 |
|
| 775 |
|
| 776 |
|
| 777 |
|
| 778 |
|
| 779 |
|
| 780 |
<span class="grey">Watteyne, et al. Informational [Page 14]</span></pre> |
| 781 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-15" ></span> |
| 782 |
<span class="grey"><a href="./rfc7554">RFC 7554</a> 6TiSCH-TSCH May 2015</span> |
| 783 |
|
| 784 |
|
| 785 |
<span class="h2"><a class="selflink" id="appendix-A" href="#appendix-A">Appendix A</a>. TSCH Protocol Highlights</span> |
| 786 |
|
| 787 |
This appendix gives an overview of the key features of the IEEE |
| 788 |
802.15.4e TSCH amendment. It makes no attempt at repeating the |
| 789 |
standard, rather it focuses on the following: |
| 790 |
|
| 791 |
o Concepts that are sufficiently different from other IEEE 802.15.4 |
| 792 |
networking that they may need to be defined and presented |
| 793 |
precisely. |
| 794 |
|
| 795 |
o Techniques and ideas that are part of IEEE 802.15.4e and that |
| 796 |
might be useful for the work of the 6TiSCH WG. |
| 797 |
|
| 798 |
<span class="h3"><a class="selflink" id="appendix-A.1" href="#appendix-A.1">A.1</a>. Time Slots</span> |
| 799 |
|
| 800 |
All nodes in a TSCH network are synchronized. Time is sliced up into |
| 801 |
time slots. A time slot is long enough for a MAC frame of maximum |
| 802 |
size to be sent from node A to node B, and for node B to reply with |
| 803 |
an acknowledgment (ACK) frame indicating successful reception. |
| 804 |
|
| 805 |
The duration of a time slot is not defined by the standard. With |
| 806 |
radios that are compliant with IEEE 802.15.4 operating in the 2.4 GHz |
| 807 |
frequency band, a maximum-length frame of 127 bytes takes about 4 ms |
| 808 |
to transmit; a shorter ACK takes about 1 ms. With a 10 ms slot (a |
| 809 |
typical duration), this leaves 5 ms to radio turnaround, packet |
| 810 |
processing, and security operations. |
| 811 |
|
| 812 |
<span class="h3"><a class="selflink" id="appendix-A.2" href="#appendix-A.2">A.2</a>. Slotframes</span> |
| 813 |
|
| 814 |
Time slots are grouped into one of more slotframes. A slotframe |
| 815 |
continuously repeats over time. TSCH does not impose a slotframe |
| 816 |
size. Depending on the application needs, these can range from 10's |
| 817 |
to 1000's of time slots. The shorter the slotframe, the more often a |
| 818 |
time slot repeats, resulting in more available bandwidth, but also in |
| 819 |
a higher power consumption. |
| 820 |
|
| 821 |
<span class="h3"><a class="selflink" id="appendix-A.3" href="#appendix-A.3">A.3</a>. Node TSCH Schedule</span> |
| 822 |
|
| 823 |
A TSCH schedule instructs each node what to do in each time slot: |
| 824 |
transmit, receive, or sleep. The schedule indicates, for each |
| 825 |
scheduled (transmit or receive) cell, a channelOffset and the address |
| 826 |
of the neighbor with which to communicate. |
| 827 |
|
| 828 |
|
| 829 |
|
| 830 |
|
| 831 |
|
| 832 |
|
| 833 |
|
| 834 |
|
| 835 |
|
| 836 |
<span class="grey">Watteyne, et al. Informational [Page 15]</span></pre> |
| 837 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-16" ></span> |
| 838 |
<span class="grey"><a href="./rfc7554">RFC 7554</a> 6TiSCH-TSCH May 2015</span> |
| 839 |
|
| 840 |
|
| 841 |
Once a node obtains its schedule, it executes it: |
| 842 |
|
| 843 |
o For each transmit cell, the node checks whether there is a packet |
| 844 |
in the outgoing buffer that matches the neighbor written in the |
| 845 |
schedule information for that time slot. If there is none, the |
| 846 |
node keeps its radio off for the duration of the time slot. If |
| 847 |
there is one, the node can ask for the neighbor to acknowledge it, |
| 848 |
in which case it has to listen for the acknowledgment after |
| 849 |
transmitting. |
| 850 |
|
| 851 |
o For each receive cell, the node listens for possible incoming |
| 852 |
packets. If none is received after some listening period, it |
| 853 |
shuts down its radio. If a packet is received, addressed to the |
| 854 |
node, and passes security checks, the node can send back an |
| 855 |
acknowledgment. |
| 856 |
|
| 857 |
How the schedule is built, updated, and maintained, and by which |
| 858 |
entity, is outside of the scope of the IEEE 802.15.4e standard. |
| 859 |
|
| 860 |
<span class="h3"><a class="selflink" id="appendix-A.4" href="#appendix-A.4">A.4</a>. Cells and Bundles</span> |
| 861 |
|
| 862 |
Assuming the schedule is well built, if node A is scheduled to |
| 863 |
transmit to node B at slotOffset 5 and channelOffset 11, node B will |
| 864 |
be scheduled to receive from node A at the same slotOffset and |
| 865 |
channelOffset. |
| 866 |
|
| 867 |
A single element of the schedule characterized by a slotOffset and |
| 868 |
channelOffset, and reserved for node A to transmit to node B (or for |
| 869 |
node B to receive from node A) within a given slotframe, is called a |
| 870 |
"scheduled cell". |
| 871 |
|
| 872 |
If there is a lot of data flowing from node A to node B, the schedule |
| 873 |
might contain multiple cells from A to B, at different times. |
| 874 |
Multiple cells scheduled to the same neighbor can be equivalent, |
| 875 |
i.e., the MAC layer sends the packet on whichever of these cells |
| 876 |
shows up first after the packet was put in the MAC queue. The union |
| 877 |
of all cells between two neighbors, A and B, is called a "bundle". |
| 878 |
Since the slotframe repeats over time (and the length of the |
| 879 |
slotframe is typically constant), each cell gives a "quantum" of |
| 880 |
bandwidth to a given neighbor. Modifying the number of equivalent |
| 881 |
cells in a bundle modifies the amount of resources allocated between |
| 882 |
two neighbors. |
| 883 |
|
| 884 |
|
| 885 |
|
| 886 |
|
| 887 |
|
| 888 |
|
| 889 |
|
| 890 |
|
| 891 |
|
| 892 |
<span class="grey">Watteyne, et al. Informational [Page 16]</span></pre> |
| 893 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-17" ></span> |
| 894 |
<span class="grey"><a href="./rfc7554">RFC 7554</a> 6TiSCH-TSCH May 2015</span> |
| 895 |
|
| 896 |
|
| 897 |
<span class="h3"><a class="selflink" id="appendix-A.5" href="#appendix-A.5">A.5</a>. Dedicated vs. Shared Cells</span> |
| 898 |
|
| 899 |
By default, each scheduled transmit cell within the TSCH schedule is |
| 900 |
dedicated, i.e., reserved only for node A to transmit to node B. |
| 901 |
IEEE 802.15.4e also allows a cell to be marked as shared. In a |
| 902 |
shared cell, multiple nodes can transmit at the same time, on the |
| 903 |
same frequency. To avoid contention, TSCH defines a backoff |
| 904 |
algorithm for shared cells. |
| 905 |
|
| 906 |
A scheduled cell can be marked as both transmitting and receiving. |
| 907 |
In this case, a node transmits if it has an appropriate packet in its |
| 908 |
output buffer, or listens otherwise. Marking a cell as |
| 909 |
[transmit,receive,shared] results in slotted-Aloha behavior. |
| 910 |
|
| 911 |
<span class="h3"><a class="selflink" id="appendix-A.6" href="#appendix-A.6">A.6</a>. Absolute Slot Number</span> |
| 912 |
|
| 913 |
TSCH defines a timeslot counter called Absolute Slot Number (ASN). |
| 914 |
When a new network is created, the ASN is initialized to 0; from then |
| 915 |
on, it increments by 1 at each timeslot. In detail: |
| 916 |
|
| 917 |
ASN = (k*S+t) |
| 918 |
|
| 919 |
where k is the slotframe cycle (i.e., the number of slotframe |
| 920 |
repetitions since the network was started), S the slotframe size, and |
| 921 |
t the slotOffset. A node learns the current ASN when it joins the |
| 922 |
network. Since nodes are synchronized, they all know the current |
| 923 |
value of the ASN, at any time. The ASN is encoded as a 5-byte |
| 924 |
number: this allows it to increment for hundreds of years (the exact |
| 925 |
value depends on the duration of a timeslot) without wrapping over. |
| 926 |
The ASN is used to calculate the frequency to communicate on and can |
| 927 |
be used for security-related operations. |
| 928 |
|
| 929 |
<span class="h3"><a class="selflink" id="appendix-A.7" href="#appendix-A.7">A.7</a>. Channel Hopping</span> |
| 930 |
|
| 931 |
For each scheduled cell, the schedule specifies a slotOffset and a |
| 932 |
channelOffset. In a well-built schedule, when node A has a transmit |
| 933 |
cell to node B on channelOffset 5, node B has a receive cell from |
| 934 |
node A on the same channelOffset. The channelOffset is translated by |
| 935 |
both nodes into a frequency using the following function: |
| 936 |
|
| 937 |
frequency = F {(ASN + channelOffset) mod nFreq} |
| 938 |
|
| 939 |
The function F consists of a lookup table containing the set of |
| 940 |
available channels. The value nFreq (the number of available |
| 941 |
frequencies) is the size of this lookup table. There are as many |
| 942 |
channelOffset values as there are frequencies available (e.g., 16 |
| 943 |
when using radios that are compliant with IEEE 802.15.4 at 2.4 GHz, |
| 944 |
when all channels are used). Since both nodes have the same |
| 945 |
|
| 946 |
|
| 947 |
|
| 948 |
<span class="grey">Watteyne, et al. Informational [Page 17]</span></pre> |
| 949 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-18" ></span> |
| 950 |
<span class="grey"><a href="./rfc7554">RFC 7554</a> 6TiSCH-TSCH May 2015</span> |
| 951 |
|
| 952 |
|
| 953 |
channelOffset written in their schedule for that scheduled cell, and |
| 954 |
the same ASN counter, they compute the same frequency. At the next |
| 955 |
iteration (cycle) of the slotframe, however, while the channelOffset |
| 956 |
is the same, the ASN has changed, resulting in the computation of a |
| 957 |
different frequency. |
| 958 |
|
| 959 |
This results in "channel hopping": even with a static schedule, pairs |
| 960 |
of neighbors "hop" between the different frequencies when |
| 961 |
communicating. A way of ensuring communication happens on all |
| 962 |
available frequencies is to set the number of timeslots in a |
| 963 |
slotframe to a prime number. Channel hopping is a technique known to |
| 964 |
efficiently combat multi-path fading and external interference |
| 965 |
[<a href="#ref-Watteyne09reliability">Watteyne09reliability</a>]. |
| 966 |
|
| 967 |
<span class="h3"><a class="selflink" id="appendix-A.8" href="#appendix-A.8">A.8</a>. Time Synchronization</span> |
| 968 |
|
| 969 |
Because of the slotted nature of communication in a TSCH network, |
| 970 |
nodes have to maintain tight synchronization. All nodes are assumed |
| 971 |
to be equipped with clocks to keep track of time. Yet, because |
| 972 |
clocks in different nodes drift with respect to one another, neighbor |
| 973 |
nodes need to periodically resynchronize. |
| 974 |
|
| 975 |
Each node needs to periodically synchronize its network clock to |
| 976 |
another node, and it also provides its network time to its neighbors. |
| 977 |
It is up to the entity that manages the schedule to assign an |
| 978 |
adequate time source neighbor to each node, i.e., to indicate in the |
| 979 |
schedule which neighbor is its "time source neighbor". While setting |
| 980 |
the time source neighbor, it is important to avoid synchronization |
| 981 |
loops, which could result in the formation of independent clusters of |
| 982 |
synchronized nodes. |
| 983 |
|
| 984 |
TSCH adds timing information in all packets that are exchanged (both |
| 985 |
data and ACK frames). This means that neighbor nodes can |
| 986 |
resynchronize to one another whenever they exchange data. In detail, |
| 987 |
two methods are defined in IEEE 802.15.4e (of 2012) for allowing a |
| 988 |
device to synchronize in a TSCH network: (i) Acknowledgment-based and |
| 989 |
(ii) Frame-based synchronization. In both cases, the receiver |
| 990 |
calculates the difference in time between the expected time of frame |
| 991 |
arrival and its actual arrival. In Acknowledgment-based |
| 992 |
synchronization, the receiver provides such information to the sender |
| 993 |
node in its acknowledgment. In this case, it is the sender node that |
| 994 |
synchronizes to the clock of the receiver. In Frame-based |
| 995 |
synchronization, the receiver uses the computed delta for adjusting |
| 996 |
its own clock. In this case, it is the receiver node that |
| 997 |
synchronizes to the clock of the sender. |
| 998 |
|
| 999 |
|
| 1000 |
|
| 1001 |
|
| 1002 |
|
| 1003 |
|
| 1004 |
<span class="grey">Watteyne, et al. Informational [Page 18]</span></pre> |
| 1005 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-19" ></span> |
| 1006 |
<span class="grey"><a href="./rfc7554">RFC 7554</a> 6TiSCH-TSCH May 2015</span> |
| 1007 |
|
| 1008 |
|
| 1009 |
Different synchronization policies are possible. Nodes can keep |
| 1010 |
synchronization exclusively by exchanging EBs. Nodes can also keep |
| 1011 |
synchronized by periodically sending valid frames to a time source |
| 1012 |
neighbor and use the acknowledgment to resynchronize. Both methods |
| 1013 |
(or a combination thereof) are valid synchronization policies; which |
| 1014 |
one to use depends on network requirements. |
| 1015 |
|
| 1016 |
<span class="h3"><a class="selflink" id="appendix-A.9" href="#appendix-A.9">A.9</a>. Power Consumption</span> |
| 1017 |
|
| 1018 |
There are only a handful of activities a node can perform during a |
| 1019 |
timeslot: transmit, receive, or sleep. Each of these operations has |
| 1020 |
some energy cost associated to them; the exact value depends on the |
| 1021 |
hardware used. Given the schedule of a node, it is straightforward |
| 1022 |
to calculate the expected average power consumption of that node. |
| 1023 |
|
| 1024 |
<span class="h3"><a class="selflink" id="appendix-A.10" href="#appendix-A.10">A.10</a>. Network TSCH Schedule</span> |
| 1025 |
|
| 1026 |
The schedule entirely defines the synchronization and communication |
| 1027 |
between nodes. By adding/removing cells between neighbors, one can |
| 1028 |
adapt a schedule to the needs of the application. Intuitive examples |
| 1029 |
are: |
| 1030 |
|
| 1031 |
o Make the schedule "sparse" for applications where nodes need to |
| 1032 |
consume as little energy as possible, at the price of reduced |
| 1033 |
bandwidth. |
| 1034 |
|
| 1035 |
o Make the schedule "dense" for applications where nodes generate a |
| 1036 |
lot of data, at the price of increased power consumption. |
| 1037 |
|
| 1038 |
o Add more cells along a multi-hop route over which many packets |
| 1039 |
flow. |
| 1040 |
|
| 1041 |
<span class="h3"><a class="selflink" id="appendix-A.11" href="#appendix-A.11">A.11</a>. Join Process</span> |
| 1042 |
|
| 1043 |
Nodes already part of the network can periodically send EB frames to |
| 1044 |
announce the presence of the network. These contain information |
| 1045 |
about the size of the timeslot used in the network, the current ASN, |
| 1046 |
information about the slotframes and timeslots the beaconing node is |
| 1047 |
listening on, and a 1-byte join priority. The join priority field |
| 1048 |
gives information to make a better decision of which node to join. |
| 1049 |
Even if a node is configured to send all EB frames on the same |
| 1050 |
channelOffset, because of the channel hopping nature of TSCH |
| 1051 |
described in <a href="#appendix-A.7">Appendix A.7</a>, this channelOffset translates into a |
| 1052 |
different frequency at different slotframe cycles. As a result, EB |
| 1053 |
frames are sent on all frequencies. |
| 1054 |
|
| 1055 |
|
| 1056 |
|
| 1057 |
|
| 1058 |
|
| 1059 |
|
| 1060 |
<span class="grey">Watteyne, et al. Informational [Page 19]</span></pre> |
| 1061 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-20" ></span> |
| 1062 |
<span class="grey"><a href="./rfc7554">RFC 7554</a> 6TiSCH-TSCH May 2015</span> |
| 1063 |
|
| 1064 |
|
| 1065 |
A node wishing to join the network listens for EBs. Since EBs are |
| 1066 |
sent on all frequencies, the joining node can listen on any frequency |
| 1067 |
until it hears an EB. What frequency it listens on is implementation |
| 1068 |
specific. Once it has received one or more EBs, the new node enables |
| 1069 |
the TSCH mode and uses the ASN and the other timing information from |
| 1070 |
the EB to synchronize to the network. Using the slotframe and cell |
| 1071 |
information from the EB, it knows how to contact other nodes in the |
| 1072 |
network. |
| 1073 |
|
| 1074 |
The IEEE 802.15.4e TSCH standard does not define the steps beyond |
| 1075 |
this network "bootstrap". |
| 1076 |
|
| 1077 |
<span class="h3"><a class="selflink" id="appendix-A.12" href="#appendix-A.12">A.12</a>. Information Elements</span> |
| 1078 |
|
| 1079 |
TSCH introduces the concept of Information Elements (IEs). An IE is |
| 1080 |
a list of Type-Length-Value containers placed at the end of the MAC |
| 1081 |
header. A small number of types are defined for TSCH (e.g., the ASN |
| 1082 |
in the EB is contained in an IE), and an unmanaged range is available |
| 1083 |
for extensions. |
| 1084 |
|
| 1085 |
A data bit in the MAC header indicates whether the frame contains |
| 1086 |
IEs. IEs are grouped into Header IEs, consumed by the MAC layer and |
| 1087 |
therefore typically invisible to the next higher layer, and Payload |
| 1088 |
IEs, which are passed untouched to the next higher layer, possibly |
| 1089 |
followed by regular payload. Payload IEs can therefore be used for |
| 1090 |
the next higher layers of two neighbor nodes to exchange information. |
| 1091 |
|
| 1092 |
<span class="h3"><a class="selflink" id="appendix-A.13" href="#appendix-A.13">A.13</a>. Extensibility</span> |
| 1093 |
|
| 1094 |
The TSCH standard is designed to be extensible. It introduces the |
| 1095 |
mechanisms as "building block" (e.g., cells, bundles, slotframes, |
| 1096 |
etc.), but leaves entire freedom to the upper layer to assemble |
| 1097 |
those. The MAC protocol can be extended by defining new Header IEs. |
| 1098 |
An intermediate layer can be defined to manage the MAC layer by |
| 1099 |
defining new Payload IEs. |
| 1100 |
|
| 1101 |
|
| 1102 |
|
| 1103 |
|
| 1104 |
|
| 1105 |
|
| 1106 |
|
| 1107 |
|
| 1108 |
|
| 1109 |
|
| 1110 |
|
| 1111 |
|
| 1112 |
|
| 1113 |
|
| 1114 |
|
| 1115 |
|
| 1116 |
<span class="grey">Watteyne, et al. Informational [Page 20]</span></pre> |
| 1117 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-21" ></span> |
| 1118 |
<span class="grey"><a href="./rfc7554">RFC 7554</a> 6TiSCH-TSCH May 2015</span> |
| 1119 |
|
| 1120 |
|
| 1121 |
<span class="h2"><a class="selflink" id="appendix-B" href="#appendix-B">Appendix B</a>. TSCH Features</span> |
| 1122 |
|
| 1123 |
This section details features of TSCH, which might be interesting for |
| 1124 |
the work of the 6TiSCH WG. It does not define any requirements. |
| 1125 |
|
| 1126 |
<span class="h3"><a class="selflink" id="appendix-B.1" href="#appendix-B.1">B.1</a>. Collision-Free Communication</span> |
| 1127 |
|
| 1128 |
TSCH allows one to design a schedule that yields collision-free |
| 1129 |
communication. This is done by building the schedule with dedicated |
| 1130 |
cells in such a way that at most, one node communicates with a |
| 1131 |
specific neighbor in each slotOffset/channelOffset cell. Multiple |
| 1132 |
pairs of neighbor nodes can exchange data at the same time, but on |
| 1133 |
different frequencies. |
| 1134 |
|
| 1135 |
<span class="h3"><a class="selflink" id="appendix-B.2" href="#appendix-B.2">B.2</a>. Multi-Channel vs. Channel Hopping</span> |
| 1136 |
|
| 1137 |
A TSCH schedule looks like a matrix of width "slotframe size", S, and |
| 1138 |
of height "number of frequencies", nFreq. For a scheduling |
| 1139 |
algorithm, cells can be considered atomic "units" to schedule. In |
| 1140 |
particular, because of the channel hopping nature of TSCH, the |
| 1141 |
scheduling algorithm should not worry about the actual frequency |
| 1142 |
communication happens on, since it changes at each slotframe |
| 1143 |
iteration. |
| 1144 |
|
| 1145 |
<span class="h3"><a class="selflink" id="appendix-B.3" href="#appendix-B.3">B.3</a>. Cost of (Continuous) Synchronization</span> |
| 1146 |
|
| 1147 |
When there is traffic in the network, nodes that are communicating |
| 1148 |
implicitly resynchronize using the data frames they exchange. In the |
| 1149 |
absence of data traffic, nodes are required to synchronize to their |
| 1150 |
time source neighbor(s) periodically not to drift in time. If they |
| 1151 |
have not been communicating for some time (typically 30 s), nodes can |
| 1152 |
exchange a dummy data frame to resynchronize. The frequency at which |
| 1153 |
such messages need to be transmitted depends on the stability of the |
| 1154 |
clock source and on how "early" each node starts listening for data |
| 1155 |
(the "guard time"). Theoretically, with a 10 ppm clock and a 1 ms |
| 1156 |
guard time, this period can be 100 s. Assuming this exchange causes |
| 1157 |
the node's radio to be on for 5 ms, this yields a radio duty cycle |
| 1158 |
needed to keep synchronized of 5 ms / 100 s = 0.005%. While TSCH |
| 1159 |
does require nodes to resynchronize periodically, the cost of doing |
| 1160 |
so is very low. |
| 1161 |
|
| 1162 |
<span class="h3"><a class="selflink" id="appendix-B.4" href="#appendix-B.4">B.4</a>. Topology Stability</span> |
| 1163 |
|
| 1164 |
The channel hopping nature of TSCH causes links to be very "stable". |
| 1165 |
Wireless phenomena such as multi-path fading and external |
| 1166 |
interference impact a wireless link between two nodes differently on |
| 1167 |
each frequency. If a transmission from node A to node B fails, |
| 1168 |
retransmitting on a different frequency has a higher likelihood of |
| 1169 |
|
| 1170 |
|
| 1171 |
|
| 1172 |
<span class="grey">Watteyne, et al. Informational [Page 21]</span></pre> |
| 1173 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-22" ></span> |
| 1174 |
<span class="grey"><a href="./rfc7554">RFC 7554</a> 6TiSCH-TSCH May 2015</span> |
| 1175 |
|
| 1176 |
|
| 1177 |
succeeding that retransmitting on the same frequency. As a result, |
| 1178 |
even when some frequencies are "behaving bad", channel hopping |
| 1179 |
"smoothens" the contribution of each frequency, resulting in more |
| 1180 |
stable links and therefore a more stable topology. |
| 1181 |
|
| 1182 |
<span class="h3"><a class="selflink" id="appendix-B.5" href="#appendix-B.5">B.5</a>. Multiple Concurrent Slotframes</span> |
| 1183 |
|
| 1184 |
The TSCH standard allows for multiple slotframes to coexist in a |
| 1185 |
node's schedule. It is possible that, at some timeslot, a node has |
| 1186 |
multiple activities scheduled (e.g., transmit to node B on slotframe |
| 1187 |
2, receive from node C on slotframe 1). To handle this situation, |
| 1188 |
the TSCH standard defines the following precedence rules: |
| 1189 |
|
| 1190 |
1. Transmissions take precedence over receptions; |
| 1191 |
|
| 1192 |
2. Lower slotframe identifiers take precedence over higher slotframe |
| 1193 |
identifiers. |
| 1194 |
|
| 1195 |
In the example above, the node would transmit to node B on slotframe |
| 1196 |
2. |
| 1197 |
|
| 1198 |
Acknowledgments |
| 1199 |
|
| 1200 |
Special thanks to Dominique Barthel, Patricia Brett, Guillaume |
| 1201 |
Gaillard, Pat Kinney, Ines Robles, Timothy J. Salo, Jonathan Simon, |
| 1202 |
Rene Struik, and Xavi Vilajosana for reviewing the document and |
| 1203 |
providing valuable feedback. Thanks to the IoT6 European Project |
| 1204 |
(STREP) of the 7th Framework Program (Grant 288445). |
| 1205 |
|
| 1206 |
|
| 1207 |
|
| 1208 |
|
| 1209 |
|
| 1210 |
|
| 1211 |
|
| 1212 |
|
| 1213 |
|
| 1214 |
|
| 1215 |
|
| 1216 |
|
| 1217 |
|
| 1218 |
|
| 1219 |
|
| 1220 |
|
| 1221 |
|
| 1222 |
|
| 1223 |
|
| 1224 |
|
| 1225 |
|
| 1226 |
|
| 1227 |
|
| 1228 |
<span class="grey">Watteyne, et al. Informational [Page 22]</span></pre> |
| 1229 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-23" ></span> |
| 1230 |
<span class="grey"><a href="./rfc7554">RFC 7554</a> 6TiSCH-TSCH May 2015</span> |
| 1231 |
|
| 1232 |
|
| 1233 |
Authors' Addresses |
| 1234 |
|
| 1235 |
Thomas Watteyne (editor) |
| 1236 |
Linear Technology |
| 1237 |
32990 Alvarado-Niles Road, Suite 910 |
| 1238 |
Union City, CA 94587 |
| 1239 |
United States |
| 1240 |
|
| 1241 |
Phone: +1 (510) 400-2978 |
| 1242 |
EMail: [email protected] |
| 1243 |
|
| 1244 |
|
| 1245 |
Maria Rita Palattella |
| 1246 |
University of Luxembourg |
| 1247 |
Interdisciplinary Centre for Security, Reliability and Trust |
| 1248 |
4, rue Alphonse Weicker |
| 1249 |
Luxembourg L-2721 |
| 1250 |
Luxembourg |
| 1251 |
|
| 1252 |
Phone: +352 46 66 44 5841 |
| 1253 |
EMail: [email protected] |
| 1254 |
|
| 1255 |
|
| 1256 |
Luigi Alfredo Grieco |
| 1257 |
Politecnico di Bari |
| 1258 |
Department of Electrical and Information Engineering |
| 1259 |
Via Orabona 4 |
| 1260 |
Bari 70125 |
| 1261 |
Italy |
| 1262 |
|
| 1263 |
Phone: +39 08 05 96 3911 |
| 1264 |
EMail: [email protected] |
| 1265 |
|
| 1266 |
|
| 1267 |
|
| 1268 |
|
| 1269 |
|
| 1270 |
|
| 1271 |
|
| 1272 |
|
| 1273 |
|
| 1274 |
|
| 1275 |
|
| 1276 |
|
| 1277 |
|
| 1278 |
|
| 1279 |
|
| 1280 |
|
| 1281 |
|
| 1282 |
|
| 1283 |
|
| 1284 |
Watteyne, et al. Informational [Page 23] |
| 1285 |
</pre> |