Dynamic Routing with Congestion Control in Delay-Tolerant Networks
碩士 === 國立東華大學 === 資訊工程學系 === 99 === This paper proposed a solution mechanism for the decline in delivery ratio caused by network congestion in delay-tolerant networks. In order to increase transmission successful rate in this kind of network, a routing protocol will try to evaluate and find the best...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2011
|
Online Access: | http://ndltd.ncl.edu.tw/handle/16453252215299269696 |
Summary: | 碩士 === 國立東華大學 === 資訊工程學系 === 99 === This paper proposed a solution mechanism for the decline in delivery ratio caused by network congestion in delay-tolerant networks. In order to increase transmission successful rate in this kind of network, a routing protocol will try to evaluate and find the best available relay node to continue message propagation. Unlimited message replication on nodes, wrong routing decision or the lack of effective buffer management will cause the congestion to easily spread from a certain node to a certain area. Some of the existing solutions such as slowing down copy rate, setting the proportion of message duplication and performing message drops only aim to solve specific kinds of congestions and lack for a complete congestion control mechanism. This paper proposed a mechanism called Dynamic Routing with Congestion Control (DRCC) which executes different decisions to relief congestion according to different area congestion levels. Finally, this paper shows that DRCC can effectively solve the problem of the decline in delivery ratio because of congestion.
|
---|