Mengmeng Xu, Hai Zhu, Hengzhou Xu, Jiongjiong Song, Zhen Luo
{"title":"Reliable Routing Design in Predictable Wireless Networks with Unreliable Links","authors":"Mengmeng Xu, Hai Zhu, Hengzhou Xu, Jiongjiong Song, Zhen Luo","doi":"10.1109/CIS52066.2020.00020","DOIUrl":null,"url":null,"abstract":"In this paper, the reliable routing design problem is investigated in predictable wireless networks over unreliable links. The predictable wireless networks are described as a sequence of static graphs, and then modeled as a space-time graph. The reliable routing design problem on the space-time graph is defined as a bi-objective optimization problem. The aim of the new routing design problem is to find a routing path with the maximum routing reliability and the minimum routing cost. Next, a hierarchical shortest routing algorithm is proposed to find the feasible routing path. Simulation results validate the effectiveness of the proposed routing algorithm.","PeriodicalId":106959,"journal":{"name":"2020 16th International Conference on Computational Intelligence and Security (CIS)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 16th International Conference on Computational Intelligence and Security (CIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS52066.2020.00020","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In this paper, the reliable routing design problem is investigated in predictable wireless networks over unreliable links. The predictable wireless networks are described as a sequence of static graphs, and then modeled as a space-time graph. The reliable routing design problem on the space-time graph is defined as a bi-objective optimization problem. The aim of the new routing design problem is to find a routing path with the maximum routing reliability and the minimum routing cost. Next, a hierarchical shortest routing algorithm is proposed to find the feasible routing path. Simulation results validate the effectiveness of the proposed routing algorithm.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
