2016 International Conference on Computing, Networking and Communications (ICNC) (2016)
Kauai, HI, USA
Feb. 15, 2016 to Feb. 18, 2016
Michael F. Stewart , Department of Computer Science, Louisiana State University, USA
Rajgopal Kannan , Department of Computer Science, Louisiana State University, USA
Amit Dvir , Cyber Technology Innovation Center, Department of Computer Science, Ariel University, Israel
Bhaskar Krishnamachari , Ming Hsieh Dept. of EE, University of Southern California, USA
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. This paper describes 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.
Congestion Control, DTN, Routing
M. F. Stewart, R. Kannan, A. Dvir and B. Krishnamachari, "CASPaR: Congestion avoidance shortest path routing for delay tolerant networks," 2016 International Conference on Computing, Networking and Communications (ICNC), Kauai, HI, USA, 2016, pp. 1-5.