一种基于社会网络的可信服务最大覆盖方法  

A maximum coverage method of trustworthy services based on social network

作　　者：张佩云[1,2] 黄波[3] 宫秀文[1] 

机构地区：[1]安徽师范大学数学计算机科学学院,安徽芜湖241003 [2]中国科学技术大学计算机科学与技术学院,安徽合肥230026 [3]南京理工大学计算机科学与技术学院,江苏南京210094

出　　处：《计算机工程与科学》2013年第10期36-43,共8页Computer Engineering & Science

基　　金：国家自然科学基金资助项目(61201252;61203173);中国博士后科学基金资助项目(2013M531528);安徽省自然科学基金资助项目(1308085MF100);安徽省高校省级自然科学研究重点项目(KJ2011A128);安徽省科技厅软科学研究计划项目(11020503009)

摘　　要：针对社会网络中服务覆盖时存在的不可信节点和不可信服务问题,建立社会网络可信服务覆盖模型,通过对社会网络节点与服务间的关系进行建模,识别社会网络中的优势节点与普通节点,并借助优势节点加强社会网络中服务覆盖的可信性及最大化。设计并通过路径寻优算法来发现最优覆盖路径并确保节点间的连通性。以优势节点作为可信服务覆盖的源点,设计服务覆盖算法,实现对指定覆盖半径内的可信服务最大覆盖。在社会网络服务覆盖模型下对算法进行仿真实验,验证了算法的正确性和有效性。Aiming at the existing problems of incredible nodes and services of services coverage in social network,a model of trustworthy services coverage is built up.The model represents the relationship between social network nodes and services.After recognizing the excellent nodes and ordinary nodes,it can enhance the credibility and maximum of services coverage by the excellent nodes.The optimal-pathfinding algorithm is designed to find the optimal coverage path,which can ensure the nodes connectivity.As the excellent nodes is utilized as the source nodes,the services coverage algorithm is given to achieve the maximum coverage for trustworthy services within the specified coverage radius.We evaluate the performance of our approach under the social network services coverage model.The experimental results demonstrate the effectiveness and efficiency of our approach.

关 键 词：社会网络 可信服务 优势节点 服务最大覆盖 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]