## 7 Conclusions  
This research successfully developed a simulator that could be used as a tool to develop a centralized link-scheduling algorithm on the IEEE802.15.4e TSCH network. The developed simulator is known as the TSCH link-scheduling simulator, or TLS-VaD. As a research aid, the TLS-VaD provides the following facilities: (a) visualization for designed scheduling algorithms so that researchers can verify and validate them, (b) four types of data that can be used to analyze the performance of scheduling algorithms, and (c) a simplified experiment, because TLS-VaD can be used independently by researchers as a tool for processing and visualization scheduling data. In the validity test, TLS-VaD was proven to be valid. This was indicated by a match between the visualization and output data generated by TLS-VaD with the link-schedule matrices generated by the scheduling algorithm. After passing the validity test, TLS-VaD was used to compare the performance of the Iman-Ramli bursty transmission scheduling algorithm (IRByTSA) with the first top scheduling algorithm (FTSA) and first leaf scheduling algorithm (FLSA). The parameters observed in this performance test were active timeslots (\(\lambda\)) and the speed of the algorithm in generating scheduling decisions. The performance comparisons using TLS-VaD reveal that IRByTSA performed better than FLSA and FTSA, because it could save more power and generate scheduling decisions relatively quickly. The ability of IRByTSA to save power is shown by its \(\lambda\) value (\(\lambda_{\text{IRByTSA}}\)), which was smaller than the values in FTSA (\(\lambda_{\text{FTSA}}\)) and FLSA (\(\lambda_{\text{FLSA}}\)), while the ability to generate scheduling decisions in a relatively quick manner is shown by the number of cycles (C) required by IRByTSA (\(\text{C}_{\text{IRByTSA}}\)), which was smaller than C in FTSA (\(\text{C}_{\text{FTSA}}\)) and almost close to that in FLSA (\(\text{C}_{\text{FTSA}}\)). Although in terms of the number of cycles IRByTSA was not able to show the best performance, the difference between \(\text{C}_{\text{IRByTSA}}\) and \(\text{C}_{\text{FLSA}}\), only four cycles, could be compensated by the difference between \(\lambda_{\text{IRByTSA}}\) and \(\lambda_{\text{FLSA}}\), which amounted to 25 timeslots. The performance comparison of these three scheduling algorithms was in line with the hypotheses. This was reinforced by two additional pieces of information: the performance of the three algorithms was almost the same in terms of the ChOff/C parameter, and the \(\text{C}_{\text{IRByTSA}}\) value was almost close to \(\text{C}_{\text{FLSA}}\). This research proved that TLS-VaD could be used as a tool to develop a centralized link-scheduling algorithm on the IEEE802.15.4e TSCH network. Conceptualization, I.H.S. and K.R. ; Data curation, I.H.S. and S.M.T. ; Formal analysis, I.H.S. ; Funding acquisition, K.R. ; Investigation, I.H.S. and S.M.T. ; Methodology, I.H.S., K.R. and S.M.T. ; Project administration, I.H.S. and S.M.T. ; Resources, I.H.S. and S.M.T. ; Software, I.H.S. and S.M.T. ; Supervision, K.R. ; Validation, I.H.S. and K.R. ; Visualization, I.H.S. ; Writing--original draft, I.H.S. ; Writing--review and editing, I.H.S., K.R. and S.M.T. This work was supported by a grant from The Ministry of Research, Technology, and Higher Education of The Republic of Indonesia, in the framework of Doctoral Dissertation Grant. The authors declare no conflict of interest.