A secure and efficient searching scheme for trusted nodes in a peer-to-peer network

7Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The existing search mechanisms for peer-to-peer (P2P) networks have several problems such as fake content distribution, free riding, white-washing and poor search scalability. Although, researchers have proposed several trust management and semantic community-based mechanisms for combating free riding and distribution of malicious contents, most of these schemes lack scalability due to their high computational, communication and storage overhead. This paper presents a trust management scheme for P2P networks that utilizes topology adaptation by constructing an overlay of trusted peers where the neighbors are selected based on their trust ratings and content similarities. It also increases the search efficiency by taking advantage of the implicit semantic community structures formed as a result of topology adaptation since most of the queries are resolved within the community of trustworthy peers. Simulation results demonstrate that the proposed scheme provides efficient searching to good peers while penalizing the malicious peers by increasing their search times. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Sen, J. (2011). A secure and efficient searching scheme for trusted nodes in a peer-to-peer network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6694 LNCS, pp. 100–108). https://doi.org/10.1007/978-3-642-21323-6_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free