欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
针对传统最短路径算法不适用于延迟容忍网络（DTN）路由选择以及DTN路由选择的特性，提出了一种基于跳数、权值随时间变化（HTC）的最短路径算法．该算法的设计不仅考虑到节点间空间因素，还考虑了无线链路的时间因素和该算法的复杂度与正确性．仿真结果表明，与现有的最早接触（FC）路由算法以及最小预期时延（MED）路由算法相比，此算法可更有效地得到DTN中时延最短的路径．
英文摘要：
The traditional shortest path algorithm is not suitable for the routing choice in delay tolerant networks （DTN）. According to the routing features in DTN, a new shortest path algorithm hop-based, time-varying cost （HTC） is proposed based on the hop and the cost varied with the time. The design of the routing algorithm not only considers the space factor between the nodes in DTN, but also the time factor of the wireless links and the complexity and accuracy. Simulation compared with the existing routing algorithm such as first contact （FC）, minimum expected delay （MED）, indicate that the algorithm proposed by this paper is more effective to get the shortest path.
位置：
同期刊论文项目
