Combinatorica
A proof of alon's second eigenvalue conjecture
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Fastest Mixing Markov Chain on a Graph
SIAM Review
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Random Cayley graphs and expanders
Random Structures & Algorithms
Brief A hierarchical cyclic pursuit scheme for vehicle networks
Automatica (Journal of IFAC)
Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Peer-to-peer estimation over wireless sensor networks via Lipschitz optimization
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Distributed PageRank computation with link failures
ACC'09 Proceedings of the 2009 conference on American Control Conference
Load balancing over heterogeneous networks with gossip-based algorithms
ACC'09 Proceedings of the 2009 conference on American Control Conference
On quantized consensus by means of gossip algorithm: part ii: convergence time
ACC'09 Proceedings of the 2009 conference on American Control Conference
Real-valued average consensus over noisy quantized channels
ACC'09 Proceedings of the 2009 conference on American Control Conference
On consensus over stochastically switching directed topologies
ACC'09 Proceedings of the 2009 conference on American Control Conference
Power-delay analysis of consensus algorithms on wireless networks with interference
International Journal of Systems, Control and Communications
Flocking of a team of Lagrangian agents
ROBIO'09 Proceedings of the 2009 international conference on Robotics and biomimetics
Stochastic consensus over noisy networks with Markovian and arbitrary switches
Automatica (Journal of IFAC)
IEEE Transactions on Signal Processing
Brief paper: A majorization inequality and its application to distributed Kalman filtering
Automatica (Journal of IFAC)
Brief paper: Quantized consensus in Hamiltonian graphs
Automatica (Journal of IFAC)
Control-based p-persistent adaptive communication protocol
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
An Eulerian Approach to the Analysis of Krause's Consensus Models
SIAM Journal on Control and Optimization
Mean Square Performance of Consensus-Based Distributed Estimation over Regular Geometric Graphs
SIAM Journal on Control and Optimization
Distributed Consensus for Multiagent Systems with Communication Delays and Limited Data Rate
SIAM Journal on Control and Optimization
On backward product of stochastic matrices
Automatica (Journal of IFAC)
Consensus seeking over directed networks with limited information communication
Automatica (Journal of IFAC)
Distributed cooperative spectrum sensing in cognitive radio for ad hoc networks
Computer Communications
| Hi-index | 22.16 |
The interrelationship between control and communication theory is becoming of fundamental importance in many distributed control systems, such as the coordination of a team of autonomous agents. In such a problem, communication constraints impose limits on the achievable control performance. We consider as instance of coordination the consensus problem. The aim of the paper is to characterize the relationship between the amount of information exchanged by the agents and the rate of convergence to the consensus. We show that time-invariant communication networks with circulant symmetries yield slow convergence if the amount of information exchanged by the agents does not scale well with their number. On the other hand, we show that randomly time-varying communication networks allow very fast convergence rates. We also show that by adding logarithmic quantized data links to time-invariant networks with symmetries, control performance significantly improves with little growth of the required communication effort.