Distributed network size estimation and average degree estimation and control in networks isomorphic to directed graphs

Many properties of interest in graph structures are based on the nodes' average degree (i.e., the average number of edges incident to/from each node). In this work, we present asynchronous distributed algorithms, based on ratio consensus, that can be used to accurately estimate the number of nodes in a multi-component system whose communication topology is described by a directed graph. In addition, we describe an asynchronous distributed algorithm that allows each node to introduce or terminate links in order to reach a target average degree in the network. Such an approach can be useful in many realistic scenarios; for example, for the introduction and removal of renewable energy resources in a power network, while maintaining an average degree that fulfils some structural and dynamical properties and/or optimises some performance indicators of the network. The effectiveness of the proposed algorithms is demonstrated via illustrative examples.

[1]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[2]  Karl Henrik Johansson,et al.  Distributed Estimation of Diameter, Radius and Eccentricities in Anonymous Networks , 2012 .

[3]  Stephen P. Boyd,et al.  Distributed Average Consensus with Time-Varying Metropolis Weights ? , 2006 .

[4]  Jorge Cortés,et al.  Distributed algorithms for reaching consensus on general functions , 2008, Autom..

[5]  Randal W. Beard,et al.  Consensus seeking in multiagent systems under dynamically changing interaction topologies , 2005, IEEE Transactions on Automatic Control.

[6]  David D. Jensen,et al.  Accurate Estimation of the Degree Distribution of Private Networks , 2009, 2009 Ninth IEEE International Conference on Data Mining.

[7]  Jorge C. S. Cardoso,et al.  Probabilistic Estimation of Network Size and Diameter , 2009, 2009 Fourth Latin-American Symposium on Dependable Computing.

[8]  Andreas Daffertshofer,et al.  Comparing Brain Networks of Different Size and Connectivity Density Using Graph Theory , 2010, PloS one.

[9]  Dana Ron,et al.  On Estimating the Average Degree of a Graph , 2004, Electron. Colloquium Comput. Complex..

[10]  Pawe L Pra Lat,et al.  SPARSE GRAPHS ARE NOT FLAMMABLE , 2013 .

[11]  Damiano Varagnolo,et al.  Distributed statistical estimation of the number of nodes in sensor networks , 2010, 49th IEEE Conference on Decision and Control (CDC).

[12]  Amin Saberi,et al.  How to distribute antidote to control epidemics , 2010 .

[13]  Israel Cidon,et al.  Message Terminating Algorithms for Anonymous Rings of Unknown Size , 1995, Inf. Process. Lett..

[14]  Damiano Varagnolo,et al.  Distributed parametric and nonparametric regression with on-line performance bounds computation , 2012, Autom..

[15]  Christos Gkantsidis,et al.  Random walks in peer-to-peer networks: Algorithms and evaluation , 2006, Perform. Evaluation.

[16]  Stephen P. Boyd,et al.  A scheme for robust distributed sensor fusion based on average consensus , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[17]  Christoforos N. Hadjicostis,et al.  Coordination and Control of Distributed Energy Resources for Provision of Ancillary Services , 2010, 2010 First IEEE International Conference on Smart Grid Communications.

[18]  Nancy A. Lynch,et al.  Distributed computation in dynamic networks , 2010, STOC '10.

[19]  Shanshan Li,et al.  Estimation of a Population Size in Large-Scale Wireless Sensor Networks , 2009, Journal of Computer Science and Technology.

[20]  Wen-Xu Wang,et al.  Effects of average degree on cooperation in networked evolutionary game , 2006 .

[21]  Xiao-Dong Zhang,et al.  On the Laplacian eigenvalues of a graph , 1998 .

[22]  Prashant Krishnamurthy,et al.  Connectivity and critical point behavior in mobile ad hoc and sensor networks , 2009, 2009 IEEE Symposium on Computers and Communications.

[23]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[24]  Stephen P. Boyd,et al.  Fast linear iterations for distributed averaging , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[25]  Anne-Marie Kermarrec,et al.  Peer counting and sampling in overlay networks: random walk methods , 2006, PODC '06.

[26]  Christoforos N. Hadjicostis,et al.  Asynchronous coordination of distributed energy resources for the provisioning of ancillary services , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[27]  Sanja Petrovic,et al.  A new statistical approach to estimate global file populations in the eDonkey P2P file sharing system , 2009, 2009 21st International Teletraffic Congress.