Convergence of a Class of Decentralized Beamforming Algorithms

1 August 2007

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

p. 123-125
https://doi.org/10.1109/ssp.2007.4301231

Abstract

One of the key issues in decentralized beamforming is the need to phase-align the carriers of all the sensors in the network. Recent work in this area has shown the viability of certain methods that incorporate single-bit feedback from a beacon. This paper analyzes the behavior of the method (showing conditions for convergence in distribution and also giving a concrete way to calculate the final distribution of the convergent ball) and then generalizes the method in three ways. First, by incorporating both negative and positive feedback it is possible to double the convergence rate of the algorithm without adversely effecting the final variance. Second, a way of reducing the amount of energy required (by reducing the number of transmissions needed for convergence) is shown; its convergence and final variance can also be conveniently described. Finally, a wideband analog is proposed that operates in a decentralized manner to align the time delay (rather than the phase) between sensors.

Keywords

This publication has 7 references indexed in Scilit:

Collaborative beamforming for distributed wireless ad hoc sensor networks
IEEE Transactions on Signal Processing, 2005
On the Capacity of Large Gaussian Relay Networks
IEEE Transactions on Information Theory, 2005
The covering problem and μ-dependent adaptive algorithms
IEEE Transactions on Signal Processing, 1994
Weak convergence and local stability properties of fixed step size recursive algorithms
IEEE Transactions on Information Theory, 1993
Markov Processes
Published by Wiley ,1986
Adaptive filtering with binary reinforcement
IEEE Transactions on Information Theory, 1984
Adaptive filter performance with nonlinearities in the correlation multiplier
IEEE Transactions on Acoustics, Speech, and Signal Processing, 1982