基于信任关系的P2P网络路由机制

Jie Xu, Xiaolin Liu, Keping Long
{"title":"基于信任关系的P2P网络路由机制","authors":"Jie Xu, Xiaolin Liu, Keping Long","doi":"10.1109/ICCT.2010.5689133","DOIUrl":null,"url":null,"abstract":"The traditional P2P routing algorithms generally don't consider the routing security. This paper proposes a new trusted routing mechanism based on trust degree for P2P network. The assessment and calculation of trust degree is the key to achieve the secure routing mechanism. In this paper, an improved method to define trust degree is presented. And then, we present the improved trusted routing mechanism based on trust degree. At end of this paper, some simulations and analysis for network problems, such as bad mouthing attacks, self-faults problems and conflict behavior attacks, show that this scheme is helpful to detect which node is more reliable and make honest nodes play a more important part in the network, and make malicious nodes to the edge of network. This study can increase the communication efficiency and improves the survivability of P2P network.","PeriodicalId":253478,"journal":{"name":"2010 IEEE 12th International Conference on Communication Technology","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A routing mechanism based on trust relationship for P2P networks\",\"authors\":\"Jie Xu, Xiaolin Liu, Keping Long\",\"doi\":\"10.1109/ICCT.2010.5689133\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The traditional P2P routing algorithms generally don't consider the routing security. This paper proposes a new trusted routing mechanism based on trust degree for P2P network. The assessment and calculation of trust degree is the key to achieve the secure routing mechanism. In this paper, an improved method to define trust degree is presented. And then, we present the improved trusted routing mechanism based on trust degree. At end of this paper, some simulations and analysis for network problems, such as bad mouthing attacks, self-faults problems and conflict behavior attacks, show that this scheme is helpful to detect which node is more reliable and make honest nodes play a more important part in the network, and make malicious nodes to the edge of network. This study can increase the communication efficiency and improves the survivability of P2P network.\",\"PeriodicalId\":253478,\"journal\":{\"name\":\"2010 IEEE 12th International Conference on Communication Technology\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE 12th International Conference on Communication Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCT.2010.5689133\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 12th International Conference on Communication Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCT.2010.5689133","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

传统的P2P路由算法一般不考虑路由的安全性。提出了一种基于信任程度的P2P网络可信路由机制。信任程度的评估与计算是实现安全路由机制的关键。本文提出了一种改进的信任度定义方法。在此基础上,提出了改进的基于信任程度的可信路由机制。最后,通过对恶意攻击、自错攻击、冲突行为攻击等网络问题的仿真分析表明,该方案有助于检测出哪个节点更可靠,使诚实节点在网络中发挥更大的作用,使恶意节点走向网络边缘。该研究可以提高P2P网络的通信效率和生存性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A routing mechanism based on trust relationship for P2P networks
The traditional P2P routing algorithms generally don't consider the routing security. This paper proposes a new trusted routing mechanism based on trust degree for P2P network. The assessment and calculation of trust degree is the key to achieve the secure routing mechanism. In this paper, an improved method to define trust degree is presented. And then, we present the improved trusted routing mechanism based on trust degree. At end of this paper, some simulations and analysis for network problems, such as bad mouthing attacks, self-faults problems and conflict behavior attacks, show that this scheme is helpful to detect which node is more reliable and make honest nodes play a more important part in the network, and make malicious nodes to the edge of network. This study can increase the communication efficiency and improves the survivability of P2P network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信