Xiaoqian Liu, Shoubao Yang, Dong Wei, Shuling Wang
{"title":"基于电阻网络的信任评估模型","authors":"Xiaoqian Liu, Shoubao Yang, Dong Wei, Shuling Wang","doi":"10.1109/ChinaGrid.2010.39","DOIUrl":null,"url":null,"abstract":"Many trust evaluation models have been proposed for P2P networks recently. While in these models, nodes usually need to record all nodes’ trust, or the time complexity is high. In our paper, we propose a trust evaluation model based on resistive network. In which, nodes only need to record their neighbors’ trust and the time complexity is lower. The experiments and analysis show that, on the premise of accurate trust this method reduces the time complexity effectively.","PeriodicalId":429657,"journal":{"name":"2010 Fifth Annual ChinaGrid Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Trust Evaluation Model Based on Resistive Network\",\"authors\":\"Xiaoqian Liu, Shoubao Yang, Dong Wei, Shuling Wang\",\"doi\":\"10.1109/ChinaGrid.2010.39\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many trust evaluation models have been proposed for P2P networks recently. While in these models, nodes usually need to record all nodes’ trust, or the time complexity is high. In our paper, we propose a trust evaluation model based on resistive network. In which, nodes only need to record their neighbors’ trust and the time complexity is lower. The experiments and analysis show that, on the premise of accurate trust this method reduces the time complexity effectively.\",\"PeriodicalId\":429657,\"journal\":{\"name\":\"2010 Fifth Annual ChinaGrid Conference\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Fifth Annual ChinaGrid Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ChinaGrid.2010.39\",\"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 Fifth Annual ChinaGrid Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ChinaGrid.2010.39","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Trust Evaluation Model Based on Resistive Network
Many trust evaluation models have been proposed for P2P networks recently. While in these models, nodes usually need to record all nodes’ trust, or the time complexity is high. In our paper, we propose a trust evaluation model based on resistive network. In which, nodes only need to record their neighbors’ trust and the time complexity is lower. The experiments and analysis show that, on the premise of accurate trust this method reduces the time complexity effectively.