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 receive r has perfect channel state information, but there is a low-ra te feedback link from the receiver to the transmitters. In this setting, a framework for systematically analyzing the performance of a general set of distributed beamforming schemes is proposed. To illustrate the advantage of this framework, a simple adaptive distributed beamforming scheme that was recently proposed by Mudambai et al. is studied. Two important properties for 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.
[1]
Roger J.-B. Wets,et al.
Minimization by Random Search Techniques
,
1981,
Math. Oper. Res..
[2]
Helmut Bölcskei,et al.
Distributed spatial multiplexing with 1-bit feedback
,
2007,
ArXiv.
[3]
Z. Tang.
Adaptive partitioned random search to global optimization
,
1994,
IEEE Trans. Autom. Control..
[4]
R. Durrett.
Probability: Theory and Examples
,
1993
.
[5]
K. Ramchandran,et al.
Distributed Beamforming using 1 Bit Feedback : from Concept to Realization
,
2006
.
[6]
C. D. Gelatt,et al.
Optimization by Simulated Annealing
,
1983,
Science.
[7]
Leyuan Shi,et al.
Nested Partitions Method for Global Optimization
,
2000,
Oper. Res..