OST: On-Demand TSCH Scheduling with Traffic-Awareness
- Authors
- Jeong, Seungbeom; Kim, Hyung-Sin; Paek, Jeongyeup; Bahk, Saewoong
- Issue Date
- Jul-2020
- Publisher
- IEEE
- Keywords
- Low-power and Lossy Network; IEEE 802.15.4; TSCH; Dynamic Scheduling; Wireless Network Protocol
- Citation
- IEEE INFOCOM 2020 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, v.2020-July, pp 69 - 78
- Pages
- 10
- Journal Title
- IEEE INFOCOM 2020 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS
- Volume
- 2020-July
- Start Page
- 69
- End Page
- 78
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/47655
- DOI
- 10.1109/infocom41043.2020.9155496
- ISSN
- 0743-166X
- Abstract
- As the emerging Internet of Things (IoT) devices and applications flourish, demand for reliable and energy-efficient low-power wireless network protocols is surging. For this purpose, IEEE 802.15.4 standardized time-slotted channel hopping (TSCH), a promising and viable link-layer solution that has shown outstanding performance achieving over 99% reliability with low duty-cycles. However, it lacks one thing, flexibility. It is not adaptable to a wide variety of applications with varying traffic load and unpredictable routing topology due to its static timeslot scheduling. To this end, we propose OST, an On-demand Scheduling scheme for TSCH with traffic-awareness. In OST, each node dynamically self-adjusts the frequency of timeslots at run time according to time-varying traffic intensity. Moreover, it features on-demand resource allocation to handle bursty/queued packets in a timely manner. By doing so, OST aims to minimize its energy consumption while guaranteeing reliable packet delivery. We evaluate OST on a large-scale 72-node testbed, demonstrating that it achieves improvement of 60% in reliability and 52% in energy-efficiency compared to the state of the art.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Software > School of Computer Science and Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.