Work

Probabilistic routing in intermittently connected networks

Year: 2003

Type: article

Abstract: We consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exist at any time, rendering traditional routing protocols unable to deliver messages between hosts. We propose a probabilistic routing protocol for such networks.

Source: ACM SIGMOBILE Mobile Computing and Communications Review

DOI: 10.1145/961268.961272

Authors: Anders Lindgren, Avri Doria, Olov Schelén

Institutions: Luleå University of Technology, Electronics and Telecommunications Research Institute

Language: English

Topic: Opportunistic and Delay-Tolerant Networks

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

SDG: Industry, innovation and infrastructure

Open Access status: green

OpenAlex ID: W2010634640

FWCI: 20.85

Cites: 21

Cited by: 2,436

Related to: 10