A social networks routing algorithm of resisting sybil attack based on P2P

Article type: Research Article

Authors: Jia, Xiaoqiang

Affiliations: School of Network Security and Information, Weinan Normal University, Weinan 714099, Shaanxi, China. Fax: +86 0913 2133 965; E-mail: xqjia@126.com

Abstract: Social Networks (SN) have become popular because they make communication more easier. Most of current Social Networks are based on the client/server model, where servers, bandwidth and maintaining costs increase with the number of users increasing. P2P technology can reduce these costs. However, in P2P network, there are some malicious peers forging identity to interrupt routing, which is called Sybil attack. Current Sybil-proof P2P networks need large routing information for supporting routing to avoid Sybil attack. But a large size routing table constrains the scalability of the system, and scalability for P2P networks is a very important parameter. In this research, a routing algorithm based on P2P was constructed to fill the requirement of SN which have a good performance in term of Sybil-Proof and reasonable size of routing table. Node reputation value and the logic distance from the current node to the destination node is as routing path selection factors. During this, Uncertainty theory is introduced to obtain more accurate results. In order to enhance the probability of routing success, the routing between friends' nodes were chosen. When to route between friends nodes, introducing comparative rules can decide the logic distance from the next routing nodes to the target nodes and select appropriate routing path. After it, the routing algorithm will abandon some routing path with small opportunity to reach the destination so as to avoid the flooding occurs in the network and reduce the risk of being attacked by the witch attack. Finally the performance of the algorithm has been verified on PeerSim simulation platform, simulation experiments have proved that the social network based on P2P has better performance to meet with a reasonable size of routing table for defending witch attack. Under the same condition, the routing table size of the algorithm is lower than Whānau method, and the ratio of routing success is more than the ``Sprout'', ``Whānau'' and ``Chord'' method.

Keywords: Social networks, sybil attack, reputation mechanism, uncertainty theory, logical distance

DOI: 10.3233/JCM-160699

Journal: Journal of Computational Methods in Sciences and Engineering, vol. 16, no. 4, pp. 877-898, 2016