【摘要】 在容迟网络(delay tolerant networks,DTNs)中,由于节点间端到端连接的不稳定性,传统路由算法不再适合容迟网络。文章根据节点访问社区的历史信息定义节点的友好社区,并提出了一种基于友好社区的路由算法(friend community-based routing algorithm,FCR)。在该算法中,源节点首先将数据包传递给自身的友好社区访问接入点(access point,AP),然后源节点的友好社区AP选择本社区中与目的节点友好社区AP接触次数最多的节点作为中继点。从而数据包被快速地传递到目的节点的友好社区,并最终由目的节点的友好社区AP将数据包传递到目的节点。仿真实验结果表明,与著名的Epidemic、Label和SGBR算法相比,该算法在保证接近Epidemic算法达到最大传递率的情况下,仍然可以明显地节约网络拷贝数。更多还原

【Abstract】 Due to the intermittent and uncertain network connectivity in delay tolerant networks(DTNs),the traditional routing algorithms are not suitable for DTNs.In this paper,according to the history information of node contacting with communities,the friend community of nodes is defined,and a friend community-based routing algorithm(FCR)is proposed.In FCR,the source node firstly selects the access point(AP)of its friend community,and then the AP of the friend community of the source node selects the node which has contacted with the AP of the friend community of the destination node most as the relay node to forward the packet to the AP of the friend community of the destination node efficiently.Finally,the AP of the friend community of the destination node forwards the packet to the destination node directly.The simulation results show that compared with Epidemic,Label and SGBR routing algorithms,the proposed routing algorithm greatly reduces the copy numbers under the premise of closing to the maximum delivery ratio obtained by Epidemic algorithm.更多还原