A greedy topology design to accelerate consensus in broadcast wireless sensor networks

Abstract We present techniques to improve convergence speed of distributed average consensus algorithms in wireless sensor networks by means of topology design. A broadcast network is assumed, so that only the transmit power of each node can be independently controlled, rather than each individual link. Starting with a maximally connected configuration in which all nodes transmit at full power, the proposed methods successively reduce the transmit power of a chosen node in order to remove one and only one link; nodes are greedily selected either in order to yield fastest convergence at each step, or if they have the largest degree in the network. These greedy schemes provide a good complexity–performance tradeoff with respect to full-blown global search methods. As a side benefit, improving the convergence speed also results in savings in energy consumption with respect to the maximally connected setting.

[1]  Konstantin Avrachenkov,et al.  A local average consensus algorithm for wireless sensor networks , 2011, 2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS).

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

[3]  Russell Merris,et al.  The Laplacian Spectrum of a Graph II , 1994, SIAM J. Discret. Math..

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

[5]  Anthony Ephremides,et al.  On the construction of energy-efficient broadcast and multicast trees in wireless networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[6]  J. Moura,et al.  Topology for Global Average Consensus , 2006, 2006 Fortieth Asilomar Conference on Signals, Systems and Computers.

[7]  Baltasar Beferull-Lozano,et al.  A greedy perturbation approach to accelerating consensus algorithms and reducing its power consumption , 2011, 2011 IEEE Statistical Signal Processing Workshop (SSP).

[8]  Ananthram Swami,et al.  Optimal Topology Control and Power Allocation for Minimum Energy Consumption in Consensus Networks , 2012, IEEE Transactions on Signal Processing.

[9]  Soummya Kar,et al.  Gossip Algorithms for Distributed Signal Processing , 2010, Proceedings of the IEEE.

[10]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[11]  Ajay D. Kshemkalyani,et al.  Clock synchronization for wireless sensor networks: a survey , 2005, Ad Hoc Networks.

[12]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

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

[14]  Gene H. Golub,et al.  Matrix computations , 1983 .

[15]  Bernhard Fuchs.  On the Hardness of Range Assignment Problems , 2006, CIAC.

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

[17]  Baltasar Beferull-Lozano,et al.  Accelerating Consensus Gossip Algorithms: Sparsifying Networks Can Be Good for You , 2010, 2010 IEEE International Conference on Communications.

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

[19]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[20]  Ananthram Swami,et al.  ACHIEVINGCONSENSUSINSELF-ORGANIZINGWIRELESSSENSORNETWORKS: THE IMPACTOFNETWORK TOPOLOGY ON ENERGY CONSUMPTION , 2007 .

[21]  Stephen P. Boyd,et al.  Distributed average consensus with least-mean-square deviation , 2007, J. Parallel Distributed Comput..