1 Introduction

\definecolor

color1RGB0,0,90 \definecolorcolor2RGB0,20,20 \JournalInfoSubmitted to CSAR2013 \ArchivePreprint \PaperTitleApplication of a cognitive-inspired algorithm for detecting communities in mobility networks \AuthorsEmanuele Massaro1*, Lorenzo Valerio2, Andrea Guazzini3, Andrea Passerella2
and Franco Bagnoli4 \KeywordsCommunity detection — Clustering — Opportunistic Networks — Dynamic networks \AbstractThe 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 Introduction

Nowadays, the closer and closer interaction between devices and their users is a clear expression of the increasing tightness among the cyber world and the physical one. Let us consider, for example, mobile devices that are in charge of autonomously accomplishing tasks like that of discerning, collecting and redistributing important information (for their users) that can be collected in the environment. On the one hand, the devices can use the information coming from the physical world to adapt and optimize their behaviour in the cyber world and, on the other hand, the feedback of the mobile device in the cyber world can affect the behaviour of their human users in the physical world (as happens in social gaming or with other social-oriented applications). This strong interaction has not only the quite obvious effect of generating a huge amount of information that flow from one world to the other, but it also triggers a deeper connection between the them, leading to the so called Cyber-Physical World (CPW) convergence scenario [[1]]. In this context, mobile devices play an important role because they are the actual representation of their users in the cyber world or in other terms, mobile devices act as proxies of their human counterparts. The challenge here is to devise methodologies that make devices able to properly mine the acquired knowledge in order to make them aware about their environment so that they can autonomously take proper decisions for specific tasks. Opportunistic Networks (OppNets) and the problems connected to them, represent a perfect example of the this general concept. OppNets [[6]] are dynamic, delay-tolerant wireless networks made by mobile nodes (e.g. human users equipped with smartphones) where the connectivity between them is not guaranteed at any time instant. In OppNets the communication between nodes can occur only upon contacts, (i.e. when nodes are in a reciprocal transmission range) and the information spreading mainly occour through the store carry and forward paradigm: nodes exploit any contact with other peers to exchange messages under the condition that the other peer is deemed a good candidate to bring the message closer to the destination. The efficient delivery of information to interested users in this kind of networks is currently an open research problem. To this goal, researchers not only have to consider the typical physical problems of wireless networks but also the aspects connected with the humans’ behaviour like their mobility patterns, their natural tendency to aggregate in social communities, etc. The ability of catching and understanding such social information, in order to predict and exploit human behaviour, has a great relevance for the development of effective solution for the above mentioned problems in OppNets. Let us consider for example the message forwarding problem in OppNets: due to the high mobility of devices, the challenge for a forwarding method is to quickly forward the message from the source to the destination, without introducing too many duplicate messages or overhead information. Here, the nodes’ awareness about information like the social relationships, the aggregation habits and the community structure of their human users (all information coming from the physical world and exploited in the cyber world), can help to select suitable forwarders while containing the delivery costs. In this work we focus on the community detection problem in occasional co-located mobile agents. In other terms we want to identify in real-time and using a distributed algorithm the dynamical network structure emerging by proximity contacts of mobile agents. The idea is that these device should be able to detect, in a dynamical and decentralized way, the community structure their users happen to belong to. We recall that in our scenario nodes must be able to take proper decision without relying on centralised information so it is very important that nodes autonomously build a local representation of their surrounding environment. Many community detection algorithms are presend in the literature, as reported in Ref. [[7]]. Many well-performing algorithms for detecting communities in complex networks have been presented in the last decade. We refer among the others to the so-called OSLOM [[8]], INFOMAP and HIERARCHICAL INFOMAP [[9], [10]], MODULARITY OPTIMIZATION [[11]], LOUVAIN METHOD [[12]] and the LABEL PROPAGATION METHOD [[13]] . Although they are very useful for offline data analysis on mobility traces and to define at priori strategies of data forwarding, data dissemination, energy saving, etc., they are rather unfit for real-time distributed applications, i.e., for distributed algorithms run by mobile devices. There are also centralized algorithm that can be applied to dynamic networks [[14], [15]] or distributed ones that use global information [[16], [17]]. We assume here that the mobile device have no access to global data or global communication. Several decentralised approaches have been proposed for community detection. Differently from the centralized ones, they do not rely on a global vision of the network but only on a local one, i.e., every node in the network builds and updates its own representation of the existing social communities over time. For example, in Ref. [[18], [19]], the authors presented three community detection algorithms (SIMPLE, k-CLIQUE, and MODULARITY) while another improved one can be found in the work by Borgia et al. [[20]]. All these methods use only the contact duration to build the representation of the social structure. Another important class of community detection algorithms are based on the local representation of the community, as reported for example in Refs. [[21], [22]].

