Navigation on temporal networks

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 <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:msub><mml:mi>t</mml:mi> <mml:mi>s</mml:mi></mml:msub> </mml:math> , based on the network observed before <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:msub><mml:mi>t</mml:mi> <mml:mi>s</mml:mi></mml:msub> </mml: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 <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:msub><mml:mi>t</mml:mi> <mml:mi>s</mml:mi></mml:msub> </mml: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.

Authors

Institutions

Publication Details

Journal
Applied Network Science
Published
2025-03-20
DOI
https://doi.org/10.1007/s41109-025-00697-9
Citations
1
Primary Topic
Opportunistic and Delay-Tolerant Networks
Type
article
Field-Weighted Citation Impact
1.49

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Navigation on temporal networks

Omar F. Robledo, Petter Holme, Huijuan Wang
1 citations
Applied Network Science
Opportunistic and Delay-Tolerant Networks
1.49
article

Navigation on temporal networks

Omar F. Robledo, Petter Holme, Huijuan Wang
article en
1 citations

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 <i>s</i> to a destination <i>d</i> at time <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:msub><mml:mi>t</mml:mi> <mml:mi>s</mml:mi></mml:msub> </mml:math> , based on the network observed before <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:msub><mml:mi>t</mml:mi> <mml:mi>s</mml:mi></mml:msub> </mml: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 <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:msub><mml:mi>t</mml:mi> <mml:mi>s</mml:mi></mml:msub> </mml: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.

Applied Network ScienceVol. 10(1)
Kobe University (JP), Delft University of Technology (NL), Aalto University (FI)
Technische Universiteit Delft, Nederlandse Organisatie voor Wetenschappelijk Onderzoek, Japan Society for the Promotion of Science
Reduced inequalities
Openalex Percentile: Top 19%
Opportunistic and Delay-Tolerant Networks
1.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.