DTN Routing in a Mobility Pattern Space
Jeremie Leguay, Timur Friedman, Vania Conan
Abstract
Routing in Delay Tolerant Networks (DTNs) benefits considerably if one can take advantage of knowledge concerning node mobility. The main contribution of this paper is the definition of a generic routing scheme for DTNs using a high-dimensional Euclidean space constructed upon nodes' mobility patterns. For example, nodes are represented as points having as coordinates their probability of being found in each possible location. We present simulation results indicating that such a scheme can be beneficial in a scenario inspired by studies done on real mobility traces. This work should open the way to further use of the virtual space formalism in DTN routing.
Create a lesson
Related papers
RUN-O-RAN: An O-RAN-Native Architecture Enabling Cooperative Uplink Localization
Viola Bernazzoli, Alberto Ceresoli, Ilario Filippini
NS3Learn: Transferring 5G NR Mode-2 Reception Realism from ns-3 to the Veins/SUMO Stack for Connected-Vehicle Safety Assessment
Rasheed Bello, Arthur Mukwaya, Gurcan Comert et al.
Value-Based Massive Access through Goal-Oriented Irregular Repetition Slotted ALOHA
Pietro Talli, Andrea Munari, Federico Mason et al.
STR-Agent: An LLM-Driven Agent for QoS-Aware Routing in LEO Satellite Networks
Bowen Lu, Mugen Peng, Yaohua Sun et al.
PyStream: Enhancing Video Streaming Evaluation
Samuel Radler, Leon Prüller, Emanuele Artioli et al.
Taming the Agentic RAN: Stability-Guaranteed Arbitration of Autonomous AI Agents in O-RAN
Seyed Bagher Hashemi Natanzi, Bo Tang