TY - JOUR
T1 - A Distributed Scheduling Algorithm for IEEE 802.15.4e Wireless Sensor Networks
AU - Hwang, Ren Hung
AU - Wang, Chih Chiang
AU - Wang, Wu Bin
N1 - Publisher Copyright:
© 2017 Elsevier B.V.
PY - 2017/5/1
Y1 - 2017/5/1
N2 - As the widely adopted IEEE 802.15.4 standard exhibited severe drawbacks when used in multi-hop WSN environment, the IEEE Standards Association Board has released a revised version, IEEE 802.15.4e, which includes Time-Slotted Channel Hopping (TSCH) mechanism as the MAC amendment to IEEE 802.15.4. The key feature of IEEE 802.15.4e TSCH mechanism is to allow the sensors to plan the time-slot schedule for efficient data transmission. However, the standard does not specify how to plan a time-slot schedule so that data collected by the sensors can be received by the base station as soon as possible without being delayed by transmission conflicts. In this paper, we propose a constant-time, distributed time-slot scheduling algorithm to address this problem. Existing works on IEEE 802.15.4e TSCH scheduling depend on one or a few nodes to collect traffic-flow information from their descendants and plan a centralized time-slot schedule for the whole network. In contrast, our algorithm allows every sensor node to compute its time-slot schedule in a simple, truly distributed manner. Simulation results show that our algorithm significantly outperforms a state-of-the-art protocol in terms of the packet transmission delay and yields a smaller duty cycle.
AB - As the widely adopted IEEE 802.15.4 standard exhibited severe drawbacks when used in multi-hop WSN environment, the IEEE Standards Association Board has released a revised version, IEEE 802.15.4e, which includes Time-Slotted Channel Hopping (TSCH) mechanism as the MAC amendment to IEEE 802.15.4. The key feature of IEEE 802.15.4e TSCH mechanism is to allow the sensors to plan the time-slot schedule for efficient data transmission. However, the standard does not specify how to plan a time-slot schedule so that data collected by the sensors can be received by the base station as soon as possible without being delayed by transmission conflicts. In this paper, we propose a constant-time, distributed time-slot scheduling algorithm to address this problem. Existing works on IEEE 802.15.4e TSCH scheduling depend on one or a few nodes to collect traffic-flow information from their descendants and plan a centralized time-slot schedule for the whole network. In contrast, our algorithm allows every sensor node to compute its time-slot schedule in a simple, truly distributed manner. Simulation results show that our algorithm significantly outperforms a state-of-the-art protocol in terms of the packet transmission delay and yields a smaller duty cycle.
KW - Distributed Time-Slot Scheduling
KW - IEEE 802.15.4e
KW - Time Slotted Channel Hopping
KW - Wireless Sensor Network
UR - http://www.scopus.com/inward/record.url?scp=85011325127&partnerID=8YFLogxK
U2 - 10.1016/j.csi.2017.01.003
DO - 10.1016/j.csi.2017.01.003
M3 - Article
AN - SCOPUS:85011325127
SN - 0920-5489
VL - 52
SP - 63
EP - 70
JO - Computer Standards and Interfaces
JF - Computer Standards and Interfaces
ER -