博碩士論文查詢聯邦系統首頁 聯絡信箱 關於我們 加入我們

本論文已被瀏覽 56 次, [ 造訪詳細資料與全文 ] 10 次,[ 回到前頁查詢結果 ] [ 重新搜尋 ]

CASPaR: Congestion Avoidance Shortest Path Routing for Delay Tolerant Networks.

作者:Michael F. Stewart,
畢業學校:LSU
出版單位:LSU
核准日期:2015-12-17
類型:Electronic Thesis or Dissertation
權限:unrestricted.I hereby certify that, if appropriate, I have obtained and attached herein a written permission statement from the owner(s) of each third party copyrighted matter to be included in my th....

英文摘要

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.


chair - Kannan, Rajgopal

committee_member - Busch, Konstantin

committee_member - Dvir, Amit

committee_member - Mukhopadhyay, Supratik


 

計畫贊助者: