Step-size sequence design for finite-time average consensus in secure wireless sensor networks

• DOI: 10.1016/j.sysconle.2014.01.010
• Publication Date: 2014-03-04T06:15:46Z
• Authors: Alain Y. Kibangou
• Keywords: [INFO.INFO-DC]Computer Science [cs]/Distributed; 02 engineering and technology; Parallel; 004; [SPI.AUTO]Engineering Sciences [physics]/Automatic; [SPI.AUTO] Engineering Sciences [physics]/Automatic; and Cluster Computing [cs.DC]; [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering; [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]; 0202 electrical engineering, electronic engineering, information engineering; [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]; [INFO.INFO-AU] Computer Science [cs]/Automatic Control Engineering

This paper concerns the study of average consensus in wireless sensor networks with aim of providing a way to reach consensus in a finite number of steps. In particular, we investigate the design of consensus protocols when, for security reasons for instance, the underlying graph is constrained to be strongly regular or distance regular. The proposed design method is based on parameters of the intersection array characterizing the underlying graph. With this protocol, at execution time, average consensus is achieved in a number of steps equal to the diameter of the graph, i.e. the smallest possible number of steps to achieve consensus.