Sage Journals: Discover world-class research

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

Get full access to this article

View all access options for this article.

References

Yang

, Zhou

and Zhang

, A practical traceback mechanism in wireless sensor networks, Acta Electronica Sinica 37(1) (2009), 202-206.

Wang

, Xu

, Wu

and Zhou

, Link prediction in social networks: The state-of-the-art, Science China Information Sciences 58(1) (2015), 1-38.

Buchegger

and Datta

, A case for P2P infrastructure for social networks - opportunities and challenges, The 6th International Conference on Wireless on-demand Network Systems and Services, in USA, (2009).

Zhao

, Chen

and Tan

, Trust model based on improved DyTrust in P2P network, Computer Technology and Development 24(10) (2014), 175-177.

Leskovec

, Huttenlocher

and Kleinberg

, Predicting positive and negative links in online social networks, in: Proceedings of the 19th International Conference on World Wide Web, in USA, 2010.

, Dong

and Wang

, Defense mechanism against node replication attacks and sybil attacks in wireless sensor networks, Acta Electronica Sinica 43(4) (2015), 744-752.

, Shi

, Kaminsky

, Gibbons

P.B.

and Xiao

, DSybil: Optimal sybil-resistance for recommendation systems, IEEE Symposium on Security and Privacy, in Oakland, (2009).

Danezis

and Mittal

, SybilInfer: Detecting sybil nodes using social networks, NDSS, in San Diego, (2009).

Clauset

, Moore

and Newman

M.E.J.

, Hierarchical structure and the prediction of missing links in networks, Nature 453 (2008), 98-101.

10.

Danezis

, Lesniewski-Laas

, Kaashoek

M.F.

and Anderson

R.J.

, Sybil-resistant DHT routing, ESORICS 3679 (2005), 305-318.

11.

Singh

, Ngan

T.-W.

, Druschel

and Wallach

D.S.

, Eclipse attackson overlay networks: Threats and defenses, Infocom, in Spain, (2006).

12.

Lesniewski-Lass

and Kaashoek

M.F.

, Whānau: A sybil proof distributed hash table, in: 7th Usenix Symposium on Network Design and Implementation, (2010), 3-17.

13.

, Kaminsky

, Gibbons

P.B.

and Flaxman

, Sybil guard: Defending against sybil attacks via social networks, SIGCOMM 3(16) (2006), 576-589.

14.

Tran

D.N.

, Min

, Li

and Subramanian

, Sybil-resilient online content rating, NSDI 2(27) (2009), 1-15.

15.

Danezis

and Mittal

, SybilInfer: Detecting sybil nodes using social networks, NDSS in San Diego, (2009).

16.

Levine

B.N.

, Shields

and Margolin

N.B.

, A survey of solutions to the sybil attack, University of Massachusetts Amherst, 2006.

17.

Singh

, Ngan

T.-W.

, Druschel

and Wallach

D.S.

, Eclipse attacks on overlay networks: Threats and defenses, Infocom, in Spain, (2006).

18.

Xing

, Zhang

and Jia

, Trust based latent factor model for social recommendation, Computer Science 41(1) (2014), 163-167.

19.

Qiao

, Yang

, Li

and Cheng

, A trust calculating algorithm based on social networking service users' context, Chinese Journal of Computers 34(1) (2011), 2407-2409.

20.

Jiang

, Research and simulation on information trust calculation model of P2P network nodes, The computer simulation 31(1) (2014), 298-301.

21.

and Wu

, Mobility reduces uncertainty in manets, Computer Communications (2007).

22.

Zhang

, Yang

and Zhang

, Churn problems research in P2P network, Journal of Software 20(5) (2009), 1362-1376.

23.

Hoffman

, Zage

and Nita-Rotaru

, A survey of attack and defense techniques for reputation systems, ACM Comput Surv 42(1) (2009), 31.

24.

Duan

and Xu

, An efficient location-based compromise tolerant key management scheme for sensor networks, InformationProcessing Letters 111(11) (2011), 503-507.

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

Abstract

Keywords

Get full access to this article

References