文档介绍：第32 卷第9期 东 北 大 学 学 报 ( 自 然 科 学 版 ) Vol
32, No. 9
2 01 1 年 9 月 Journal p storage-carry-forw ard strategy, packet
w ill finally arrive at the destination nodes. In the storage-carry-forw ard process, routs are
constructed by considering the characteristics of the DTN. Although DTN topolog y is frequently
changing , nodes w ithin local area may be strong ly connected in a short time and thus can prov ide
a path from source or relay nodes to destination or better relay nodes. Ad hoc network routing
strateg ies are used to im prove the network performance. NS2 netw ork simulation software is used
to analy ze the validity and reliability of the proposed DTN routing algorithm. Simulation results
show that the proposed algorithm has better performances and it is suitable for DTN applications.
Key words: DT N ( delay-tolerant netw ork) ; routing; transmission probability; storage-carry-
forw ard; on-demand route
在某些网络( 例如军用移动网络) 中, 节点经 ICIR 会 议上提 出, 称 为延 迟容忍 网络, 即 DTN
[ 1]
常性的快速移动或遭遇破坏, 会引起网络拓扑剧 (delay-tolerant netw ork )
DT N 否定了 传统网
烈变化, 甚至造成网络分割, 从而不能在整个通信 络模型中的一个根本前提: 在路由或者数据包传
的过程中保证存在至少 1 条源节点到目的节点之 递期间, 存在 1 条或多条