论文部分内容阅读
针对传统最短路径算法不适用于延迟容忍网络(DTN)路由选择以及DTN路由选择的特性,提出了一种基于跳数、权值随时间变化(HTC)的最短路径算法.该算法的设计不仅考虑到节点间空间因素,还考虑了无线链路的时间因素和该算法的复杂度与正确性.仿真结果表明,与现有的最早接触(FC)路由算法以及最小预期时延(MED)路由算法相比,此算法可更有效地得到DTN中时延最短的路径.
In order to overcome the shortcomings of the traditional shortest path algorithm, which is not suitable for DTN routing and DTN routing, a shortest path algorithm based on hops and weights over time (HTC) is proposed. The design of this algorithm not only considers To the inter-node space factor, the time factor of the wireless link and the complexity and correctness of the algorithm are also considered.The simulation results show that compared with the existing routing algorithm of the earliest contact (FC) and the minimum expected delay (MED) routing algorithm In contrast, this algorithm can obtain the shortest path in DTN more efficiently.