an opportunistic network , the movement of nodes causes the network topology to change frequently , resulting in uncertainty in the message routing path .For nodes with social relations and frequent movement , making full use of the history information recorded by the nodes multiple times of routing can improve the efficiency and stability of message routing .Based on the above information , a mes-sage routing algorithm based on friend community path prediction was proposed .According to the historical information between nodes , the relationship intimacy between nodes was quantified , friends'communities were divided by relationship intimacy , and different mes-sage routing strategies were adopted within the community and between communities .Experiments show that the message routing algo-rithm based on the friend community path proposed in this study has advantages over the existing message routing algorithm in terms of message delivery success rate , network redundancy rate and average message delay .%机会网络中,节点的移动使得网络拓扑结构频繁发生变化,造成消息路由路径的不确定.对于具有社会关系且频繁移动的节点,充分利用节点多次路由所记录的历史信息,可以提高消息路由的高效性与稳定性.基于以上信息提出了一种基于朋友社区路径预测的消息路由算法.根据节点间历史信息量化节点间的关系亲密度,并通过关系亲密度划分朋友社区,在社区内和社区间采取不同的消息路由策略.实验表明,本文所提出的基于朋友社区路径的消息路由算法比现有消息路由算法在消息投递成功率、网络冗余率、消息平均延时多个方面具有优势
展开▼
