DTN中基于二分图的路由选择

Bipartite Graph-based Routing in DTN

由于DTN(delay tolerant networks)缺乏稳定的端到端传输路径,为了提高其路由协议的传输效率,减少网络延迟和开销,主要采用增加冗余数据包副本的办法.而传统的DTN路由协议往往无法有效地控制数据包副本的数量,最终导致路由性能下降.由于DTN网络中的节点具有社会属性这一特点,使得节点的移动具有一定的规律性和稳定性.首先分析了节点之间信息交换关系,证明DTN中存在二分图的性质.其次提出DTN网络中基于二分图的路由选择和具有时间因素的最优路由算法,最后给出了模拟仿真实验结果.

Due to the lack of stable end-to-end transmission path in DTN, in order to improve the transmission efficiency of the routing protocol, reducing network latency and overhead, it is mainly by adding its redundant packet pair. But the traditional DTN routing protocol can＇t effectively control the number of packet copies, eventually leads to routing performance reduction. Since each node in DTN has the characteristic of social feature, it makes that the movement of nodes has a cer- tain regularity and stability. This paper firstly analyzes the information exchange relationship between nodes, proves that there exists the property for binary chart in DTN. Secondly, we put forward the bipartite graph-based routing protocol in DTN, with time factor taken into account. Finally, it and then give the optimal routing algorithm directly gives the simulation experiment results.