We tackle the problem from a different point of view, considering also some social and psychological aspects of human behaviour. Human communities are large and varied; we recognize several levels of grouping, sometimes dependent on the context, and we have probably developed our language as a tool for faster communication and discovering of social relationships. Therefore in social networks it is very difficult to have a precise definition of community because people often belong to different communities at the same time and there is not a clear distinction between a community and a rest of the graph. In general, there is a continuum of nested communities whose boundaries are somewhat arbitrary. A community-detection algorithm should therefore return different “views”, according to the value of some control parameters. At a superficial level, most of our information processing concerns the evaluation of probabilities. When faced with insufficient data or insufficient time for a rational processing, humans have developed algorithms, called heuristic in the cognitive psychology area, that allow us to take decisions in these situations. The modern approach to the study of cognitive heuristics defines them as those strategies that prevent one from finding out or discovering incorrect answers to problems that are assumed to be in the domain of probability theory. Basically, the cognitive heuristics program proposed by Goldstein and Gigerenzer suggests to start from fundamental psychological mechanisms in order to design the models of heuristics [[23]]. These models have to satisfy the following constraints: (a) Ecologically rational (i.e., they exploit structures of information in the environment), (b) Founded in evolutionary psychological capacities such as the memory and the perceptual system, (c) Fast and frugal, and simple enough to operate effectively when time, knowledge, and computational power are limited. We try to implement such human-inspired models in autonomous devices. We model an “individual” as a memory and a set of connections to other individuals, with a simple procedure for filtering information. The information about neighbouring nodes is propagated and elaborated locally over the time as function of the previous meetings. In this way we are able to simulate a process in which the agents, through an alternation of communication and elaboration phases, have their local subjective representation of network. The emerging community knowledge is given by the probability to belong to one or more clusters at the same time. This method, already tested for detecting communities in static networks [[2], [3], [4]], is now applied to dynamical environments.

2 The model

Figure 1: (a) Network composed by communities of densely connected vertices ( and respectively) with a much lower density of connections between them. (b) Corresponding adjacency matrix: here the red points indicate the presence of a link between nodes and . (c) Asymptotic configuration of the state matrix , with and , in which the two principal communities are labelled by leaves, nodes and , that are the nodes with lower connectivity. Moreover it is also possible to detect the overlapping nodes between them, which are the nodes and for the first community and the nodes and for the second one. This fact is emphasized by the values of the state matrix where the overlapping nodes have an high probability to belong to their principal community (light red points) but also a low probability to be part of the other one (light blue points). The other nodes have a very high probability to belong only to their principal community (dark red points).
Figure 2: (a) Hierarchical three-level network with principal communities by blocks of nodes each. (b) Final configuration of state matrix with and . (c) Final configuration of state matrix with and : the final mono-cluster is identified by the node with lower connectivity in the network. (d) Entropy of information for the whole network during time regarding the case (c).
Figure 3: (color online) Case with nodes, communities and travellers for each community. (a) Community structure of the network revealed by our algorithm where the link represent the encounters between the agents during time while the travellers are the overlapping nodes between the three principal communities. (b) Probability to belong to the principal communities in the case with travellers for each community. Local vision of nodes and . These nodes are in the same community labelled as . As we can observe the nodes are the travellers of the community . In fact they belong with a certain probability also to other communities. On the contrary the node has a very high probability to belong only to its community.

