By Topic

Convergence of a Class of Decentralized Beamforming Algorithms

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)
James A. Bucklew ; Dept. of Electr. & Comput. Eng., Univ. of Wisconsin-Madison, Madison, WI ; William A. Sethares

One of the key issues in decentralized beamforming is the need to phase-align the carriers of all the sensors in a wireless sensor 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.

Published in:

IEEE Transactions on Signal Processing  (Volume:56 ,  Issue: 6 )