By Topic

Distributed computation of averages over ad hoc networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
D. S. Scherber ; Dept. of Electr. & Comput. Eng., Univ. of Maryland, College Park, MD, USA ; H. C. Papadopoulos

In this paper, we develop algorithms for distributed computation of averages of the node data over networks with arbitrary but fixed connectivity. The algorithms we develop are linear dynamical systems that generate sequences of improving approximations to the desired computation at each node, via iterative processing and broadcasting. The algorithms are locally constructed at each node by exploiting only locally available and macroscopic information about the network topology. We present methods for optimizing the convergence rates of these algorithms to the desired computation, and evaluate their performance characteristics in the context of a problem of signal estimation from multinode noisy observations. By conducting simulations based on simple power-loss propagation models, we perform a preliminary comparison of the algorithms we develop against other types of distributed algorithms for computing averages, and identify transmit-power optimized algorithmic implementations as a function of the size and density of the sensor network.

Published in:

IEEE Journal on Selected Areas in Communications  (Volume:23 ,  Issue: 4 )