论文部分内容阅读
针对在计算分布式k社团成员间的介数中心性时需要获取所有最短路径问题,基于核心节点辐射量计算和扩散模型,提出了基于辐射扩散的机会网络社区构建算法.该算法主要利用节点之间的辐射关系来表示节点的介数中心性,并以这种辐射关系为基础建立以一确定节点为核心的辐射社区,由于节点可以定期接收到核心节点的辐射量,避免了节点间最短路径的计算过程.当消息转发进入目标节点的辐射社区后,即可沿着最优的方向转发至目标节点,从而获取较高的辐射社区内部消息转发效率.实验结果表明,当社区结构相对稳定时,在保证一定消息转发成功率情况下,可以取得低于Epidemic的消息转发延迟.
In order to solve all the shortest path problems when calculating the centroidity of distributed members, we propose an algorithm to build an opportunistic network community based on radiation diffusion based on the calculation and diffusion model of radiation dose at the core nodes. Between the radiation between the nodes to represent the center of the meso-number and to establish a radiation based on this radiation relationship to a certain node as the core of the radiation community, because nodes can regularly receive the radiation of the core node to avoid the shortest path between nodes When the message is forwarded to the radiation community of the target node, the message can be forwarded to the target node in the optimal direction so as to obtain a higher efficiency of message retransmission in the radiation community.The experimental results show that when the community structure is relatively stable , In ensuring a certain message forwarding success rate, you can get less than Epidemic message forwarding delay.