Download now Free registration required
The non-existence of an end-to-end path poses a challenge in adapting traditional routing algorithms to Delay Tolerant Networks (DTNs). Previous works have covered centralized routing approaches based on deterministic mobility, ferry-based routing with deterministic or semi-deterministic mobility, flooding-based approaches for networks with general mobility, and probability-based routing for semi-deterministic mobility models. Unfortunately, none of these methods can guarantee both scalability and delivery. This paper extends the investigation of scalable deterministic routing in DTNs with repetitive mobility based on the previous works.
- Format: PDF
- Size: 325.1 KB