Navigation on temporal networks.

IF 1.3 Q3 COMPUTER SCIENCE, THEORY & METHODS
Applied Network Science Pub Date : 2025-01-01 Epub Date: 2025-03-20 DOI:10.1007/s41109-025-00697-9
Omar F Robledo, Petter Holme, Huijuan Wang
{"title":"Navigation on temporal networks.","authors":"Omar F Robledo, Petter Holme, Huijuan Wang","doi":"10.1007/s41109-025-00697-9","DOIUrl":null,"url":null,"abstract":"<p><p>Temporal networks, whose network topology changes over time, are used to represent, e.g., opportunistic mobile networks, vehicle networks, and social contact networks, where two mobile devices (autos or individuals) are connected only when they are close to (interact with) each other. Such networks facilitate the transfer of information. In this paper, we address the problem of navigation on temporal networks: how to route a traffic demand from a source <i>s</i> to a destination <i>d</i> at time <math><msub><mi>t</mi> <mi>s</mi></msub> </math> , based on the network observed before <math><msub><mi>t</mi> <mi>s</mi></msub> </math> ? Whenever the node hosting the information has a contact or interacts with another node, the routing method has to decide whether the information should be forwarded to the contacted node or not. Once the information is forwarded, the contacted node becomes the only node hosting the information. Firstly, we introduce a framework of designing navigation algorithms, in which a distance metric is defined and computed between any node to the target <i>d</i> based on the network observed before <math><msub><mi>t</mi> <mi>s</mi></msub> </math> . Whenever a hosting node has a contact, it forwards the information to the contacted node if the contacted node is closer to the target than the hosting node according to the distance metric. Secondly, we propose systematically distance metrics of a node pair in the temporal network observed, that capture different network properties of a node pair. Thirdly, these metrics or routing strategies are evaluated in empirical contact networks, from the perspective of the time duration of the routing and the probability that the destination can be reached. Their performance is further explained via the correlation between distance metrics and the stability of each metric in ranking nodes' distance to a target node. This work may serve as inspiration for evaluating and redesigning these strategies in other types of networks beyond physical contact networks.</p>","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":"10 1","pages":"7"},"PeriodicalIF":1.3000,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11926000/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Network Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s41109-025-00697-9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/3/20 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Temporal networks, whose network topology changes over time, are used to represent, e.g., opportunistic mobile networks, vehicle networks, and social contact networks, where two mobile devices (autos or individuals) are connected only when they are close to (interact with) each other. Such networks facilitate the transfer of information. In this paper, we address the problem of navigation on temporal networks: how to route a traffic demand from a source s to a destination d at time t s , based on the network observed before t s ? Whenever the node hosting the information has a contact or interacts with another node, the routing method has to decide whether the information should be forwarded to the contacted node or not. Once the information is forwarded, the contacted node becomes the only node hosting the information. Firstly, we introduce a framework of designing navigation algorithms, in which a distance metric is defined and computed between any node to the target d based on the network observed before t s . Whenever a hosting node has a contact, it forwards the information to the contacted node if the contacted node is closer to the target than the hosting node according to the distance metric. Secondly, we propose systematically distance metrics of a node pair in the temporal network observed, that capture different network properties of a node pair. Thirdly, these metrics or routing strategies are evaluated in empirical contact networks, from the perspective of the time duration of the routing and the probability that the destination can be reached. Their performance is further explained via the correlation between distance metrics and the stability of each metric in ranking nodes' distance to a target node. This work may serve as inspiration for evaluating and redesigning these strategies in other types of networks beyond physical contact networks.

时间网络导航。
时态网络,其网络拓扑结构随时间变化,用于表示机会移动网络、车辆网络和社会联系网络,其中两个移动设备(汽车或个人)只有在彼此接近(相互作用)时才连接。这种网络促进了信息的传递。在本文中,我们解决了时间网络上的导航问题:如何根据在t s之前观察到的网络,在t s时刻将流量需求从源s路由到目的地d ?每当承载信息的节点有联系人或与另一个节点交互时,路由方法必须决定是否应将信息转发到所联系的节点。一旦信息被转发,所联系的节点就成为唯一承载该信息的节点。首先,我们引入了一种导航算法设计框架,该框架基于t s之前观察到的网络,定义并计算任意节点到目标d之间的距离度量。每当托管节点有一个联系人时,根据距离度量,如果被联系的节点比托管节点更接近目标,则它将信息转发给被联系的节点。其次,我们系统地提出了观察到的时间网络中节点对的距离度量,以捕获节点对的不同网络属性。第三,从路由持续时间和到达目的地概率的角度,在经验接触网络中对这些度量或路由策略进行评估。它们的性能通过距离指标和每个指标在排序节点到目标节点的距离中的稳定性之间的相关性进一步解释。这项工作可能为在物理接触网络之外的其他类型的网络中评估和重新设计这些策略提供灵感。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Applied Network Science
Applied Network Science Multidisciplinary-Multidisciplinary
CiteScore
4.60
自引率
4.50%
发文量
74
审稿时长
5 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信