Characterizing Collaboration in Social Network-enabled Routing

Connectivity and trust in social networks have been exploited to propose applications on top of these networks, including routing, Sybil defenses, and anonymous communication systems. In these networks, and for such applications, connectivity ensures good performance of applications while trust is assumed to always hold, so as collaboration and good behavior are always guaranteed. In this paper, we study the impact of differential behavior of users on performance in typical social network-enabled routing applications. We classify users into either collaborative or rational (probabilistically collaborative) and study the impact of this classification and the associated behavior of users on the performance of such applications, including random walk-based routing, shortest path based routing, breadth-first-search based routing, and Dijkstra routing. By experimenting with real-world social network traces, we make several interesting observations. First, we show that some of the existing social graphs have high routing costs, demonstrating poor structure that prevents their use in such applications. Second, we study the factors that make probabilistically collaborative nodes important for the performance of the routing protocol within the entire network and demonstrate that the importance of these nodes stems from their topological features rather than their percentage of all the nodes within the network.

[1]  Vito Latora,et al.  Selfishness, Altruism and Message Spreading in Mobile Social Networks , 2009, IEEE INFOCOM Workshops 2009.

[2]  N.B. Shroff,et al.  Analysis of Shortest Path Routing for Large Multi-Hop Wireless Networks , 2009, IEEE/ACM Transactions on Networking.

[3]  Russell J. Clark,et al.  D-book: a mobile social networking application for delay tolerant networks , 2008, CHANTS '08.

[4]  Marco Conti,et al.  Ego network models for Future Internet social networking environments , 2012, Comput. Commun..

[5]  Mario Gerla,et al.  A novel social contact graph based routing strategy for Delay Tolerant Networks , 2015, 2015 International Wireless Communications and Mobile Computing Conference (IWCMC).

[6]  Fengyuan Xu,et al.  SybilDefender: A Defense Mechanism for Sybil Attacks in Large Social Networks , 2013, IEEE Transactions on Parallel and Distributed Systems.

[7]  Michael Kaminsky,et al.  Toward an optimal social network defense against Sybil attacks , 2007, PODC '07.

[8]  Gwillerm Froc,et al.  Random walk based routing protocol for wireless sensor networks , 2007, ValueTools '07.

[9]  Guangyue Lu,et al.  Social Incentives for Cooperative Spectrum Sensing in Distributed Cognitive Radio Networks , 2014, KSII Trans. Internet Inf. Syst..

[10]  Greg Bigwood,et al.  Social DTN routing , 2008, CoNEXT '08.

[11]  Alan Mislove,et al.  Iolaus: securing online content rating systems , 2013, WWW.

[12]  Sahibzada Ali Mahmud,et al.  A Survey of Cluster-based Routing Schemes for Wireless Sensor Networks , 2013, Smart Comput. Rev..

[13]  Roberto Beraldi.  Random walk with long jumps for wireless ad hoc networks , 2009, Ad Hoc Networks.

[14]  Iain Parris,et al.  Privacy-enhanced social-network routing , 2012, Comput. Commun..

[15]  Mario Gerla,et al.  Socially-aware content retrieval using random walks in Disruption Tolerant Networks , 2015, 2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM).

[16]  Peng Gao,et al.  Exploiting Temporal Dynamics in Sybil Defenses , 2015, CCS.

[17]  Mario Gerla,et al.  Social caching and content retrieval in Disruption Tolerant Networks (DTNs) , 2015, 2015 International Conference on Computing, Networking and Communications (ICNC).

[18]  Johan A. Pouwelse,et al.  A Gossip-Based Distributed Social Networking System , 2009, 2009 18th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises.

[19]  Michael Kaminsky,et al.  SybilGuard: Defending Against Sybil Attacks via Social Networks , 2008, IEEE/ACM Transactions on Networking.

[20]  Michael Ley,et al.  The DBLP Computer Science Bibliography: Evolution, Research Issues, Perspectives , 2002, SPIRE.

[21]  Silvio Lattanzi,et al.  SoK: The Evolution of Sybil Defense via Social Networks , 2013, 2013 IEEE Symposium on Security and Privacy.

[22]  Gwillerm Froc,et al.  Design and Performance of Wireless Data Gathering Networks Based on Unicast Random Walk Routing , 2009, IEEE/ACM Transactions on Networking.

[23]  Aziz Mohaisen,et al.  Dynamix: anonymity on dynamic social structures , 2013, ASIA CCS '13.

[24]  Aziz Mohaisen,et al.  Measuring the mixing time of social graphs , 2010, IMC '10.

[25]  Qinghua Li,et al.  Routing in Socially Selfish Delay Tolerant Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[26]  Su Deng,et al.  Performance Analysis of Information Propagation in DTN-like Scale-free Mobile Social Network , 2014, KSII Trans. Internet Inf. Syst..

[27]  Shishir Nagaraja,et al.  Anonymity in the Wild: Mixes on Unstructured Networks , 2007, Privacy Enhancing Technologies.

[28]  Zheng Zhou,et al.  On the Efficiency of Random Walk Routing in Multihop Wireless Network , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[29]  Aziz Mohaisen,et al.  Keep your friends close: Incorporating trust into social network-based Sybil defenses , 2011, 2011 Proceedings IEEE INFOCOM.

[30]  Krishna P. Gummadi,et al.  Measurement and analysis of online social networks , 2007, IMC '07.

[31]  Jasmine Novak,et al.  Geographic routing in social networks , 2005, Proc. Natl. Acad. Sci. USA.

[32]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

[33]  Jiye Yu,et al.  iLink: search and routing in social networks , 2007, KDD '07.

[34]  George Danezis,et al.  SybilInfer: Detecting Sybil Nodes using Social Networks , 2009, NDSS.

[35]  Jure Leskovec,et al.  Predicting positive and negative links in online social networks , 2010, WWW '10.

[36]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[37]  George Danezis,et al.  Sybil-Resistant DHT Routing , 2005, ESORICS.

[38]  Dahlia Malkhi,et al.  On spreading recommendations via social gossip , 2008, SPAA '08.

[39]  Hector Garcia-Molina,et al.  DHT Routing Using Social Links , 2004, IPTPS.

[40]  Pierre Fraigniaud,et al.  Opportunistic spatial gossip over mobile social networks , 2008, WOSN '08.

[41]  Marta Z. Kwiatkowska,et al.  Analysis of a gossip protocol in PRISM , 2008, PERV.

[42]  Ben Y. Zhao,et al.  User interactions in social networks and their implications , 2009, EuroSys '09.

[43]  Mario Gerla,et al.  DiscoverFriends: Secure social network communication in mobile ad hoc networks , 2015, 2015 International Wireless Communications and Mobile Computing Conference (IWCMC).

[44]  Xiaohui Liang,et al.  HealthShare: Achieving secure and privacy-preserving health information sharing through health social networks , 2012, Comput. Commun..

[45]  Krishna P. Gummadi,et al.  An analysis of social network-based Sybil defenses , 2010, SIGCOMM '10.

[46]  Mads Haahr,et al.  Social network analysis for routing in disconnected delay-tolerant MANETs , 2007, MobiHoc '07.

[47]  Binoy Ravindran,et al.  On Distributed Time-Dependent Shortest Paths over Duty-Cycled Wireless Sensor Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[48]  Chris Lesniewski-Laas,et al.  A Sybil-proof one-hop DHT , 2008, SocialNets '08.