Grouping-BasedMechanismDrivenby：基于分组的驱动机制.pdfVIP

ISBN 978-952-5726-00-8 (Print), 978-952-5726-01-5 (CD-ROM) Proceedings of the 2009 International Symposium on Web Information Systems and Applications (WISA’09) Nanchang, P . R . China, May 22-24, 2009, pp . 510-515 Grouping-Based Mechanism Driven by Reputation in P2P E-Commerce Liu Tang SiChuan Normal University, College of Fundamental Education, ChengDu, China Email: first.author@ Abstract—In P2P (peer-to-peer) electronic commerce (e- reliability to “i”, so that “i” can conclude the global commerce) networks, strategic cyber frauds can lead to reputation of “k”. many security problems. To apply present trust model to e- The main problems of EigenTrust lie in the following commerce can reduce trade risk to some degree but this can aspects[2][3][4]: 1) The precondition of iteration not eliminate it completely. Taking account of peers’ convergence is unreasonable. It doesn’t offer guarantee independence, applying global trust mechanism and local trust mechanism, this article, based on relative data of for the iterative astringency; 2) It is lacking in recorded trade between peers and with the consideration punishment for bad behavior. The model doesn’t punish weighting factors including trade time, trade sum and the those peers that lead the dealing to a fai