具有不可靠链路的可预测无线网络中的可靠路由设计

2020 16th International Conference on Computational Intelligence and Security (CIS) Pub Date : 2020-11-01 DOI:10.1109/CIS52066.2020.00020

Mengmeng Xu, Hai Zhu, Hengzhou Xu, Jiongjiong Song, Zhen Luo

{"title":"具有不可靠链路的可预测无线网络中的可靠路由设计","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":"{\"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}","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

摘要

研究了基于不可靠链路的可预测无线网络中的可靠路由设计问题。将可预测无线网络描述为一系列静态图，然后将其建模为一个时空图。将空时图上的可靠路径设计问题定义为双目标优化问题。新路由设计问题的目标是寻找具有最大路由可靠性和最小路由开销的路由路径。其次，提出了一种分层最短路由算法来寻找可行的路由路径。仿真结果验证了所提路由算法的有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Reliable Routing Design in Predictable Wireless Networks with Unreliable Links

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2020 16th International Conference on Computational Intelligence and Security (CIS)

自引率

0.00%

发文量