基于分组的DTN路由协议

Groups based protocol for DTN

在DTN中,节点没有长时间端到端的链接,所以为了在长时间间歇性链接的环境下提供可靠的数据传输,就需要中继节点来进行数据包的存储和转发。充足的缓存空间和能源是保证DTN网络正常运行的关键,而DTN网络节点的分散性使此条件很难实现,因此,提出一种基于分组的路由协议(group based protocol for DTN,GBP),它只通过本地信息引导数据包副本到达目的节点,旨在传播少量数据包来减少网络开销。先介绍了GBP协议的原理,然后用ONE(opportunistic network environment)仿真软件对Epidemic协议,Spray and Wait协议,PRoPHET协议,MaxProp协议和GBP协议进行仿真对比,在交付成本、成功投递率、网络平均延时3个方面进行对比分析,得出GBP协议具有更好的性能。最后指出了存在的不足并提出改进措施。

In DTNs,nodes do not have end-to-end connections for long periods of time.Therefore,in order to provide reliable communications in the intermittent connection environment,intermediate nodes are required to store data packets for long periods of time.Enough buffer capacities and energy is the key to work of DTN network.The dispersion of nodes to make it difficult to implement.in this paper,we propose a social grouping based protocol（GBP） among the network nodes to maximize data delivery ratio while minimizing network overhead by efficiently spreading the packet copies in the network.Firstly,we introduce the principle of GBP,then using Opportunistic Network Environment （ONE ）-simulation software to compare the performance of Epidemic algorithm, Spray and Wait algorithm,PRoPHET algorithm,MaxProp algorithm and GBP.By comparing packet delivery cost,rate of messages delivered and average dealy,it finds that the GBP performs better.At last,the weaknesses of this paper and further improvement are also discussed.