## Abstract

We consider the problem of distributed average consensus where sensors exchange quantized data with their neighbors. We deploy a polynomial filtering approach in the network nodes in order to accelerate the convergence of the consensus problem. The quantization of the values computed by the sensors however imposes a careful design of the polynomial filter. We first study the impact of the quantization noise in the performance of accelerated consensus based on polynomial filtering. It occurs that the performance is clearly penalized by the quantization noise, whose impact directly depends on the filter coefficients. We then formulate a convex optimization problem for determining the coefficients of a polynomial filter, which is able to control the quantization noise while accelerating the convergence rate. The simulation results show that the proposed solution is robust to quantization noise while assuring a high convergence speed to the average value in the network.

Original language | English |
---|---|

Pages (from-to) | 184-188 |

Number of pages | 5 |

Journal | European Signal Processing Conference |

State | Published - 2010 |

Event | 18th European Signal Processing Conference, EUSIPCO 2010 - Aalborg, Denmark Duration: 23 Aug 2010 → 27 Aug 2010 |

## Keywords

- Distributed averaging
- Distributed consensus
- Polynomial filtering
- Uniform quantization