一种可扩展的反馈信任信息聚合算法  

Novel Scalable Aggregation Algorithm of Feedback Trust Information

作　　者：李小勇[1] 桂小林[1] 赵娟[1] 冯大鹏[1] 

机构地区：[1]西安交通大学电子与信息工程学院,西安710049

出　　处：《西安交通大学学报》2007年第8期879-883,共5页Journal of Xi'an Jiaotong University

基　　金：国家自然科学基金资助项目(60273085);国家高技术研究发展计划资助项目(2002AA104310);教育部新世纪优秀人才计划资助项目(NCET-05-0829)

摘　　要：针对现有的动态信任聚合算法中利用基于信任链的广播方式进行反馈信任信息搜索而导致的系统运算收敛慢、可扩展性差等问题,建立了直接信任树(DTT)的概念,并基于DTT提出了一种新的可扩展的反馈信任信息聚合算法.根据节点之间的直接信任关系构建DTT,然后利用DTT进行反馈信任信息搜索,同时引入质量因子和距离因子两个参数来自动调节聚合计算的规模.仿真实验表明,算法能够显著提高反馈信任信息聚合计算的收敛性,具有较好的恶意反馈行为检测能力,在恶意节点比率增大时,算法也表现出较强的稳健性.Focusing on the problem that current dynamic trust aggregation algorithms searching for feedback trust information is based on trust chain in broadcast way, leading to slow in convergence and bad in scalability, a new scalable feedback trust information aggregation algorithm is proposed, in which the concept and definition of direct trust tree （DTT） are presented. Based on DTT a novel aggregating algorithm of scalable feedback trust information is proposed, and the DTT is constructed according to node＇s direct trust relation. Then, the feedback trust informa- tion is searched by using DTT instead of in broadcast manner. Two new parameters, quality factor and distance factor, are introduced to adjust the scale of aggregating computation automatically. Simulation results show that the algorithm remarkably enhances the convergence of feedback trust information aggregating computation. Moreover, it has better detecting capability against malicious feedback actions and has stronger robustness when the ratio of malicious nodes is increased.

关 键 词：信任信息搜索 聚合算法 直接信任树 可扩展性 

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