학술논문

Minimal Idle-Listen Centralized Scheduling in TSCH Wireless Sensor Networks
Document Type
Conference
Source
2018 41st International Conference on Telecommunications and Signal Processing (TSP) Telecommunications and Signal Processing (TSP), 2018 41st International Conference on. :1-5 Jul, 2018
Subject
Bioengineering
Communication, Networking and Broadcast Technologies
Components, Circuits, Devices and Systems
Computing and Processing
Engineered Materials, Dielectrics and Plasmas
Engineering Profession
Fields, Waves and Electromagnetics
General Topics for Engineers
Photonics and Electrooptics
Power, Energy and Industry Applications
Robotics and Control Systems
Signal Processing and Analysis
Transportation
Schedules
Scheduling algorithms
Wireless sensor networks
IEEE 802.15 Standard
Delays
Relays
Resource management
centralized 6TiSCH scheduling
Constraint Satisfaction Problem
Idle-listening
TSCH
Wireless Sensor Networks
Language
Abstract
Centralized scheduling in IEEE 802.15.4e Time Slotted Channel Hopping (TSCH), uses a centralized entity to perform scheduling of nodes in cells to generate collision-free communication amongst neighboring nodes. Although many centralized scheduling algorithms have been proposed, they still suffer from idle-listening, a state in which nodes stay awake without transmitting or receiving data, which causes wastage of the limited sensor node energy. This paper proposes a minimal-idle-listen centralized 6TiSCH scheduling algorithm (MILS) with the aim of minimizing idle listening amongst sender nodes. MILS is formulated as a Constraint Satisfaction Problem (CSP) problem, which schedules relay links in parallel with leaf links while maximizing the channels available in order to minimize waiting at bottleneck regions. Minimizing the number of packets in nodes close to the sink reduced delays by approximately 19% and idle-listening by 50% in MILS compared to OTF.