检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]曲阜师范大学信息科学与工程学院
出 处:《电子技术(上海)》2015年第3期43-46,42,共5页Electronic Technology
摘 要:现存的P2P信任管理模型难以准确计算节点间的信任值,导致节点在交易过程中无法有效防止节点的恶意攻击。为此,文章提出一种基于推荐信任迭代的信任管理模型TMRTI,通过在间接信任度的计算过程中引入最佳推荐链,更好地计算节点间的推荐信任值,在直接信任度的计算过程中引入历史交易成功率,进而综合评估节点的全局信任值,辅助节点进行交易对象的选择,充分体现了信任值的动态性和主观不确定性。仿真实验结果表明,文章的TMRTI模型较以往模型具有更好的动态适应性和更高的安全性。The existing P2P trust management model is difficult to exactly compute recommendation trust between two entities, which leads to unable to effectively prevent malicious recommendation in the process of transaction between two nodes. Therefore, this paper proposes a TMRTI Trust Management Model based on iteration of recommendation trust. It can compute recommendation trust better through introduction of historical trade probability in the process of computing of direct trust degree and introduction of the most priority recommend links in the process of computing of indirect mast, respectively. Then, it can comprehensively assess global trust value between nodes, assist to select object of transaction and effectively distinguish reliability from credibility, It fully reflects dynamic and subjective uncertainty of trust value. The experimental results show that the TMRTI model proposed in this paper has a better dynamic adaptation and higher security.
分 类 号:TP301[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15