• Home
  • Search
  • Distributed average consensus for wireless sensor networks
  • Cite Icon19
  • https://doi.org/10.5075/epfl-thesis-4509Copy DOI Icon

Distributed average consensus for wireless sensor networks

  • Abstract
  • Literature Map
  • Citations
  • Similar Papers
Abstract

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 energy consumption of each component, synchronizing the sensors, etc. In this thesis, we focus on the processing of the sensed data within the network itself. We study a specific network signal processing problem, called distributed average consensus. In this problem, the sensors, which are connected in a wireless network, need to know the average of all the measurements in the network. Instead of gathering the data at a central node, which would compute the average and broadcast it to the network, average consensus algorithms offer a distributed solution to the averaging problem. By local message passing and iterative local computations only, nodes can learn the average of the measurements. More precisely, in average consensus algorithms, nodes iteratively compute local weighted averages that conserve the global average of the estimates in the network. The estimates at each node contract until they all converge to the average. Many distributed average consensus algorithms were designed and the literature is vast. This thesis starts by classifying the existing algorithms. Then it describes a small number of useful techniques, which can handle the analysis of all the algorithms. Preexisting algorithms as well as algorithms that we designed are revisited with these unifying and simple techniques. In addition, the performance of the algorithms depends on the topology of the network, and a variety of networks are explored: simple graphs as circles or trees, lattices, random geometric graphs, complete graphs etc. Finally, an extension of average consensus to voting consensus is derived. In particular, we show that with two bits of memory at each node, a network can reach consensus in finite time on majority, when the initial measurements are binary. Distributed algorithms to compute majority with finite memory for ternary and quaternary signals are also given.

Similar Papers
  • Research Article
  • Citations1

Distributed Power Control in Wireless Networks

  • Jan 01, 2008
  • 清華大學資訊工程學系所學位論文
  • 陳俊嘉
  • Supplementary Content
  • Citations2

Data Transmission in Quantized Consensus

  • Feb 01, 2014
  • Imtiaz Parvez
  • PDF
  • Research Article
  • Citations24

Distributed Mechanism for Detecting Average Consensus with Maximum-Degree Weights in Bipartite Regular Graphs

  • Nov 25, 2021
  • Mathematics
  • Martin Kenyeres +1
  • Research Article

Improved algorithm of cluster-based routing protocols for agricultural wireless multimedia sensor networks

  • Jul 31, 2016
  • International journal of agricultural and biological engineering
  • Zhang Fu +5
  • Research Article

Investigation of Different Parameters of Dynamic Source Routing for Wireless Sensor Networks for varying terrain areas and different speed (node speed)

  • Jan 01, 2011
  • International Journal of Advanced Research in Computer Science
  • Vijay Mohan Shrimal +1
  • Conference Article
  • Citations3

Average consensus in asymmetric broadcasting wireless sensor networks through gossiping

  • Nov 28, 2016
  • Ferdinand Peper +3
  • Conference Article
  • Citations2

Privacy-Preserving Average Consensus in Finite Time

  • Dec 14, 2021
  • Antai Xie +2
  • Research Article

Efficient Partial Update Algorithm over Wireless Networks

  • Nov 07, 2016
  • Current Trends in Signal Processing
  • Rupali Dewda +1
  • Supplementary Content

Context-Aware Decision Making in Wireless Networks: Optimization and Machine Learning Approaches

  • Jan 01, 2019
  • TUbilio (Technical University of Darmstadt)
  • Sabrina Klos
  • Research Article
  • Citations1

A non-asymptotic approach to the analysis of communication networks: from error correcting codes to network properties

  • Jul 24, 2013
  • Hossein Pishro-Nik +1
  • Supplementary Content

Reliable Communication in Wireless Networks

  • Jan 01, 2014
  • Politecnico di Torino
  • Linchao Zhang
  • Book Chapter
  • Citations1

Average Consensus with Bounded Execution Under Quantization Noise

  • May 08, 2019
  • Martin Kenyeres +1
  • Research Article
  • Citations6

Compressive sensing in wireless sensor network for poultry acoustic monitoring

  • Mar 31, 2017
  • International Journal of Agricultural and Biological Engineering
  • Chuanzhong Xuan +5
  • Research Article
  • Citations2

Architectures and protocols for wireless mesh, ad hoc, and sensor networks

  • Mar 01, 2011
  • Wireless Communications and Mobile Computing
  • Farid Naït-Abdesselam +3
  • Research Article
  • Citations10

Application of Harmony Search Optimization Algorithm to Improve Connectivity in Wireless Sensor Network with Non-uniform Density

  • Jul 01, 2015
  • Journal of Information Science and Engineering
  • Ali Shanon Alsaadi +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.