| 基于选择机制的实体间最信任路径发现方法 |
| |
| 引用本文： | 周国强,曾庆凯.基于选择机制的实体间最信任路径发现方法[J].北京工业大学学报,2010,36(5). |
| |
| 作者姓名： | 周国强 曾庆凯 |
| |
| 作者单位： | 南京大学,计算机科学与技术系,南京210093;南京大学,计算机软件新技术国家重点实验室,南京210093;南京邮电大学,计算机学院,南京210003;南京大学,计算机科学与技术系,南京210093;南京大学,计算机软件新技术国家重点实验室,南京210093 |
| |
| 基金项目： | 国家自然科学基金，高等学校博士学科点专项科研基金 |
| |
| 摘 要： | 提出了一种基于选择机制的实体间最信任路径发现算法.该算法采用动态规划思想,同时利用乘关系特点和信息反馈,在计算信任路径过程中可过滤掉无关路径,解决了恶意实体干扰问题、信任路径数目爆炸问题以及回路问题.仿真结果显示,本算法能有效隔离恶意实体,同时具有通信量小,收敛性好的优点.
|
| 关 键 词： | 信任网络 信任路径 路径爆炸 恶意实体 |
An Algorithm for Finding the Most Trusted Path Between Entities Based on Selected Mechanism |
| |
| ZHOU Guo-qiang,ZENG Qing-kai.An Algorithm for Finding the Most Trusted Path Between Entities Based on Selected Mechanism[J].Journal of Beijing Polytechnic University,2010,36(5). |
| |
| Authors: | ZHOU Guo-qiang ZENG Qing-kai |
| |
| Affiliation: | ZHOU Guo-qiang1,2,3,ZENG Qing-kai1,2 (1.Department of Computer Science and Technology,Nanjing University,Nanjing 210093,China,2.State Key Laboratory for Novel Software Technology,Nanjing,210093,3.Computer Institute,Nanjing University of Posts and Telecommunication,Nanjing 210003,China) |
| |
| Abstract: | An algorithm for finding the most trusted path between entities based on selected mechanism is proposed in this paper.This algorithm can filter out irrelevant paths by using the idea of dynamic planning,leverage of the key feature of multiplication relationship and information feedback.And thus it solves the malicious entity disturbance,trust paths explosion and path loop issues.The simulation results show that this algorithm can effectively isolate malicious entities,and has the advantage of small communic... |
| |
| Keywords: | trust net trust path paths explosion malicious entity |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
