{"title":"基于动态分组的移动P2P网络信任模型","authors":"Meijuan Jia, Huiqiang Wang, Bin Ye, Yan Wang","doi":"10.1109/SCC.2016.121","DOIUrl":null,"url":null,"abstract":"With the rapid proliferation of wireless networks and mobile devices, Mobile Peer-to-Peer (MP2P) networks have attracted a huge amount of users for resource sharing. However, in an MP2P network, peers frequently join and leave the network, which makes the network topology dynamically change. Thus, it is difficult to establish long term and effective trust relationship among peers, making trust management become a challenging task. In this paper, we propose a dynamic grouping-based trust model DGTM, to classify peers. A group is formed according to the peers' interests. The experiments illustrate that our proposed dynamic grouping-based trust model DGTM always achieves the highest successful transaction rate under different circumstances.","PeriodicalId":115693,"journal":{"name":"2016 IEEE International Conference on Services Computing (SCC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A Dynamic Grouping-Based Trust Model for Mobile P2P Networks\",\"authors\":\"Meijuan Jia, Huiqiang Wang, Bin Ye, Yan Wang\",\"doi\":\"10.1109/SCC.2016.121\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the rapid proliferation of wireless networks and mobile devices, Mobile Peer-to-Peer (MP2P) networks have attracted a huge amount of users for resource sharing. However, in an MP2P network, peers frequently join and leave the network, which makes the network topology dynamically change. Thus, it is difficult to establish long term and effective trust relationship among peers, making trust management become a challenging task. In this paper, we propose a dynamic grouping-based trust model DGTM, to classify peers. A group is formed according to the peers' interests. The experiments illustrate that our proposed dynamic grouping-based trust model DGTM always achieves the highest successful transaction rate under different circumstances.\",\"PeriodicalId\":115693,\"journal\":{\"name\":\"2016 IEEE International Conference on Services Computing (SCC)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE International Conference on Services Computing (SCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCC.2016.121\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Services Computing (SCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCC.2016.121","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Dynamic Grouping-Based Trust Model for Mobile P2P Networks
With the rapid proliferation of wireless networks and mobile devices, Mobile Peer-to-Peer (MP2P) networks have attracted a huge amount of users for resource sharing. However, in an MP2P network, peers frequently join and leave the network, which makes the network topology dynamically change. Thus, it is difficult to establish long term and effective trust relationship among peers, making trust management become a challenging task. In this paper, we propose a dynamic grouping-based trust model DGTM, to classify peers. A group is formed according to the peers' interests. The experiments illustrate that our proposed dynamic grouping-based trust model DGTM always achieves the highest successful transaction rate under different circumstances.