一种基于分簇的机会网络路由算法

Cluster-based Opportunistic Network Data Delivery Algorithm

针对机会网络中节点相遇但传输信息失败而带来的资源浪费问题,提出一种基于节点分簇的数据传输算法COND.根据节点自身和节点间的特性,设计了以节点间成功传输信息的次数为分簇指标对节点进行分簇的方法,同时根据中继节点和目标节点的关系转发消息,从而高效地将消息投递到目的节点,并提高了节点间传输信息的成功率.仿真结果验证了通过上述节点分簇算法和信息转发方式,COND能够提高消息投递成功率和降低网络的资源消耗.

In order to solve the problem of the waste of resources which were caused by unsuccessful information delivery when the nodes met in the opportunistic network, a cluster-based opportunistic network data delivery algorithm （COND） was proposed. Based on the characteristics between nodes and the characteristics of the node itself, a method was designed for clustering nodes with the clustering index of the number of successfully transferring information between nodes. The message would be forwarded and delivered efficiently to the destination node based on the relationship between the relay node and the destination node. The delivery ratio was improved. The simulation results showed that the message delivery ratio could be improved and resource consumption of the network could be reduced by COND.