A new authentication model based on CL-PKC in resource limited P2P systems
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Incentive and rebuke based reputation model for peer to peer applications
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
METrust: A mutual evaluation-based trust model for P2P networks
International Journal of Automation and Computing
SONR: A reliable reputation system of self-organized network
Journal of Network and Computer Applications
| Hi-index | 0.00 |
The P2P system is an anonymous and dynamic system, thus, some malicious behaviour can't be punished. In order to restrict the malicious behaviour in the P2P system, researchers have focused on establishing effective reputation systems. However, the present reputation system can't avoid the trick of the false reputation feedback. We propose a distributed trust-based reputation model in p2p system (TBRM) to avoid it. The TBRM algorithm differentiated the node's capability of providing honest quality by the nodes reputation value, and the honest evaluation by the trust value. In our model, the reputation value represented the resource quality of the provider, thus, other nodes would like this node have low reputation value. At this time, the false reputation feedback happened. In this paper, we used the trust value to restrict the false reputation feedback. For the nodes with low trust value was difficult to get the required resource, we punished the false reputation feedback by low their trust value. We show by both theoretical analysis and simulations that the proposed TBRM algorithm can get quick convergence which is 11 times, high equity for both low and high reputation nodes, and can get a high successful rate of file-downloading. When the malicious nodes' rate is 80%, the proposed TBRM is about 95% successful rate, compared to the algorithm without reputation who is only 27%.