摘要
为了获得一种能够适用于机会网络的社区划分算法,提出了一种基于朋友关系变迁演化的社区划分算法。首先,定义了描述节点间朋友关系强弱的朋友关系度量标准;然后,利用朋友关系度量标准和节点自身的相遇历史信息,将网络中的节点划分到不同的朋友社区中。在两种不同数据集下的实验结果表明,利用朋友关系进行社区划分可有效降低消息在传输过程中的路由开销,同时保持较高的传输成功率。
In order to obtain a community division algorithm that can be suitable for opportunistic networks,this paper proposed a community division algorithm based on the evolution of friendships.First,it defined the friendship metric that described the strength of the relationships between nodes.Then,utilizing this metric and the encounter history of nodes,it divi-ded the nodes in the networks into different friendship communities.Experiments were conducted under two different sets of data,and the experimental results show that routing overhead reduces effectively and the transmission rate still keeps a high value by using friendships to divide communities.
作者
杨荣刚
张书奎
李克清
林政宽
Yang Ronggang;Zhang Shukui;Li Keqing;Lin Zhengkuan(School of Computer Science&Technology,Soochow University,Suzhou Jiangsu 215006,China;Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks,Nanjing 210003,China;School of Computer Engineering,Suzhou Vocational University,Suzhou Jiangsu 215000,China)
出处
《计算机应用研究》
CSCD
北大核心
2018年第5期1337-1341,1354,共6页
Application Research of Computers
基金
国家自然科学基金资助项目(61672370)
苏州市前瞻性应用研究计划项目(SYG201730)
江苏省"六大人才高峰"高层次人才选拔培养资助项目(2014-WLW-010)
苏州市融合通信重点实验室资助项目(SKLCC2013XX)
关键词
机会网络
朋友关系
社区划分
数据集
opportunistic networks
friendship
community division
data set
