Application of a Cognitive-Inspired Algorithm for Detecting Communities in Mobility Networks

The emergence and the global adaptation of mobile devices has influenced human interactions at the individual, community, and social levels leading to the so called Cyber-Physical World (CPW) convergence scenario [1]. One of the most important features of CPW is the possibility of exploiting information about the structure of the social communities of users, revealed by joint movement patterns and frequency of physical co-location. Mobile devices of users that belong to the same social community are likely to "see" each other (and thus be able to communicate through ad-hoc networking techniques) more frequently and regularly than devices outside the community. In mobile opportunistic networks, this fact can be exploited, for example, to optimize networking operations such as forwarding and dissemination of messages. In this paper we present the application of a cognitive-inspired algorithm [2, 3, 4] for revealing the structure of these dynamic social networks (simulated by the HCMM model [5]) using information about physical encounters logged by the users' mobile devices. The main features of our algorithm are: (i) the capacity of detecting social communities induced by physical co-location of users through distributed algorithms, (ii) the capacity to detect users belonging to more communities (thus acting as bridges across them), and (iii) the capacity to detect the time evolution of communities.

[1]  Athena Vakali,et al.  Capturing Social Data Evolution Using Graph Clustering , 2013, IEEE Internet Computing.

[2]  Roger Guimerà,et al.  Extracting the hierarchical organization of complex systems , 2007, Proceedings of the National Academy of Sciences.

[3]  Santo Fortunato,et al.  Finding Statistically Significant Communities in Networks , 2010, PloS one.

[4]  Stuart M. Allen,et al.  Decentralised detection of periodic encounter communities in opportunistic networks , 2012, Ad Hoc Networks.

[5]  Emanuele Massaro,et al.  A Cognitive-Inspired Model for Self-Organizing Networks , 2012, 2012 IEEE Sixth International Conference on Self-Adaptive and Self-Organizing Systems Workshops.

[6]  Pan Hui,et al.  Distributed community detection in delay tolerant networks , 2007, MobiArch '07.

[7]  Stuart M. Allen,et al.  Opportunistic social dissemination of micro-blogs , 2012, Ad Hoc Networks.

[8]  Franco Bagnoli,et al.  Community-detection cellular automata with local and long-range connectivity , 2012, ACRI.

[9]  Gerd Gigerenzer,et al.  Models of ecological rationality: the recognition heuristic. , 2002, Psychological review.

[10]  V. Latora,et al.  Impact of network structure on a model of diffusion and competitive interaction , 2011 .

[11]  Myra Spiliopoulou,et al.  Evolution in Social Networks: A Survey , 2011, Social Network Data Analytics.

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

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

[14]  S. Dongen Graph clustering by flow simulation , 2000 .

[15]  A. Clauset Finding local community structure in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Thrasyvoulos Spyropoulos,et al.  An analysis of the information spreading delay in heterogeneous mobility DTNs , 2012, 2012 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM).

[17]  Franco Zambonelli,et al.  Looking ahead in pervasive computing: Challenges and opportunities in the era of cyber-physical convergence , 2012, Pervasive Mob. Comput..

[18]  Pietro Liò,et al.  Information dynamics algorithm for detecting communities in networks , 2011, ArXiv.

[19]  Martin Rosvall,et al.  Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.

[20]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Martin Rosvall,et al.  Multilevel Compression of Random Walks on Networks Reveals Hierarchical Organization in Large Integrated Systems , 2010, PloS one.

[22]  Thrasyvoulos Spyropoulos,et al.  Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing , 2010, 2010 Proceedings IEEE INFOCOM.

[23]  Roger Guimerà,et al.  Correction for Sales-Pardo et al., Extracting the hierarchical organization of complex systems , 2007, Proceedings of the National Academy of Sciences of the United States of America.

[24]  Marco Conti,et al.  Autonomic detection of dynamic social communities in Opportunistic Networks , 2011, 2011 The 10th IFIP Annual Mediterranean Ad Hoc Networking Workshop.

[25]  Feng Luo,et al.  Exploring Local Community Structures in Large Networks , 2006, 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2006 Main Conference Proceedings)(WI'06).

[26]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[27]  Andrea Passarella,et al.  HCMM: Modelling spatial and temporal properties of human mobility driven by users' social relationships , 2010, Comput. Commun..

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