CASPaR: Congestion Avoidance Shortest Path Routing for Delay Tolerant Networks
Unlike traditional TCP/IP-based networks, Delay and Disruption Tolerant Networks (DTNs) may experience connectivity disruptions and guarantee no end-to-end connectivity between source and destination. As the popularity of DTNs continues to rise, so does the need for a robust and low latency routing...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
LSU
2015
|
| Subjects: | |
| Online Access: | http://etd.lsu.edu/docs/available/etd-11202015-150636/ |
| Summary: | Unlike traditional TCP/IP-based networks, Delay and Disruption Tolerant Networks (DTNs) may experience connectivity disruptions and guarantee no end-to-end connectivity between source and destination. As the popularity of DTNs continues to rise, so does the need for a robust and low latency routing protocol
capable of connecting not only DTNs but also densely populated, dynamic hybrid DTN-MANET.
Here we describe a novel DTN routing algorithm referred to as Congestion Avoidance Shortest Path Routing (CASPaR), which seeks to maximize packet delivery probability while minimizing latency. CASPaR attempts this without any
direct knowledge of node connectivity outside
of its own neighborhood. Our simulation results
show that CASPaR outperforms well-known
protocols in terms of packet delivery
probability and latency while limiting network overhead. |
|---|