中文摘要：

针对在计算分布式k社团成员间的介数中心性时需要获取所有最短路径问题,基于核心节点辐射量计算和扩散模型,提出了基于辐射扩散的机会网络社区构建算法.该算法主要利用节点之间的辐射关系来表示节点的介数中心性,并以这种辐射关系为基础建立以一确定节点为核心的辐射社区,由于节点可以定期接收到核心节点的辐射量,避免了节点间最短路径的计算过程.当消息转发进入目标节点的辐射社区后,即可沿着最优的方向转发至目标节点,从而获取较高的辐射社区内部消息转发效率.实验结果表明,当社区结构相对稳定时,在保证一定消息转发成功率情况下,可以取得低于Epidemic的消息转发延迟.

英文摘要：

To avoid the problem which need to get all the shortest path when computing the betweenness centrality of nodes in k-Community,the radiation propagation community construction algorithm was proposed,based on the radiation calculation and diffusion model of the core node.The betweenness centrality of nodes obtained by calculation radiation between nodes,and the community around a core node was constructed based on it.Because node could receive the radiation of the core nodes periodically,the process of calculating the shortest path between nodes was avoided.The packet can be forwarded to the destination node along the shortest path,after entering the destination node’s radiation propagation community,thus gaining high packet forwarding efficiency.A set of simulation results show that the proposed community construction algorithm can obtain lower message forwarding delay than Epidemic on certain message forwarding success rate when community structure is relatively stable.