Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published December 2007 | Published
Book Section - Chapter Open

Random consensus protocol in large-scale networks

Abstract

One of the main performance issues for consensus protocols is the convergence speed. In this paper, we focus on the convergence behavior of discrete-time consensus protocols over large-scale sensor networks with uniformly random deployment, which are modelled as Poisson random graphs. Instead of using the random rewiring procedure, we introduce a deterministic principle to locate certain "chosen nodes" in the network and add "virtual" shortcuts among them so that the number of iterations to achieve average consensus drops dramatically. Simulation results are presented to verify the efficiency of this approach. Moreover, a random consensus protocol is proposed, in which virtual shortcuts are implemented by random routes.

Additional Information

© 2007 IEEE.

Attached Files

Published - Jin2007p8611Proceedings_Of_The_46Th_Ieee_Conference_On_Decision_And_Control_Vols_1-14.pdf

Files

Jin2007p8611Proceedings_Of_The_46Th_Ieee_Conference_On_Decision_And_Control_Vols_1-14.pdf

Additional details

Created:
August 22, 2023
Modified:
January 13, 2024