A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
A reputation-based trust model for peer-to-peer ecommerce communities [Extended Abstract]
Proceedings of the 4th ACM conference on Electronic commerce
Trust and Reputation Model in Peer-to-Peer Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
A reputation-based trust management system for P2P networks
CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
Trust beyond security: an expanded trust model
Communications of the ACM - Services science
Search-and-Discover in Mobile P2P Network Databases
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Decentralized trust management for ad-hoc peer-to-peer networks
Proceedings of the 4th international workshop on Middleware for Pervasive and Ad-Hoc Computing (MPAC 2006)
PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing
IEEE Transactions on Parallel and Distributed Systems
Gathering experience in trust-based interactions
iTrust'06 Proceedings of the 4th international conference on Trust Management
Hi-index | 0.00 |
Lack of trust between peers is one of the most serious drawbacks that obstruct the wide adoption of mobile p2p systems. Since current reputation schemes developed mainly for the fixed wired networks are not fit in such a scenario, new trust solutions are eagerly in demand. This paper presents a power peer-based reputation scheme, where peers are classified into two groups, power peers and mobile peers and a power peer has zero or more mobile peers. We design two ways of selecting power peers, greedy method and maximal independent set method. The proposed scheme establishes a trusted mobile environment for mobile p2p systems. It effectively avoids the communication overhead in global trust computation because each power peer maintains the appropriate reputation information of its mobile peers. The simulation results show that our scheme is highly robust and scalable in the dynamic environment of mobile networks.