Let us first present the static community-detection algorithm derived from the van Dongen’s Markov Cluster algorithm (MCL) method [[24]]. The MCL algorithm simulates a sort of diffusion process over the graph, followed by a pruning phase in which the competition among the links allows to eliminate the weakest ones. In this model the graph is expressed by the correspondent adjacency matrix : specifically, the adjacency matrix of a finite graph G of vertices is a matrix where the non-diagonal entry indicates the presence (absence) of a link from the node to the node , as shown in Figure 1(b). The MCL algorithm starts by elaborating the diffusion matrix, which is obtained from the original adjacency matrix by normalizing over rows. In particular the row of is divided by the connectivity degree of node ; then

(1)

where . The elaboration is composed by an alternation of expansion and inflation phases. In the expansion phase an integer power of this matrix – usually – is computed, generating the probability matrix of an -step random walk. Thereafter, in the inflation phase, each element of the probability matrix is raised to some power in order to artificially enhance the probability of the random walker of being trapped within a community. The expansion and the inflation phases are iterated until one obtains the adjacency matrix of multiple disconnected stars, corresponding to the communities. This method, widely used in bioinformatics, depends strongly on the choice of the parameter . Its complexity can be partially neglect (or cut off) if, after each step of inflation, only the largest elements of the resulting matrix are maintained, while the others are set to zero. Starting from the MCL method, we have developed an algorithm, already described here in Refs. [[2], [3], [4]] and summarised hereafter for the reader’s convenience, where a network of vertices is represented by its adjacency matrix . The vertices or nodes are the agents capable to communicate with each other, and each of them has a memory of past encounters (state vector): each vertex is characterized by a state vector representing its knowledge about node at time . We can compactly represent the knowledge of the whole network by a state matrix ( entries). We suppose that at time each node knows only itself so if and otherwise (i.e., the initial state matrix the identity matrix ). The elaboration of information is modelled as an alternation of communication and elaboration phases. We shall denote by the state matrix after the communication phase and by the state vector after the elaboration one, i.e., after one whole time step. The information at each node is updated when it encounters another node: two meeting nodes exchange information about their local view of the network, which is clearly an approximation (due to their partial knowledge) of the real structure of the network.

Communication phase: In this phase a node passes information about other nodes. His knowledge about other nodes is given by its state vector , whose entries are a measure of the relevance of the other nodes. We assume that there is a limitation about the communication time, so that the most relevant informations are communicated with more emphasis (in a real implementation with finite bandwidth, this would imply that the probability of communicating an information about a given node is higher the more relevant that node is). In order to model this limitation, we normalize the adjacency matrix on the columns (i.e., we assign at each link the inverse of the output degree of the incoming node), forming a Markov matrix . We also introduce a memory term that modulates the evolution of the knowledge:

(2)

The parameter allows us to moderate the oblivion effect for which the most recent information is more important than the old one.

Elaboration phase: The elaboration phase is modelled analogously to the inflation phase in the MCL algorithm:

(3)

This part is also based on the concept of diffusion and competitive interaction in network structure introduced by Nicosia et al. [[25]].

