Font Size: a A A

A New Data Forwarding Algorithm Based On Cumulative Performance And Transient Performance In DTNs

Posted on:2016-02-11Degree:MasterType:Thesis
Country:ChinaCandidate:J ShenFull Text:PDF
GTID:2308330473461294Subject:Computational Mathematics
Abstract/Summary:PDF Full Text Request
Delay tolerant networks is a new kind of self-organizing networks that has long delay, frequent intermittently connection, and low node density. So it is difficult to maintain the stability of end-to-end path. In the introduction, we detailed introduces the recently research works, network characteristics and application fields of DTNs.DTNs mainly uses the storage-carry-forwarding mechanism, the source node choose a appropriate relay node to carry data. The relay node looks for the destination node or other better relay nodes for the data forwarding of packets, eventually carry the data to the destination node during jump forwarding. Therefore, when designing the routing strategy, the key problem is how to utilize the frequent change characteristics of the network topology to select the optimal relay nodes. In the second chapter we summarize some related routing mechanism, and focus on classifying the unicast routing.Most routing forwarding algorithms only consider the cumulative contact situation between the network node and the destination node, but in DTNs the frequent change of network topology can cause a lot of transient contact opportunities between the network node and the destination node. In order to make the fullest use of these transient contact situations, chapter 4 proposes a new data forwarding algorithm based on cumulative performance and transient performance. It combines the cumulative performance and transient conditions between the network node and the destination node. We can choose a better relay node, so as to more effectively improve the network performance. The paper uses a realistic trace file for the simulation, and compared the proposed algorithm with the two classic routing algorithms of Epidemic and Label. The experimental results show that the proposed algorithm can obviously reduce the network overhead compared with Epidemic algorithm and Label algorithm, and is close to the maximum delivery rate obtained by Epidemic algorithm.
Keywords/Search Tags:Cumulative performance, Transient performance, Data forwarding
PDF Full Text Request
Related items