Detecting Communities in Sparse MANETs

In sparse mobile ad hoc networks, placement of services and data is crucial to assure their availability to all nodes because sparse population of nodes can lead to (frequent) network partitions. If these dynamic networks display a fairly stable cluster structure, it is possible to utilize this structure to improve service and data availability. However, clustering in a dynamic network is a very challenging task due to the ever-changing topology and irregular density of such a network. In this paper, we investigate clustering of dynamic networks with the help of community detection mechanisms, using only topology information from the local routing table. The main aim of our approach is to reduce to “zero” the communication overhead needed for cluster management and to dynamically adapt to the size and layout of the network. We have performed extensive experiments to evaluate the consistency, quality, and stability of the clustering returned by our algorithms. The results show that our nonintrusive clustering indeed discovers temporary groups of nodes that form stable clusters in the network. Moreover, even though the local routing tables in general reflect slightly diverging topologies, our results still show only small differences between the communities detected at different nodes.

[1]  Baochun Li,et al.  NonStop: continuous multimedia streaming in wireless ad hoc networks with node mobility , 2003, IEEE J. Sel. Areas Commun..

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

[3]  P.H.J. Chong,et al.  A survey of clustering schemes for mobile ad hoc networks , 2005, IEEE Communications Surveys & Tutorials.

[4]  Taieb Znati,et al.  Design and performance of a distributed dynamic clustering algorithm for ad-hoc networks , 2001, Proceedings. 34th Annual Simulation Symposium.

[5]  Tracy Camp,et al.  Improving the Accuracy of Random Waypoint Simulations Through Steady-State Initialization , 2004 .

[6]  P. Rousseeuw.  Silhouettes: a graphical aid to the interpretation and validation of cluster analysis , 1987 .

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

[8]  Radha Poovendran,et al.  A graph theoretic framework for preventing the wormhole attack in wireless ad hoc networks , 2007, Wirel. Networks.

[9]  Thomas Plagemann,et al.  Distributed Event Notification for Mobile Ad Hoc Networks , 2004, IEEE Distributed Systems Online.

[10]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[11]  Mario Gerla,et al.  GloMoSim: A Scalable Network Simulation Environment , 2002 .

[12]  Philippe Jacquet,et al.  Investigating the impact of partial topology in proactive MANET routing protocols , 2002, The 5th International Symposium on Wireless Personal Multimedia Communications.

[13]  Paolo Santi.  Topology control in wireless ad hoc and sensor networks , 2005 .

[14]  Benjamin H. Good,et al.  Performance of modularity maximization in practical contexts. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  F. Boutin,et al.  Cluster validity indices for graph partitioning , 2004 .

[16]  Eytan Domany,et al.  Data Clustering Using a Model Granular Magnet , 1997, Neural Computation.

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

[18]  F. Y. Wu.  The Potts model , 1982 .

[19]  M. Meilă.  Comparing clusterings---an information based distance , 2007 .

[20]  F. Radicchi,et al.  Statistical significance of communities in networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Rui Xu,et al.  Survey of clustering algorithms , 2005, IEEE Transactions on Neural Networks.

[22]  Radu State,et al.  A probabilistic approach for managing mobile ad-hoc networks , 2007, IEEE Transactions on Network and Service Management.

[23]  Ameer Ahmed Abbasi,et al.  A survey on clustering algorithms for wireless sensor networks , 2007, Comput. Commun..

[24]  Thomas Plagemann,et al.  A Data Sharing Facility for Mobile Ad-Hoc Emergency and Rescue Applications , 2007, 27th International Conference on Distributed Computing Systems Workshops (ICDCSW'07).

[25]  Vanessa Ann Davies,et al.  EVALUATING MOBILITY MODELS WITHIN AN AD HOC NETWORK , 2000 .

[26]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

[27]  Fred J. Damerau,et al.  A technique for computer detection and correction of spelling errors , 1964, CACM.

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

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

[30]  Tanya Y. Berger-Wolf,et al.  A framework for community identification in dynamic social networks , 2007, KDD '07.

[31]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[32]  J. H. Ward.  Hierarchical Grouping to Optimize an Objective Function , 1963 .

[33]  Satu Elisa Schaeffer,et al.  Dynamic Local Clustering for Hierarchical Ad Hoc Networks , 2006, 2006 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks.

[34]  Thomas Plagemann,et al.  Evaluation of Replica Placement Strategies for a Shared Data Space in Mobile Ad-Hoc Networks , 2010, 2010 13th International Conference on Network-Based Information Systems.

[35]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

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

[37]  Arthur L. Liestman,et al.  CLUSTERING ALGORITHMS FOR AD HOC WIRELESS NETWORKS , 2004 .

[38]  Ali S. Hadi,et al.  Finding Groups in Data: An Introduction to Chster Analysis , 1991 .

[39]  Mario Gerla,et al.  Efficient flooding with Passive Clustering (PC) in ad hoc networks , 2002, CCRV.