Research database

Publication

Topology design for fast convergence of network consensus algorithms

Cao, M. & Wu, C. W. 2007 Proceedings of the 2007 IEEE International Symposium on Circuits and Systems (ISCAS). University of Groningen, Research Institute of Technology and Management, p. 1029-1032 4 p.

Research output: Scientific - peer-reviewConference contribution

Documents

Links

The quantities of coefficient of ergodicity and algebraic connectivity have been used to estimate the convergence rates of discrete-time and continuous-time network consensus algorithms respectively. Both of these two quantities are defined with respect to network topologies without the symmetry assumption, and they are applicable to the case when network topologies change with time. We present results identifying deterministic network topologies that optimize these quantities. We will also propose heuristics that can accelerate convergence in random networks by redirecting a small portion of the links assuming that the network topology is controllable.
Original languageEnglish
Title of host publicationProceedings of the 2007 IEEE International Symposium on Circuits and Systems (ISCAS)
PublisherUniversity of Groningen, Research Institute of Technology and Management
Publication date2007
Pages1029-1032
Number of pages4
StatePublished

Conference

ConferenceThe 2007 IEEE International Symposium on Circuits and Systems (ISCAS), New Orleans, LA, USA
Period01/01/2007 → …
Other

Event

The 2007 IEEE International Symposium on Circuits and Systems (ISCAS), New Orleans, LA, USA

01/01/2007 → …

Event: Conference

View graph of relations

ID: 2809263