Applying Hebbian Theory to Enhance Search Performance in Unstructured Social-Like Peer-to-Peer Networks
Unstructured Peer-To-Peer (p2p) networks usually employ flooding search algorithms to locate resources. However, these algorithms often require a large storage overhead or generate massive network traffic. To address this issue, previous researchers explored the possibility of building efficient p2p networks by clustering peers into communities based on their social relationships, creating social-like p2p networks. This paper proposes a social relationship p2p network that uses a measure based on Hebbian theory to create a social relation weight. The contribution of the study is twofold. First, using the social relation weight, the query peer stores and searches for the appropriate response peers in social-like p2p networks. Second, this paper designs a novel knowledge index mechanism that dynamically adapts social relationship p2p networks.