Dynamic Programming based Low-Latency Schedule (DPLLS) for 6TiSCH networks

被引:6
作者
Bommisetty, Lokesh [1 ]
Venkatesh, T. G. [1 ]
机构
[1] Indian Inst Technol Madras, Dept Elect Engn, Chennai 600036, Tamil Nadu, India
关键词
Industrial IoT; IEEE; 802; 15; 4e; Time Slotted Channel Hopping; 6TiSCH; Maximum weight independent set; Scheduling; ALGORITHMS;
D O I
10.1016/j.adhoc.2021.102708
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Internet of Things (IoT) is a technological concept bringing sustainability and sophistication to our lives and is a significant component of Industry 4.0. The main requirements of Industrial IoT are reliability, stringent latency and energy efficiency. The IEEE 802.15.4e standard has adapted a Medium Access Control (MAC) behavioural mode called Time Slotted Channel Hopping (TSCH) to address the requirements of Industry 4.0. The 6TiSCH (IPv6 over IEEE 802.15.4e TSCH) protocol stack enables us to schedule the transmissions in TSCH network to achieve application-specific guarantees. In this paper, we propose DPLLS, a conflict-free dynamic programming based low-latency scheduling algorithm for TSCH network. In particular, identifying non-interfering transmissions in the network is posed as a maximum weight independent set (MWIS) problem, which is solved using a dynamic programming method. We organise each slotframe into smaller parts called blocks in which the non-interfering transmissions are scheduled simultaneously using either a conservative or a greedy scheme. The blocks are repeated in a slotframe to accommodate the retransmissions of packets to ensure reliability and minimise the latency. The proposed scheme is evaluated using an example to find the suitable block length of the proposed schemes and compared with the existing scheduling algorithms.
引用
收藏
页数:11
相关论文
共 27 条
[1]  
Alexander R, 2012, TECHNICAL REPORT, DOI 10.17487/RFC6550
[2]  
[Anonymous], 2020, 8021542020 IEEE, P1, DOI DOI 10.1109/IEEESTD.2020.9144691
[3]  
Brun-Laguna K., 2019, IEEE GLOB COMM CONF, P1
[4]   ON THE MAXIMUM WEIGHT INDEPENDENT SET PROBLEM IN GRAPHS WITHOUT INDUCED CYCLES OF LENGTH AT LEAST FIVE [J].
Chudnovsky, Maria ;
Pilipczuk, Marcin ;
Pilipczuk, Michal ;
Thomasse, Stephan .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020, 34 (02) :1472-1483
[5]   IEEE 802.15.4e: A survey [J].
De Guglielmo, Domenico ;
Brienza, Simone ;
Anastasi, Giuseppe .
COMPUTER COMMUNICATIONS, 2016, 88 :1-24
[6]  
Devaja T., 2019, IEEE EUROCON 2019 18, P1
[7]   Orchestra: Robust Mesh Networks Through Autonomously Scheduled TSCH [J].
Duquennoy, Simon ;
Al Nahas, Beshr ;
Landsiedel, Olaf ;
Watteyne, Thomas .
SENSYS'15: PROCEEDINGS OF THE 13TH ACM CONFERENCE ON EMBEDDED NETWORKED SENSOR SYSTEMS, 2015, :337-350
[8]  
Gnawali O., 2012, The Minimum Rank with Hysteresis Objective Function
[9]   Self-healing distributed scheduling for end-to-end delay optimization in multihop wireless networks with 6TiSCh [J].
Hosni, Ines ;
Theoleyre, Fabrice .
COMPUTER COMMUNICATIONS, 2017, 110 :103-119
[10]   IEEE 802.15.4.e TSCH-Based Scheduling for Throughput Optimization: A Combinatorial Multi-Armed Bandit Approach [J].
Javan, Nastooh Taheri ;
Sabaei, Masoud ;
Hakami, Vesal .
IEEE SENSORS JOURNAL, 2020, 20 (01) :525-537