Each community is identified by the label of a ”characteristic” node (that spontaneously emerge). In order to exemplify our method we report the results of the algorithm for the network reported in Figure 1(a) represented by the adjacency matrix in Figure 1(b) where the red points indicate the presence of a link between nodes and . This is a network composed by vertices and two communities and . In Figure 1(c) we show the image of the final configuration of the state matrix in which the two communities are labelled by the nodes and which are the nodes in the two communities with the lower connectivity degree. Moreover, it is also possible to detect the overlapping nodes between the communities as explained in the figure caption. The node memory is assumed to be large enough to contain all the pieces of information about other nodes (in a real implementation this should be limited to the most relevant nodes), and the model is characterized by two free parameters: the memory and the coefficient  [[2], [3]] although it is possible to let the system automatically tune them as shown in Ref. [[4]]. As shown in Figure 2, the output of the model depends on the values of parameters. In Figure 2 (a), an example of a hierarchical network is presented; the three-levels adjacency matrix is composed by blocks of 8 nodes (first-level communities), grouped in second-level communities of blocks, with a link probability that is respectively of inside blocks, among blocks in the the second-level communities, and among the rest. The red points indicate the presence of a link between node and node , . In Figure 2 (b), the asymptotic configuration of the matrix is shown using and , while in Figure 2 (c) it is computed using and . It can be noticed that in the first case the algorithm discovers the four second-level communities, and the second case all nodes belong to the same community. In order to present the data in a compact way, let us introduce the information entropy , defined as

(4)

where . The entropy reaches the maximum for the flat distribution, where each node knows only itself, and reaches a minimum (zero) when all nodes know the same label (i.e. all state vectors are the same and contain just one element different from zero). It is possible to follow the evolution of the global knowledge by plotting the value of the entropy during time, as shown in Figure 2 (d) corresponding to the parameters of case (c). Although the final state is that of minimum entropy (only one label), it is possible to see that the network identifies during time the different levels of the hierarchical structures, showing them as plateaus in the entropy plot.

It is possible to apply this method to dynamical networks. In this case the adjacency matrix changes in time, due to the displacement of agents. At each time step each node saves its local vision of the network in order to have the right view during time, as we show in the next Section.

3 Results

3.1 Simulated environment

We apply our algorithm to the case of nodes that move as in one of the reference models in the opportunistic networking literature, the HCMM [[5]], already used in several works to evaluate the performance of data forwarding and dissemination for OppNets [[26], [27]]. This allows us to show that our algorithm can be used to dynamically detect the structure of communities of users in mobile social networking environments. Mobility traces generated by HCMM incorporate temporal, social and spacial notions in order to obtain a proper representation of the real user movements. More precisely, nodes move in an area of divided in a grid where a single grid’s cell represent a physical location that corresponds to a community. In this synthetic scenario, communities are placed far from each other so to avoid any border effect, e.g., involuntary communication between groups. In each community we place two kinds of moving nodes: travellers and non-travellers. Non-travellers roam only inside their community, while travellers, from time to time, use to visit other social communities different from the one they belong to. In this context, the only way to exchange information is through nodes mobility, and travellers play an important role because they are the unique bridge between communities. We only use proximity information, so edges correspond to contacts. We do not use other social information.

In our experimental set-up, we consider a network of N = 90 nodes, divided in 3 separated communities and we study the performance of the algorithm by incrementally increasing the number of travellers for each community. We want to evaluate the average discovery time of the underlying community structure together with the goodness of the detection itself. Indeed, by increasing the number of travellers the information flow from one community to another also increases, but the actual community boundaries becomes less defined, making the community detection problem more and more challenging.

For simplicity, we used the same time step for the alternating computation and the user mobility, but clearly in a real world the elaboration phase would be much faster than the mobility one.

The detailed scenario configuration can be found in Table 1.

Paramenter Value
Node speed Uniform in
Transmission range
Simulation Area
Number of cells
Number of nodes
Number of communities
Number of travellers per community
Simulation time
Table 1: Detailed scenario configuration

3.2 Performance evaluation

Figure 4: (color online) Final community structures detected by the algorithm considering (a) and (b) travellers respectively.
Figure 5: (color online) Information entropy during time for different scenarios with , , and travellers.

