ML-SOR: Message routing using multi-layer social networks in opportunistic communications

Opportunistic networks are a generalization of DTNs in which disconnections are frequent and encounter patterns between mobile devices are unpredictable. In such scenarios, message routing is a fundamental issue. Social-based routing protocols usually exploit the social information extracted from the history of encounters between mobile devices to find an appropriate message relay. Protocols based on encounter history, however, take time to build up a knowledge database from which to take routing decisions. While contact information changes constantly and it takes time to identify strong social ties, other types of ties remain rather stable and could be exploited to augment available partial contact information. In this paper, we start defining a multi-layer social network model combining the social network detected through encounters with other social networks and investigate the relationship between these social network layers in terms of node centrality, community structure, tie strength and link prediction. The purpose of this analysis is to better understand user behavior in a multi-layered complex network combining online and offline social relationships. Then, we propose a novel opportunistic routing approach ML-SOR (Multi-layer Social Network based Routing) which extracts social network information from such a model to perform routing decisions. To select an effective forwarding node, ML-SOR measures the forwarding capability of a node when compared to an encountered node in terms of node centrality, tie strength and link prediction. Trace driven simulations show that a routing metric combining social information extracted from multiple social network layers allows users to achieve good routing performance with low overhead cost.

[1]  Jon Crowcroft,et al.  Opportunistic message routing using multi-layer social networks , 2013, HP-MOSys '13.

[2]  Andrea Lancichinetti,et al.  Detecting the overlapping and hierarchical community structure in complex networks , 2008, 0802.1218.

[3]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[4]  José Neuman de Souza,et al.  Service Assurance with Partial and Intermittent Resources , 2004, Lecture Notes in Computer Science.

[5]  Jon M. Kleinberg,et al.  The link-prediction problem for social networks , 2007, J. Assoc. Inf. Sci. Technol..

[6]  Gert Sabidussi,et al.  The centrality index of a graph , 1966 .

[7]  Tristan Henderson,et al.  CRAWDAD: a community resource for archiving wireless data at Dartmouth , 2005, CCRV.

[8]  Salvatore Marano,et al.  Evaluating the impact of energy consumption on routing performance in delay tolerant networks , 2012, 2012 8th International Wireless Communications and Mobile Computing Conference (IWCMC).

[9]  Mads Haahr,et al.  Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs , 2009, IEEE Transactions on Mobile Computing.

[10]  Katarzyna Musial,et al.  A Performance of Centrality Calculation in Social Networks , 2009, 2009 International Conference on Computational Aspects of Social Networks.

[11]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[12]  Przemyslaw Kazienko,et al.  Multi-layered Social Networks , 2012, ArXiv.

[13]  Martin Everett,et al.  Ego network betweenness , 2005, Soc. Networks.

[14]  Licia Capra,et al.  Habit: Leveraging human mobility and social network for efficient content dissemination in Delay Tolerant Networks , 2009, 2009 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks & Workshops.

[15]  Damien Fay,et al.  Centrality and mode detection in dynamic contact graphs; a joint diagonalisation approach , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).

[16]  Salvatore Marano,et al.  Face-to-face with facebook friends: Using online friendlists for routing in opportunistic networks , 2013, 2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC).

[17]  Christophe Diot,et al.  Are you moved by your social network application? , 2008, WOSN '08.

[18]  Katarzyna Musial,et al.  User position measures in social networks , 2009, SNA-KDD '09.

[19]  Przemyslaw Kazienko,et al.  Shortest Path Discovery in the Multi-layered Social Network , 2011, 2011 International Conference on Advances in Social Networks Analysis and Mining.

[20]  Katarzyna Musial,et al.  Mining Personal Social Features in the Community of Email Users , 2008, SOFSEM.

[21]  Paolo Santi,et al.  Social-aware stateless forwarding in pocket switched networks , 2011, 2011 Proceedings IEEE INFOCOM.

[22]  Marco Conti,et al.  Opportunistic networking: data forwarding in disconnected mobile ad hoc networks , 2006, IEEE Communications Magazine.

[23]  Shuiming Cai,et al.  The interaction between multiplex community networks. , 2011, Chaos.

[24]  P. Bonacich Factoring and weighting approaches to status scores and clique identification , 1972 .

[25]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[26]  Fehmi Ben Abdesslem,et al.  Finding a Data Blackhole in Bluetooth Scanning , 2009 .

