Secure consensus averaging in sensor networks using random offsets
Authors:
- 1 January 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 556-560
Abstract
In this work, we have examined the distributed consensus averaging problem from a novel point of view considering the need for privacy and anonymity. We have proposed a method for incorporating security into the scalable average consensus mechanisms proposed in the literature. Random Offsets Method (ROM) is lightweight, transparent and flexible since it is not based on cryptography, does not require any change in the fusion system and can be used optionally by some nodes who care about their privacy. In this method, which is based on noisification of nodes' information, we achieve robustness against n - 1 colluding adversaries in a network of in nodes, which is maximum level of robustness against collusions. Convergence and collusion robustness of ROM are analyzed mathematically and through simulation.Keywords
This publication has 5 references indexed in Scilit:
- Distributed Kalman Filter with Embedded Consensus Filters2006
- Consensus Filters for Sensor Networks and Distributed Sensor Fusion2006
- Distributed Power Allocation For OFDM Wireless Ad-Hoc Networks Based On Average Consensus2006
- Consensus Problems in Networks of Agents With Switching Topology and Time-DelaysIEEE Transactions on Automatic Control, 2004
- Secure routing in wireless sensor networks: attacks and countermeasures2003