The results of the algorithm with travellers for each community is shown in Figure 3. In Figure 3(a) we show the snapshot of the community structure revealed by our algorithm. We can observe the principal clusters but also the overlapping nodes between the communities that correspond to the travellers. The state matrix is the probability for a node to belong to a certain community: this data is reported in Figure 3(b)-(c)-(d) where the bars of the histogram corresponds to the probability for the nodes to belong to the a given community. For instance, looking at Figure 3(b) we can observe that nodes and have an high probability to belong to community but the first four nodes have also a little probability to belong to other communities. In fact, node (blue bar in Figure 3(b)) is a member of community with and of the community with because it is a traveller between the two communities. While the node has a probability to belong to the community : in this way each node is aware of its role inside its community.

In Figure 4(a)-(b) we report the snapshots of the final community structure detected by our algorithm considering and travellers, respectively: also here the algorithm is able to detect not only the three principal clusters but also the travellers as the overlapping nodes between the communities.

In Figure 5 we show the different plots of the information entropy for different cases considering different number of travellers. Here we can not only observe the three plateaus corresponding to three principal clusters, but also the converging times for reaching the final state. By increasing the number of travellers, the time for reaching the asymptotic state decrease. The convergence time can be used therefore as an indicator of the performances of the detection and as a measure of the “boundary size” of the community.

Finally, in Figure 6 we report the local entropy for a traveller (black line) and for a normal agent (blue line) during time. The local entropy is simply define as and represents the knowledge of the single node about the surrounding world. While the knowledge of a normal agent quickly relaxes to a stationary value, that of travellers exhibits jumps when the agent switches to other communities.

Figure 6: (color online) Comparison between the local entropy of a traveller (jumping blue line) and a normal agent (black line). The peaks correspond to the switched to other communities.

4 Conclusion and future work

In this paper, we proposed a local cognitive-inspired community detection algorithm for opportunistic networking environments. Given the growing interactions between mobile devices and humans we focused our attention on the importance of the spreading and elaboration of the information which has a crucial role in CPW [[1]]. We evaluated it on different synthetic human mobility scenarios and we found that our method is capable to detect not only the right communities from an individual viewpoint but also to spontaneously reveal the role of each nodes inside the network (travellers and normal agents) providing a natural “scanning” of the various clustering levels. In the future, we would like to evaluate the scaling of our algorithms with the system size and apply it to more realistic scenarios. In particular we plan to compare our algorithm with others targeted to pocket switched networks (that use also global information) [[16], [17]]. We would also like to combine the geographic proximity with additional social information so as to better catch the complex association between the real and the virtual world.

Acknowledgments

This work is partly funded by the EC under the FET-AWARENESS RECOGNITION Project (FP7-257756) and by the EIT ICT Labs Emergent Social Mobility Project.