[27]  Paolo Santi,et al.  Social-Aware Stateless Routingin Pocket Switched Networks , 2015, IEEE Transactions on Parallel and Distributed Systems.

[28]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[29]  P. Deb Finite Mixture Models , 2008 .

[30]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SimuTools.

[31]  P. Bonacich Power and Centrality: A Family of Measures , 1987, American Journal of Sociology.

[32]  Victor O. K. Li,et al.  Exploring Centrality for Message Forwarding in Opportunistic Networks , 2010, 2010 IEEE Wireless Communication and Networking Conference.

[33]  George Varghese,et al.  MobiClique: middleware for mobile social networking , 2009, WOSN '09.

[34]  Matteo Magnani,et al.  The ML-Model for Multi-layer Social Networks , 2011, 2011 International Conference on Advances in Social Networks Analysis and Mining.

[35]  Christophe Diot,et al.  Impact of Human Mobility on Opportunistic Forwarding Algorithms , 2007, IEEE Transactions on Mobile Computing.

[36]  Katarzyna Musial,et al.  Analysis of Neighbourhoods in Multi-layered Dynamic Social Networks , 2012, Int. J. Comput. Intell. Syst..

[37]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[38]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[39]  Floriano De Rango,et al.  Social and dynamic graph-based scalable routing protocol in a DTN network , 2012, 2012 International Symposium on Performance Evaluation of Computer & Telecommunication Systems (SPECTS).

[40]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[41]  Greg Bigwood,et al.  Bootstrapping opportunistic networks using social roles , 2011, 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[42]  Ciprian Dobre,et al.  Interest-awareness in data dissemination for opportunistic networks , 2015, Ad Hoc Networks.

[43]  Ciprian Dobre,et al.  Social Aspects to Support Opportunistic Networks in an Academic Environment , 2012, ADHOC-NOW.

[44]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[45]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.

[46]  K. Reitz,et al.  Graph and Semigroup Homomorphisms on Networks of Relations , 1983 .

[47]  Annalisa Socievole,et al.  Wireless contacts, Facebook friendships and interests: Analysis of a multi-layer social network in an academic environment , 2014, 2014 IFIP Wireless Days (WD).

[48]  Mostafa H. Ammar,et al.  PeopleRank: Social Opportunistic Forwarding , 2010, 2010 Proceedings IEEE INFOCOM.

[49]  Salvatore Marano,et al.  Novel activity-based metrics for efficient forwarding over online and detected social networks , 2013, 2013 9th International Wireless Communications and Mobile Computing Conference (IWCMC).

[50]  Giuseppe Di Battista,et al.  26 Computer Networks , 2004 .

[51]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[52]  M. Fiedler A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

[53]  Lada A. Adamic,et al.  Friends and neighbors on the Web , 2003, Soc. Networks.

[54]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[55]  Vinton G. Cerf,et al.  Delay-Tolerant Networking Architecture , 2007, RFC.

[56]  Christophe Diot,et al.  CRAWDAD dataset thlab/sigcomm2009 (v.2012-07-15) , 2012 .

[57]  Ciprian Dobre,et al.  SPRINT: Social prediction-based opportunistic routing , 2013, 2013 IEEE 14th International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM).

[58]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[59]  Mark Newman,et al.  Detecting community structure in networks , 2004 .

[60]  Gian Paolo Rossi,et al.  Facencounter: Bridging the Gap between Offline and Online Social Networks , 2012, 2012 Eighth International Conference on Signal Image Technology and Internet Based Systems.

[61]  Salvatore Marano,et al.  Exploring user sociocentric and egocentric behaviors in online and detected social networks , 2012, 2012 2nd Baltic Congress on Future Internet Communications.

[62]  Salvatore Marano,et al.  Predicting Links in Human Contact Networks Using Online Social Proximity , 2013, Predicting Real World Behaviors from Virtual World Data @ SocialCom.

[63]  Salil S. Kanhere,et al.  HUBCODE: message forwarding using hub-based network coding in delay tolerant networks , 2009, MSWiM '09.

[64]  Leon Danon,et al.  Comparing community structure identification , 2005, cond-mat/0505245.

[65]  P. V. Marsden,et al.  Measuring Tie Strength , 1984 .

[66]  Annalisa Socievole,et al.  Routing approaches and performance evaluation in delay tolerant networks , 2011, 2011 Wireless Telecommunications Symposium (WTS).

[67]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.