By Topic

An Adaptive and Robust Reputation Mechanism for P2P Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
M. Wang ; Inst. of Comput. Technol., Chinese Acad. of Sci., Beijing, China ; F. Tao ; Y. Zhang ; G. Li

Current trust mechanisms employed by the existing P2P systems are faced with various threats from malicious nodes, which have seriously affected the performance of whole system. To protect P2P network, an adaptive and robust reputation mechanism (ARRep) is proposed. ARRep balances direct trust and recommended trust according to the experience of the requester. Our contribution lies in three aspects. Firstly, a transaction decay function is adopted to distinguish the importance of direct experience. Secondly, ARRep utilizes the transaction numbers and the size of common set to gain the higher accuracy of the recommended trust value. Finally, to verify the transaction information, we develop a simple transaction validation protocol. Simulation experimental results show that ARRep is highly effective in front of on-off, bad mouthing and collusive cheating attacks.

Published in:

Communications (ICC), 2010 IEEE International Conference on

Date of Conference:

23-27 May 2010