Probabilistic routing in intermittently connected networks
Luleå University of Technology · Electronics and Telecommunications Research Institute
Indexed incrossref
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.
Citation impact
2,284
total citations
- FWCI
- 13.41
- Percentile
- 100%
- References
- 22
Citations per year
Authors
3Topics & keywords
Topics
Keywords
- Computer science
- Computer network
- Probabilistic logic
- Routing protocol
- Dynamic Source Routing
- Link-state routing protocol
- Routing (electronic design automation)
- Geographic routing
No related works found for this paper.