基于两阶段聚类的机会社会网络路由算法  

An Opportunistic Social Networks Routing Based on Two-Step Clustering

作　　者：张淯舒 王慧强[1] 冯光升[1] 吕宏武[1] 温秀秀 

机构地区：[1]哈尔滨工程大学计算机科学与技术学院,哈尔滨150001

出　　处：《电子科技大学学报》2017年第4期607-613,共7页Journal of University of Electronic Science and Technology of China

基　　金：国家自然科学基金(61370212,61402127,61502118);教育部高等学校博士点基金优先发展领域项目(20122304130002);中央高校基本科研业务费专项资金(HEUCF100601)

摘　　要：为提升机会社会网络路由过程中消息投递率、降低消息平均时延,对其消息转发过程进行了研究,提出一种基于两阶段聚类分析的机会社会网络路由算法。以分组路由策略为基础,通过两阶段聚类分析方法降低簇划分过程对节点资源的需求,并分别为簇内/间消息设计转发策略,优化了消息转发与中继节点选取的过程。此外,在聚类分析的过程中引入事件链分析的方法,深入挖掘节点间的内在社会关联,提高簇划分的准确性。仿真结果表明,在大规模复杂网络环境中该算法能够提高投递率5%~10%,降低投递时延10%以上,而在资源不足的情况下也能够获得接近80%的投递率。In order to increase the delivery rate and reduce the transmission delay of messages in the process of routing, an opportunistic social networks routing based on two-step clustering is presented. The method of two-step clustering is used to reduce the resource requirements for nodes, and different forwarding strategies are applied to inter-message and intra-message respectively, aiming to optimize the process of message forwarding and relay node choosing. Besides, the chain of events is used in clustering to analyze internal social relationship between nodes, which can improve the accuracy of clustering. Our evaluations show that the protocol can lead to a 5-10% increase in delivery ratio and a 10% at least decrease in delivery delay in large complex networks, and get about 80% of messages delivered in networks with insufficient resources of comDutine and storage.

关 键 词：事件链 聚类 机会社会网络 路由 社会网络分析 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]