Distributed Node Counting in Wireless Sensor Networks in the Presence of Communication Noise

Distributed node counting in wireless sensor networks can be important in various applications, such as network maintenance and information aggregation. In this paper, a distributed consensus algorithm for estimating the number of nodes in a wireless sensor network in the presence of communication noise is introduced. In networks with a fusion center, counting the number of nodes can easily be done by letting each node to transmit a fixed constant value to the fusion center. In a network without a fusion center, where nodes do not know the graph structure, estimating the number of nodes is not straightforward. The proposed algorithm is based on distributed average consensus and norm estimation. Different sources of error are explicitly discussed; the Fisher information and the distribution of the final estimate are derived. Several design parameters and how they affect the performance of the algorithm are studied, which provide guidelines toward making the estimation error smaller. Simulation results corroborating the theory are also provided.

[1]  Damiano Varagnolo,et al.  Distributed Cardinality Estimation in Anonymous Networks , 2014, IEEE Transactions on Automatic Control.

[2]  Indranil Gupta,et al.  Active and passive techniques for group size estimation in large-scale and dynamic distributed systems , 2007, J. Syst. Softw..

[3]  Soummya Kar,et al.  Consensus + innovations distributed inference over networks: cooperation and sensing in networked systems , 2013, IEEE Signal Processing Magazine.

[4]  Márk Jelasity,et al.  Epidemic-style proactive aggregation in large overlay networks , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[5]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[6]  Andreas Spanias,et al.  Node counting in wireless sensor networks , 2015, 2015 49th Asilomar Conference on Signals, Systems and Computers.

[7]  M -.  Estimating Aggregates on a Peer-to-Peer Network , 2003 .

[8]  D. Manjunath,et al.  On Distributed Function Computation in Structure-Free Random Wireless Networks , 2014, IEEE Transactions on Information Theory.

[9]  Amr El Abbadi,et al.  Convergence Rates of Distributed Average Consensus With Stochastic Link Failures , 2010, IEEE Transactions on Automatic Control.

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

[11]  Donald F. Towsley,et al.  Estimating and sampling graphs with multidimensional random walks , 2010, IMC '10.

[12]  Indranil Gupta,et al.  Decentralized Schemes for Size Estimation in Large and Dynamic Groups , 2005, Fourth IEEE International Symposium on Network Computing and Applications.

[13]  N. Abreu.  Old and new results on algebraic connectivity of graphs , 2007 .

[14]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

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

[16]  Andreas Spanias,et al.  Non-Linear Distributed Average Consensus Using Bounded Transmissions , 2013, IEEE Transactions on Signal Processing.

[17]  Dahlia Malkhi,et al.  Estimating network size from local information , 2003, Information Processing Letters.

[18]  Andreas Spanias,et al.  Max-consensus using the soft maximum , 2013, 2013 Asilomar Conference on Signals, Systems and Computers.

[19]  Gurmeet Singh Manku,et al.  Symphony: Distributed Hashing in a Small World , 2003, USENIX Symposium on Internet Technologies and Systems.

[20]  Philippe Flajolet,et al.  Probabilistic Counting Algorithms for Data Base Applications , 1985, J. Comput. Syst. Sci..

[21]  Anne-Marie Kermarrec,et al.  Peer counting and sampling in overlay networks based on random walks , 2007, Distributed Computing.

[22]  Christoforos N. Hadjicostis,et al.  Distributed network size estimation and average degree estimation and control in networks isomorphic to directed graphs , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[23]  Soummya Kar,et al.  Distributed Consensus Algorithms in Sensor Networks With Imperfect Communication: Link Failures and Channel Noise , 2007, IEEE Transactions on Signal Processing.

[24]  G. Marsaglia.  Ratios of Normal Variables and Ratios of Sums of Uniform Variables , 1965 .

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

[26]  Miguel Rio,et al.  Two algorithms for network size estimation for master/slave ad hoc networks , 2009, 2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems (ANTS).

[27]  Anne-Marie Kermarrec,et al.  Peer to peer size estimation in large and dynamic networks: A comparative study , 2006, 2006 15th IEEE International Conference on High Performance Distributed Computing.

[28]  D. Hinkley.  On the ratio of two correlated normal random variables , 1969 .

[29]  Karl Henrik Johansson,et al.  Distributed size estimation of dynamic anonymous networks , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

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