TY - JOUR
T1 - A random search framework for convergence analysis of distributed beamforming with feedback
AU - Lin, Che
AU - Veeravalli, Venugopal V.
AU - Meyn, Sean P.
N1 - Funding Information:
Manuscript received July 02, 2008; revised December 08, 2009. Date of current version November 19, 2010. This work was supported (in part) by the National Science Foundation under awards CCF 0431088 and CNS 0831670, and ITMANET DARPA under RK 2006-07284 through the University of Illinois, and by a Vodafone Foundation Graduate Fellowship. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of NSF or DARPA.
PY - 2010/12
Y1 - 2010/12
N2 - The focus of this work is on the analysis of transmit beamforming schemes with a low-rate feedback link in wireless sensor/relay networks, where nodes in the network need to implement beamforming in a distributed manner. Specifically, the problem of distributed phase alignment is considered, where neither the transmitters nor the receiver has perfect channel state information, but there is a low-rate feedback link from the receiver to the transmitters. In this setting, a framework is proposed for systematically analyzing the performance of distributed beamforming schemes. To illustrate the advantage of this framework, a simple adaptive distributed beamforming scheme that was recently proposed by Mudambai is studied. Two important properties of the received signal magnitude function are derived. Using these properties and the systematic framework, it is shown that the adaptive distributed beamforming scheme converges both in probability and in mean. Furthermore, it is established that the time required for the adaptive scheme to converge in mean scales linearly with respect to the number of sensor/relay nodes.
AB - The focus of this work is on the analysis of transmit beamforming schemes with a low-rate feedback link in wireless sensor/relay networks, where nodes in the network need to implement beamforming in a distributed manner. Specifically, the problem of distributed phase alignment is considered, where neither the transmitters nor the receiver has perfect channel state information, but there is a low-rate feedback link from the receiver to the transmitters. In this setting, a framework is proposed for systematically analyzing the performance of distributed beamforming schemes. To illustrate the advantage of this framework, a simple adaptive distributed beamforming scheme that was recently proposed by Mudambai is studied. Two important properties of the received signal magnitude function are derived. Using these properties and the systematic framework, it is shown that the adaptive distributed beamforming scheme converges both in probability and in mean. Furthermore, it is established that the time required for the adaptive scheme to converge in mean scales linearly with respect to the number of sensor/relay nodes.
KW - Array signal processing
KW - convergence of numerical methods
KW - detectors
KW - distributed algorithms
KW - feedback communication
KW - networks
KW - relays
UR - http://www.scopus.com/inward/record.url?scp=78649340182&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78649340182&partnerID=8YFLogxK
U2 - 10.1109/TIT.2010.2080590
DO - 10.1109/TIT.2010.2080590
M3 - Article
AN - SCOPUS:78649340182
SN - 0018-9448
VL - 56
SP - 6133
EP - 6141
JO - IRE Professional Group on Information Theory
JF - IRE Professional Group on Information Theory
IS - 12
M1 - 5625651
ER -