A named data approach for DTN routing

Li, Yaoxing; Li, Yuhong; Wolf, Lars; Lingren, Anders; Ji, Wang

doi:10.1109/wd.2017.7918135

Cited by 1 publication

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We conduct extensive simulations based on the Opportunistic Network Environment (ONE) simulator, 19 which is specifically designed for evaluating DTN routing and application protocol. [20][21][22][23][24][25][26][27][28] ONE combines routing protocols with mobility modeling and visualization in one package that is easily extensible and provides a rich set of reporting and analyzing modules. A detailed description of the simulator, the ONE simulator project, and the source code are available in Kera¨nen et al 19 ONE simulator is used to compare seven well-known DTN protocols with CASPaR and its variants.…”

Section: Simulation Environments and Resultsmentioning

confidence: 99%

CASPaR: Congestion avoidance shortest path routing for delay tolerant networks

Stewart

Kannan

Dvir

et al. 2017

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Unlike traditional transmission control protocol/Internet protocol-based networks, delay/disruption tolerant networks may experience connectivity disruptions and guarantee no end-to-end connectivity between source and destination. As the popularity of delay/disruption tolerant networks continues to rise, so does the need for a robust and low-latency routing protocol. A one-copy, shortest path delay/disruption tolerant network routing protocol that addresses congestion avoidance and maximizes total network bandwidth utility is crucial to efficient packet delivery in high-load networks and is the motivation behind the development of the congestion avoidance shortest path routing. Congestion avoidance shortest path routing is designed to either route undeliverable packets ''closer'' to their destinations or hold onto them when advantageous to do so. Congestion avoidance and bottleneck minimization are integrated into its design. Moreover, congestion avoidance shortest path routing negotiates node queue differentials between neighbors similar to backpressure algorithms and maps shortest paths without any direct knowledge of node connectivity outside of its own neighborhood. Simulation results show that congestion avoidance shortest path routing outperforms well-known protocols in terms of packet delivery probability and latency and is still quite efficient in terms of overhead requirements. Finally, we explore the effectiveness of modeling a variant of congestion avoidance shortest path routing based on the resistance to current flow of electrical circuits in an attempt to further reduce network congestion. Preliminary results indicate a noticeable performance increase when this method is used.

show abstract