{"title":"Throughput Optimization of IEEE 802.15.4e TSCH-Based Scheduling: A Deep Neural Network (DNN) Scheme","authors":"Md. Niaz Morshedul Haque, Insoo Koo","doi":"10.1109/ICCIT57492.2022.10054722","DOIUrl":null,"url":null,"abstract":"This paper describes a simple and reliable deep learning-based deep neural network (DNN) model that can conduct time-slotted channel hopping (TSCH) based scheduling in accordance with IEEE 802.15.4e guidelines. In a centralized fashion, the TSCH network develops as a maximum weighted bipartite matching strategy for links to cell assignment of a slot frame. The cell assignment problem is solved using a well-known Hungarian assignment algorithm, which considers network throughput as a bipartite-edge-weight. We use the Hungarian scheduling technique to create training data and train the DNN accordingly. The results of the simulations show that the proposed DNN-based scheduling scheme outperforms Hungarian algorithm-based methods while using fewer computational resources.","PeriodicalId":255498,"journal":{"name":"2022 25th International Conference on Computer and Information Technology (ICCIT)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 25th International Conference on Computer and Information Technology (ICCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIT57492.2022.10054722","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper describes a simple and reliable deep learning-based deep neural network (DNN) model that can conduct time-slotted channel hopping (TSCH) based scheduling in accordance with IEEE 802.15.4e guidelines. In a centralized fashion, the TSCH network develops as a maximum weighted bipartite matching strategy for links to cell assignment of a slot frame. The cell assignment problem is solved using a well-known Hungarian assignment algorithm, which considers network throughput as a bipartite-edge-weight. We use the Hungarian scheduling technique to create training data and train the DNN accordingly. The results of the simulations show that the proposed DNN-based scheduling scheme outperforms Hungarian algorithm-based methods while using fewer computational resources.