{"title":"Joint Design of Routing and Scheduling for Maximizing Reliability of Multihop Transmissions in WirelessHART Networks","authors":"M. Ji, Xianghui Cao","doi":"10.1109/YAC51587.2020.9337628","DOIUrl":null,"url":null,"abstract":"WirelessHART is one of the most widely used wireless standards for industrial applications. In order to meet the high requirements of communication for reliability and real-timeliness, WirelessHART has adopted graph routing to allow retransmission from backup paths when necessary and time slotted channel hopping (TSCH) mechanism to improve reliability by leveraging channel diversity. In this paper, we formulate the problem of maximizing the transmission reliability of multiple flows in a multi-hop WirelessHART network. Considering the path diversity of graph routing, we analyze the characteristics of links that pass through different paths of the same flow. Based on this analysis, We propose an aggregation-based routing algorithm along with a hop-wise scheduling algorithm to solve the optimization problem. Finally, we demonstrate the effectiveness of the proposed algorithm through extensive simulations.","PeriodicalId":287095,"journal":{"name":"2020 35th Youth Academic Annual Conference of Chinese Association of Automation (YAC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 35th Youth Academic Annual Conference of Chinese Association of Automation (YAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/YAC51587.2020.9337628","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
WirelessHART is one of the most widely used wireless standards for industrial applications. In order to meet the high requirements of communication for reliability and real-timeliness, WirelessHART has adopted graph routing to allow retransmission from backup paths when necessary and time slotted channel hopping (TSCH) mechanism to improve reliability by leveraging channel diversity. In this paper, we formulate the problem of maximizing the transmission reliability of multiple flows in a multi-hop WirelessHART network. Considering the path diversity of graph routing, we analyze the characteristics of links that pass through different paths of the same flow. Based on this analysis, We propose an aggregation-based routing algorithm along with a hop-wise scheduling algorithm to solve the optimization problem. Finally, we demonstrate the effectiveness of the proposed algorithm through extensive simulations.