一种基于动态规划的间断连接无线互联网络选路算法

Routing Algorithm in Intermittently Connected Wireless Network Based on the Dynamic Programming

在无线互联网络中,由于自然干扰或网络规划的需要,节点之间无线链路通常在时间上具有间断特性.我们将链路具有间断特性的无线互联网络称为间断连接无线互联网络.间断连接无线网络的路由优化问题需要联合考虑无线链路的时间和空间特性,这就为间断连接无线互联网络的选路问题提出了新的挑战.本文为这种网络提出了一种全新的选路算法——DPRA算法,该算法在链路统计特性的基础上,采用动态规划的方法,以转发时延为选路标准进行路由的选择.仿真结果表明,本文提出的算法可以有效得到间断连接无线互联网络中时延最短的路径.

Because of the natural interference or the requirement of network planning,wireless links are intermittently connected in wireless networks,which are called intermittently connected wireless networks（ICN）.The routing optimization in ICNs is a new challenge because it requires to consider the links′characteristics of both time-relevant and space-relevant.This paper proposed a novel routing algorithm,Dynamic Programming Routing Algorithm（DPRA）,for ICNs.DPRA is based on statistical characteristics of wireless links,and uses the dynamic programming method to choose the shortest delay path.Simulation results indicate that the proposed routing algorithm is effective.