CLAN: An Efficient Distributed Temporal Community Detection Protocol for MANETs

Real world MANETs often exhibit an inherent community structure in their topological connectivity and in the evolution of the topology over time. Such temporal community structure of MANETs has been shown to be extremely useful in improving the performance of routing and content-based routing in MANETs. However, detecting temporal communities in a completely distributed and real time manner is a hard problem, and it is often performed offline with knowledge of the full network topology over time. We propose CLAN, a distributed and real-time protocol for detecting temporal communities in MANETs. CLAN is an adaptation of the Label Propagation algorithm to distributed and time-varying graphs that MANETs are. A key novel component of CLAN is local rules for community rediscovery as the network evolves. CLAN also uses a weighted version of the network topology where the weights are defined using a novel notion of social entropy to promote stability of communities. Extensive simulation results demonstrate that CLAN is quick to converge, incurs minimal overhead and is as effective as centralized approaches to temporal community detection. We also demonstrate how the temporal community structure can be used by designing a hierarchical routing protocol that achieves the delivery ratio of the OLSR routing protocol at a fraction of the overhead.

[1]  J. Reichardt,et al.  Statistical mechanics of community detection. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  J. Coleman.  Introduction to Mathematical Sociology , 1965 .

[3]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[4]  M. Barber,et al.  Detecting network communities by propagating labels under constraints. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Paul A. Bates,et al.  Cluster analysis of networks generated through homology: automatic identification of important protein communities involved in cancer metastasis , 2006, BMC Bioinformatics.

[6]  Thomas Plagemann,et al.  Detecting Communities in Sparse MANETs , 2011, IEEE/ACM Transactions on Networking.

[7]  D. Caprioni,et al.  Small unit operations situation awareness system (SUO-SAS) radio architecture and system field testing results , 2003, IEEE Military Communications Conference, 2003. MILCOM 2003..

[8]  Vikas Kawadia,et al.  Sequential detection of temporal communities by estrangement confinement , 2012, Scientific Reports.

[9]  A. Barabasi,et al.  Quantifying social group evolution , 2007, Nature.

[10]  J. V. Rauff,et al.  Introduction to Mathematical Sociology , 2012 .

[11]  Cecilia Mascolo,et al.  Designing mobility models based on social network theory , 2007, MOCO.

[12]  Nam P. Nguyen,et al.  Overlapping communities in dynamic networks: their detection and mobile applications , 2011, MobiCom.

[13]  Matthias Grossglauser,et al.  Island Hopping: Efficient Mobility-Assisted Forwarding in Partitioned Networks , 2006, 2006 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks.

[14]  J. Kertész,et al.  On the equivalence of the label propagation method of community detection and a Potts model approach , 2008, 0803.2804.

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

[16]  Jukka-Pekka Onnela,et al.  Community Structure in Time-Dependent, Multiscale, and Multiplex Networks , 2009, Science.

[17]  Niky Riga,et al.  Slinky : An Adaptive Protocol for Content Access in Disruption-Tolerant Ad Hoc Networks , 2011 .

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

[19]  Mostafa Ammar,et al.  Hybrid routing in clustered DTNs with message ferrying , 2007, MobiOpp '07.

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

[21]  Stijn van Dongen,et al.  Graph Clustering Via a Discrete Uncoupling Process , 2008, SIAM J. Matrix Anal. Appl..

[22]  Marina Meila,et al.  Comparing Clusterings by the Variation of Information , 2003, COLT.

[23]  Carl T. Bergstrom,et al.  Mapping Change in Large Networks , 2008, PloS one.

[24]  W. Timothy Strayer,et al.  CASCADE: Content Access System for the Combat-Agile Distributed Environment , 2013, MILCOM 2013 - 2013 IEEE Military Communications Conference.

[25]  Pietro Liò,et al.  A Novel Mobility Model from a Heterogeneous Military MANET Trace , 2008, ADHOC-NOW.

[26]  Christophe Diot,et al.  Dissemination in opportunistic social networks: the role of temporal communities , 2012, MobiHoc '12.

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

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

[29]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[30]  Robin Kravets,et al.  Mercury: Leveraging clustering in opportunistic networks , 2011, 2011 IFIP Wireless Days (WD).

[31]  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.

[32]  J. J. Garcia-Luna-Aceves,et al.  Opportunistic routing using prefix ordering and self-reported social groups , 2013, 2013 International Conference on Computing, Networking and Communications (ICNC).

[33]  Hongyi Wu,et al.  Clustering and cluster-based routing protocol for delay-tolerant mobile networks , 2010, IEEE Transactions on Wireless Communications.