Evaluation of Road Network Effectiveness with Rank-Based Random Walk

2024 18th International Conference on Ubiquitous Information Management and Communication (IMCOM) Pub Date : 2024-01-03 DOI:10.1109/IMCOM60618.2024.10418378

Da-Young Lee, Hwan-Gue Cho

{"title":"Evaluation of Road Network Effectiveness with Rank-Based Random Walk","authors":"Da-Young Lee, Hwan-Gue Cho","doi":"10.1109/IMCOM60618.2024.10418378","DOIUrl":null,"url":null,"abstract":"Research into efficient routing algorithms within general graph networks has been extensively conducted. However, there has been limited exploration regarding the effectiveness of road networks when specific routing techniques are applied, and the characteristics of real road networks. Although routing characteristics have been theoretically and experimentally well-established for geometric graph types like the Delaunay graph, it is important to note that these differ significantly from real-world road networks. In response to this gap in research, we introduce a novel rank-based random walk model that integrates deterministic online routing and random walk. Our evaluation of road network effectiveness is grounded in the success rates observed when applying online routing to actual road networks. Additionally, we provide specific conditions for ensuring favorable success rates within each road network, along with appropriate routing strategies. This approach allows us to effectively characterize road networks.","PeriodicalId":518057,"journal":{"name":"2024 18th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"351 4-5","pages":"1-8"},"PeriodicalIF":0.0000,"publicationDate":"2024-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2024 18th International Conference on Ubiquitous Information Management and Communication (IMCOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMCOM60618.2024.10418378","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

Abstract

Research into efficient routing algorithms within general graph networks has been extensively conducted. However, there has been limited exploration regarding the effectiveness of road networks when specific routing techniques are applied, and the characteristics of real road networks. Although routing characteristics have been theoretically and experimentally well-established for geometric graph types like the Delaunay graph, it is important to note that these differ significantly from real-world road networks. In response to this gap in research, we introduce a novel rank-based random walk model that integrates deterministic online routing and random walk. Our evaluation of road network effectiveness is grounded in the success rates observed when applying online routing to actual road networks. Additionally, we provide specific conditions for ensuring favorable success rates within each road network, along with appropriate routing strategies. This approach allows us to effectively characterize road networks.

查看原文本刊更多论文

用基于等级的随机漫步评估路网效果

对一般图形网络中的高效路由算法进行了广泛的研究。然而，对于道路网络在应用特定路由技术时的有效性以及真实道路网络的特点，研究还很有限。虽然从理论和实验上已经很好地确定了德劳内图等几何图类型的路由特性，但必须注意的是，这些特性与真实世界的道路网络有很大不同。针对这一研究空白，我们引入了一种新颖的基于等级的随机行走模型，该模型将确定性在线路由和随机行走融为一体。我们对道路网络有效性的评估基于在实际道路网络中应用在线路由时观察到的成功率。此外，我们还提供了在每个道路网络中确保有利成功率的具体条件，以及适当的路由策略。通过这种方法，我们可以有效地描述道路网络的特征。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

2024 18th International Conference on Ubiquitous Information Management and Communication (IMCOM)

自引率

0.00%

发文量