Wave: a distributed scheduling algorithm for convergecast in IEEE 802.15.4e TSCH networks
The IEEE 802.15.4e MAC amendment has been proposed to meet the requirements of industrial applications. Using slotted medium access with channel hopping, the MAC layer orchestrates the medium accesses of nodes according to a given schedule. Nevertheless, this amendment does not specify how this sche...
Uložené v:
| Vydané v: | Transactions on emerging telecommunications technologies Ročník 27; číslo 4; s. 557 - 575 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Blackwell Publishing Ltd
01.04.2016
|
| ISSN: | 2161-3915, 2161-3915 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | The IEEE 802.15.4e MAC amendment has been proposed to meet the requirements of industrial applications. Using slotted medium access with channel hopping, the MAC layer orchestrates the medium accesses of nodes according to a given schedule. Nevertheless, this amendment does not specify how this schedule is computed. The purpose of this paper is to propose a distributed joint time slot and channel assignment, called Wave, for data gathering in low‐power lossy networks. This schedule targets minimised data convergecast delays by reducing the total number of slots in the schedule. Moreover, Wave ensures the absence of conflicting transmissions in the schedule provided. In such a schedule, a node is awake only during its transmission slots and those of its children in the convergecast routing graph. Thus, energy efficiency is ensured. In this paper, we present Wave with its properties (e.g. support of heterogeneous traffic, support of a sink equipped with multiple interfaces, worst case delays and buffer size) and compare it with a centralised scheduling algorithm like TMCP and a distributed one like DeTAS. Simulation results show the good performance of Wave compared with TMCP. Because in an industrial environment, several routing graphs can coexist, we study how Wave supports this coexistence. Copyright © 2015 John Wiley & Sons, Ltd.
Wave is a distributed conflict‐free scheduling algorithm for raw data convergecast in IEEE 802.15.4e TSCH networks. Wave ensures minimized data gathering delays and manages heterogeneous traffic demands from sensor nodes. It automatically adapts to the number of available channels and the number of radio interfaces equipping the sink. It also supports the coexistence of several routing graphs or several networks in the same environment. |
|---|---|
| Bibliografia: | istex:83693B2567894C4B5B975E64A67F9466518B4B42 ark:/67375/WNG-H7Z5SFVB-S ArticleID:ETT2991 |
| ISSN: | 2161-3915 2161-3915 |
| DOI: | 10.1002/ett.2991 |