Publications by Florence Bénézit

The Distributed Multiple Voting Problem

Martin Vetterli, Patrick Thiran, Florence Bénézit

A networked set of agents holding binary opinions does not seem to be able to compute its majority opinion by means of local binary interactions only. However, the majority problem can be solved using two or more bits, instead of one [1]. Pairs of agents a ...

2011

Weighted Gossip: Distributed Averaging Using Non-Doubly Stochastic Matrices

Martin Vetterli, Patrick Thiran, Florence Bénézit

This paper presents a general class of gossip-based averaging algorithms, which are inspired from Uniform Gossip [1]. While Uniform Gossip works synchronously on complete graphs, weighted gossip algorithms allow asynchronous rounds and converge on any conn ...

IEEE2010

Order-Optimal Consensus Through Randomized Path Averaging

Martin Vetterli, Patrick Thiran, Florence Bénézit

Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust mes- sage-passing schemes for distributed information processing over networks. However, for many topologies that are realistic for wire- less ...

Institute of Electrical and Electronics Engineers2010

Distributed average consensus for wireless sensor networks

Florence Bénézit

Wireless sensor networks have emerged a few years ago, enabling large scale sensing at low cost. There are many interesting problems related to this new sensing tool: designing robust and small hardware, defining adapted routing protocols, minimizing the e ...

EPFL2009

Interval consensus: from quantized gossip to voting

Martin Vetterli, Patrick Thiran, Florence Bénézit

We design distributed and quantized average consensus algorithms on arbitrary connected networks. By construction, quantized algorithms cannot produce a real, analog average. Instead, our algorithm reaches consensus on the quantized interval that contains ...

2009

Which Distributed Averaging Algorithm Should I Choose for my Sensor Network?

Martin Vetterli, Patrick Thiran, Florence Bénézit, Patrick Denantes

Average consensus and gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information processing over networks. Inspired by heat diffusion, they compute the average of ...

Institute of Electrical and Electronics Engineers2008