References

  1. M. Conti, S. K. Das, Bisdikian C, M. Kumar, L. M. Ni, A. Passarella, G. Roussos, G. Troster, G. Tsudik, and Zambonelli F. Looking ahead in pervasive computing: Challenges and opportunities in the era of cyber-physical convergence. Pervasive and Mobile Computing, 8(1):2 – 21, 2012.
  2. E. Massaro, F. Bagnoli, A. Guazzini, and P. Lió. Information dynamics algorithm for detecting communities in networks. Comm. Nonlin. Sci Numer. Simul., 17(11):4294 – 4303, 2012.
  3. F. Bagnoli, E. Massaro, and A. Guazzini. Community-detection cellular automata with local and long-range connectivity. LNCS, Springer, Berlin 2012, 7495:204–213, 2012.
  4. D. Borkmann, A. Guazzini, E. Massaro, and S. Rudolph. A cognitive-inspired model for self-organizing networks. In IEEE Sixth International Conference on Self-Adaptive and Self-Organizing Systems Workshops (SASOW), pages 229–234, 2012.
  5. C. Boldrini and A. Passarella. Hcmm: Modelling spatial and temporal properties of human mobility driven by users social relationships. Computer Communication, 33(9):1056–1074, 2010.
  6. L. Pelusi, A. Passarella, and M. Conti. Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE Communications Magazine, 44(11):134–141, 2006.
  7. S. Fortunato. Community detection in graphs. Physics Reports, 486(3–5):75 – 174, 2010.
  8. A. Lancichinetti, F. Radicchi, J. J. Ramasco, and S. Fortunato. Finding statistically significant communities in networks. PLoS ONE, 6(4):e18961+, 2011.
  9. M. Rosvall and C. T. Bergstrom. Maps of random walks on complex networks reveal community structure. PNAS, 105(4):1118–1123, 2008.
  10. M. Rosvall and C. T. Bergstrom. Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems. 2011.
  11. M. Sales-Pardo, R. Guimerà, A. A. Moreira, and L. A. N. Amaral. Extracting the hierarchical organization of complex systems. PNAS, 104(39):15224–15229, 2007.
  12. V. D. Blondel, J.L. Guillaume, R. Lambiotte, and E. Lefebvre. Fast unfolding of communities in large networks. JSTAT, 2008(10):P10008+, 2008.
  13. U. N. Raghavan, R. Albert, and S. Kumara. Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E, 76(3):036106+, 2007.
  14. M Spiliopoulou. Evolution in social networks: A survey. In Charu C. Aggarwal, editor, Social Network Data Analytics, pages 149–175. Springer, 2011.
  15. M. Giatsoglou and A. Vakali. Capturing social data evolution using graph clustering. IEEE Internet Computing, 17(1):74–79, 2013.
  16. P. Hui, J. Crowcroft, and E. Yoneki. Bubble rap: social-based forwarding in delay tolerant networks. In Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing, MobiHoc ’08, pages 241–250, 2008.
  17. M. J. Williams, R. M. Whitaker, and S. M. Allen. Decentralised detection of periodic encounter communities in opportunistic networks. Ad Hoc Networks, 10(8):1544–1556, 2012.
  18. P. Hui, E. Yoneki, S.Y. Chan, and J. Crowcroft. Distributed community detection in delay tolerant networks. In MobiArch, 2007.
  19. T. Hossmann, T. Spyropoulos, and F. Legendre. Know thy neighbor: Towards optimal mapping of contacts to social graphs for dtn routing. In INFOCOM, 2010 Proceedings IEEE, pages 1–9, 2010.
  20. E. Borgia, M. Conti, and A. Passarella. Autonomic detection of dynamic social communities in opportunistic networks. In The 10th IFIP Annual Mediterranean Ad Hoc Networking Workshop, 2011.
  21. A. Clauset. Finding local community structure in networks. Physical Review E, 72(2):026132+, 2005.
  22. F. Luo, J. Z. Wang, and E. Promislow. Exploring local community structures in large networks. In Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence, WI ’06, pages 233–239, 2006.
  23. G. Gigerenzer and G. Goldstein. Models of ecological rationality: The recognition heuristic. Psyc. Rev., 109(1):75–90, 2002.
  24. S. V. Dongen. Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht, 2000.
  25. V. Nicosia, F. Bagnoli, and V. Latora. Impact of network structure on a model of diffusion and competitive interaction. EPL, 94(6):68009, 2011.
  26. S.M. Allen, M.J. Chorley, G.B. Colombo, and R.M. Whitaker. Opportunistic social dissemination of micro-blogs. Ad Hoc Networks, 10(8):1570 – 1585, 2012.
  27. A. Picu, T. Spyropoulos, and T. Hossmann. An analysis of the information spreading delay in heterogeneous mobility dtns. In World of Wireless, Mobile and Multimedia Networks (WoWMoM), 2012 IEEE International Symposium on a, pages 1–10, 2012.
104141
This is a comment super asjknd jkasnjk adsnkj
Upvote
Downvote
Edit
-  
Unpublish
""
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters
Submit
Cancel
Comments 0
Request answer
""
The feedback must be of minumum 40 characters
Add comment
Cancel
Loading ...