Simple distributed scheduling with collision detection in TSCH networks
| Autor: | Xavier Vilajosana, Kristofer S. J. Pister, Nicola Accettura, Thomas Watteyne, Kazushi Muraoka |
|---|---|
| Přispěvatelé: | NEC Corporation, Institut National de Recherche en Informatique et en Automatique (Inria), Laboratory for Analysis and Architecture of Systems, Universitat Oberta de Catalunya. Internet Interdisciplinary Institute (IN3), University of California, Inria, University of California, Berkeley, Department of Environment and Agro-biotechnologies (EVA), Centre de Recherche Public - Gabriel Lippmann (LUXEMBOURG), Lawrence Berkeley National Laboratory [Berkeley] (LBNL), Universitat Oberta de Catalunya [Barcelona] (UOC), University of California [Berkeley] |
| Rok vydání: | 2016 |
| Předmět: |
Schedule
Computer science programació distribuïda 02 engineering and technology distributed scheduling Comunicación inalámbricos Sistemas de 01 natural sciences Scheduling (computing) [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI] Packet loss 0202 electrical engineering electronic engineering information engineering Collision detection programación distribuida Electrical and Electronic Engineering Instrumentation time synchronized channel hopping (TSCH) Network packet business.industry 010401 analytical chemistry ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS 020206 networking & telecommunications Collision 0104 chemical sciences IPv6 Wireless communication systems Comunicació sense fil Sistemes de business Computer network |
| Zdroj: | O2, repositorio institucional de la UOC Universitat Oberta de Catalunya (UOC) Recercat. Dipósit de la Recerca de Catalunya instname IEEE Sensors Letters IEEE Sensors Letters, IEEE, 2016 |
| ISSN: | 2475-1472 |
| Popis: | International audience; The IETF IPv6 over the Time Synchronized Channel Hopping mode of IEEE 802.15.4e (6TiSCH) working group standardizes a distributed mechanism for neighbor motes to agree on a schedule to communicate, driven by a Scheduling Function. This letter introduces the notion of “housekeeping” to the Schedule Function, in which motes relocate cells in the schedule to build a collision-free schedule in a distribute manner. The solution, based on detecting under-performing cells and listening for unexpected packets, does not require additional signaling traffic or state. This letter shows that simple housekeeping rules introduced allow a network to contain 17% more motes and suffer from 64% fewer collision, while maintaining end-to-end reliability above 99.5% in a typical industrial environment. This solution is now being discussed for standardization at 6TiSCH. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|