CASPaR: Congestion Avoidance Shortest Path Routing for Delay Tolerant Networks

Identifier

etd-11202015-150636

Author

Michael F. Stewart, Louisiana State University and Agricultural and Mechanical CollegeFollow

Degree

Master of Science (MS)

Department

Computer Science

Document Type

Thesis

Abstract

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.

Date

2015

Document Availability at the Time of Submission

Release the entire work immediately for access worldwide.

Recommended Citation

Stewart, Michael F., "CASPaR: Congestion Avoidance Shortest Path Routing for Delay Tolerant Networks" (2015). LSU Master's Theses. 355.
https://repository.lsu.edu/gradschool_theses/355

Committee Chair

Kannan, Rajgopal

DOI

10.31390/gradschool_theses.355