Name
Abstract | ||
|---|---|---|
The nonexistence 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 semideterministic mobility, flooding-based approaches for networks with general mobility, and probability-based routing for semideterministic mobility models. Unfortunately, none of these methods can guarantee both scalability and delivery. In this paper, we extend the investigation of scalable deterministic routing in DTNs with repetitive mobility based on our previous works. Instead of routing with global contact knowledge, we propose a routing algorithm that routes on contact information compressed by three combined methods. We address the challenge of efficient information aggregation and compression in the time-space domain while maintaining critical information for efficient routing. Then, we extend it to handle a moderate level of uncertainty in contact prediction. Analytical studies and simulation results show that the performance of our proposed routing algorithm, DTN hierarchical routing (DHR), is comparable to that of the optimal time-space Dijkstra algorithm in terms of delay and hop count. At the same time, the per-node storage overhead is substantially reduced and becomes scalable. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/TPDS.2008.218 | IEEE Trans. Parallel Distrib. Syst. |
Keywords | Field | DocType |
information aggregation,simulation.,previous work,cyclic mobile networks,scalable deterministic routing,probability-based routing,centralized routing,delay tolerant networks dtns,hierarchical routing,routing algorithm,end-to-end path,traditional routing algorithm,contact,proposed routing algorithm,data compression,per-node storage overhead,deterministic mobility,routing protocols,dtn hierarchical routing,scalability,mobile radio,information compression,delay-tolerant networks,time-domain analysis,algorithm/protocol design and analysis,motion cycle,ferry-based routing,time-space domain,telecommunication network routing,delivery,delay-tolerant networks (dtns),scalable routing,efficient routing,mo- tion cycle,routing,dijkstra s algorithm,mobile network,simulation,wireless sensor networks,uncertainty,algorithm design and analysis,delay tolerant network,disruption tolerant networking,mobility model | Multipath routing,Link-state routing protocol,Dynamic Source Routing,Static routing,Computer science,Policy-based routing,Computer network,Destination-Sequenced Distance Vector routing,Real-time computing,Wireless Routing Protocol,Distributed computing,Zone Routing Protocol | Journal |
Volume | Issue | ISSN |
20 | 9 | 1045-9219 |
Citations | PageRank | References |
26 | 1.06 | 17 |
Authors | ||
2 | ||