Poster: Probabilistic Routing in Intermittently Connected Networks

Poster: Probabilistic Routing in Intermittently Connected Networks

June 1–3, 2003 | Anders Lindgren, Avri Doria, Olov Schelén
The paper "Probabilistic Routing in Intermittently Connected Networks" by Anders Lindgren, Avri Doria, and Olov Schelén from Luleå University of Technology addresses the challenge of routing in networks where full connectivity between source and destination nodes is not guaranteed. The authors propose a probabilistic routing protocol to enable message delivery in such environments, leveraging the mobility of nodes to facilitate communication. The protocol introduces a *delivery predictability* metric at each node, which reflects the likelihood of a node encountering another node. This metric is updated based on the frequency of encounters and the transitive property of node interactions. The paper discusses related work, including epidemic routing and utility-based routing, and outlines the probabilistic routing mechanism, including the calculation of delivery predictability and decision-making processes. Future work includes the investigation of acknowledgments to optimize resource usage and extensive simulations to evaluate the protocol's performance.The paper "Probabilistic Routing in Intermittently Connected Networks" by Anders Lindgren, Avri Doria, and Olov Schelén from Luleå University of Technology addresses the challenge of routing in networks where full connectivity between source and destination nodes is not guaranteed. The authors propose a probabilistic routing protocol to enable message delivery in such environments, leveraging the mobility of nodes to facilitate communication. The protocol introduces a *delivery predictability* metric at each node, which reflects the likelihood of a node encountering another node. This metric is updated based on the frequency of encounters and the transitive property of node interactions. The paper discusses related work, including epidemic routing and utility-based routing, and outlines the probabilistic routing mechanism, including the calculation of delivery predictability and decision-making processes. Future work includes the investigation of acknowledgments to optimize resource usage and extensive simulations to evaluate the protocol's performance.
Reach us at info@study.space