Broadcast-based dynamic consensus propagation in wireless sensor networks

Consensus propagation (CP) is an attractive distributed asynchronous averaging algorithm. In this paper, we develop a modified CP protocol for wireless sensor networks (WSN) that uses message broadcast instead of bilateral message exchange, thereby significantly reducing transmit energy. Furthermore, we extend CP to dynamic environments. We show that the distributed nature of the algorithm causes an inherent tracking delay which we propose to compensate by incorporating an appropriately designed linear predictor. The performance of dynamic broadcast CP is assessed via numerical simulations for severalWSN topologies.

[1]  Ananthram Swami,et al.  Wireless Sensor Networks: Signal Processing and Communications , 2007 .

[2]  Béla Bollobás,et al.  Random Graphs , 1985 .

[3]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[4]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[5]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[6]  Benjamin Van Roy,et al.  Consensus Propagation , 2005, IEEE Transactions on Information Theory.

[7]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.