机会网络中基于摆渡节点与簇节点相互协作的路由机制

机会网络是一种不需要在源节点和目的节点之间存在完整路径，利用节点移动带来的相遇机会实现网络通信的延迟容忍自组织网络，它以“存储-携带-处理-转发”的模式进行.为实现互不相交簇间的信息传输，本文设计了一种带阈值的簇移动模型CMMT，并提出了一种基于摆渡（Ferry）节点与簇节点协作的路由算法（CBSW）.该算法减少了冗余的通信和存储开销，以及在Spray阶段簇节点没有遇到目的节点或摆渡节点，进入Wait阶段携带消息的节点采用直接分发方式只向目的节点传输等问题.仿真实验表明，CBSW算法能够增加传输成功率，减少网络开销和传输延迟.

Routing Mechanis m Based on the Cooperation of the Ferry Nodes and Cluster Nodes in Opportunistic Networks

Opportunistic Networks are delay tolerant self-organized networks with sparse nodes,where the message propagation depends on the cooperation of nodes to fulfill a “store-carry-process-and-forward”fashion by leveraging the mobility of nodes,because there does not exist a complete path from the source to the destination in the most time.To a-chieve the communication of nodes in mutually disjoint clusters,we propose a Cluster Movement Model with Threshold (CMMT)and routing algorithm (CBSW),which is Cooperative Binary Spray and Wait routing algorithm based on the Fer-ry nodes and cluster nodes cooperation.This routing algorithm reduces of the redundancy of communication and store the cost,as well as if the destination or Ferry nodes are not found in the spraying phase,nodes carrying a message copy will for-ward the message only to its destination in the Waiting phase nodes etc.Simulation results demonstrate the effectiveness of the proposed CBSW protocol in terms of high delivery ratio,low overhead and small average delay.