Академический Документы
Профессиональный Документы
Культура Документы
5, MAY 2007
It is encouraging to note that the achievable beamforming The authors in [10] also studied the performance of distrib-
gains from imperfect phase synchronization are substantial. uted beamforming in sensor networks. They model the sensor
Consider the simple example of two equal amplitude signals locations as random and evaluate the effect of location (and
from two transmitters combining at the BS with relative phase) uncertainty on the average beampattern. These results
phase
error of δ. The resulting signal amplitude is given are consistent with and complementary to the results in this
by 1 + ejδ = 2 cos 2δ . Even a significant phase error of paper. While [10] examines the beampattern averaged over all
δ = 30◦ gives a signal amplitude of 1.93, which is 96% of the possible sensor placements, we consider some fixed placement
maximum possible amplitude of 2.0 corresponding to the zero and examine the synchronization process in detail.
phase error case. More generally, we show that it is possible to In summary, most prior work on cooperative communication
achieve SNR of up to 70% of the maximum with moderately [10], [4], [1], [3] takes synchronization as a given. To the best
large phase errors1 on the order of 60◦ . of our knowledge, the protocol presented in this paper (which
The feasibility of distributed beamforming then depends minimizes coordination with the BS), and the complementary
on being able to keep the synchronization errors sufficiently protocol in our related work [11] (which utilizes feedback
small. We examine the different possible sources of phase error from the BS to minimize coordination among the transmitters),
in detail. We observe that phase noise in practical oscillators are the first detailed studies of the synchronization mecha-
causes them to drift out of synchronization, therefore, it is nisms required for large-scale cooperative communication.
necessary for the master sensor to resynchronize the slaves The rest of this paper is organized as follows. Section II
periodically. This, combined with the duplexing constraints presents a simple analysis of the effect of imperfect synchro-
of the wireless channel (i.e. it is not possible to transmit nization on beamforming gain. This shows the high tolerance
and receive on the same frequency simultaneously), reveals for phase errors. We present a master-slave architecture for
a fundamental tradeoff between synchronization overhead and synchronization in Section III, and derive a distributed pro-
beamforming gain. We quantify this tradeoff using a stochastic tocol for beamforming based on this architecture. The main
model for the internal phase noise of oscillators. contributor to the residual phase error is oscillator noise, and
There is now a growing body of research about cooper- Section IV offers a stochastic analysis of this noise, and
ative transmission systems, including studies of distributed identifies a tradeoff between the synchronization overhead and
coding techniques for space-time diversity gains [1]. Diversity beamforming gain. Section V concludes.
schemes do not offer average SNR gains, but rather reduce the
probability of an outage event. Distributed diversity schemes II. A NALYSIS OF B EAMFORMING G AIN
are, therefore, of interest only in fading channels, and do not We consider a cluster of N sensors, communicating a
require coherent combining of signals. However, because typ- common (baseband) message signal m(t) to a distant Base
ical diversity coding schemes [2] require a baseband channel Station receiver, by modulating m(t) with a carrier signal at
that is constant at least over the length of a codeword, there frequency fc . Each sensor derives its carrier signal from a
is an implicit assumption of carrier frequency synchronization separate local oscillator, therefore, the carrier signals of the
among the cooperating transmitters. different sensors are not initially synchronized to each other.
In contrast, beamforming offers SNR gains in both de- Therefore, an explicit synchronization process is necessary.
terministic and fading channels, and in addition for fading Before we present our algorithm for carrier synchronization,
channels reduces the probability of outage. However, dis- we show using a simple analysis that beamforming gains
tributed beamforming requires a globally consistent phase are robust to moderately large phase errors. For this section
reference in addition to carrier frequency synchronization. we assume that the synchronization algorithm allows each
Other authors have also independently considered the idea of sensor to obtain synchronized carrier signals at frequency
using distributed transmitters as a virtual antenna array [3]. fc and an estimate of their own channel gain to the BS.
The performance of distributed beamforming has been Using this the sensors can cooperatively transmit the message
previously studied from an information theoretic perspective m(t) by beamforming, just like a centralized antenna array.
[4], [5]. In [6], the authors studied the scalability of ad- The resulting received signal r(t) is the superposition of
hoc networks using distributed beamforming with a “Listen the channel-attenuated transmissions of all the sensors and
and Transmit” protocol. Further, they considered the effects additive noise n(t):
of imperfect synchronization and showed that the scalability
results still hold in the presence of synchronization errors. r(t) = m(t)ej2πfc t gi hi ejφi (t) + n(t) (1)
In [7], the authors propose a synchronization protocol that i
is suitable for coherent transmission. However, this requires where gi is the pre-amplification and φi (t) is the cumulative
significant coordination with the distant BS, and does not scale phase error from the synchronization process for slave i. Under
for a large number of transmitters. In recent work, the authors a constraint on the total transmit power, the optimum |gi | ≡
in [8] propose a distributed phase synchronization protocol for |hi |.
two transmitters. Most work in the literature on clock synchro- The phase errors have two effects on the received signal:
nization, (e.g. [9]) focuses on network synchronization, and is a reduction in the average SNR, and a time-dependent fluc-
unsuitable for distributed beamforming. tuation of the received phase. The latter effect may cause
1 The phase errors are the result of random noise, and are, therefore, random
limitations in the coherent demodulation of digital signals.
variables. In this paper we use the term “large phase error” to indicate a phase However, there are several methods, e.g. differential modu-
error distribution with a large root-mean squared error. lation, available to deal with these fluctuations provided the
1756 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY 2007
III. A M ASTER -S LAVE A RCHITECTURE FOR the phase response of the RF amplifiers at the master and
B EAMFORMING slave sensor. These offsets are fixed and precisely known,
In this section, we present a protocol for achieving carrier and therefore, can be corrected for. However, the propagation
phase synchronization based on a master-slave architecture. delay of the wireless channel between master and slave also
This is a multi-step process, and each step contributes to the contributes to γi . This contribution can be characterized by an
overall phase error φi (t) that limits the beamforming gain. We effective channel length di as γi = 2πfcc di .
now look at each step of the synchronization in detail. Unfortunately, for the high-frequency RF carriers typical
The idea behind the protocol is illustrated in Fig. 4. The of wireless networks, even a small uncertainty in channel
master sensor has a local oscillator which generates a sinusoid length di causes substantial phase uncertainty e.g. at fc = 1.0
c0 (t): GHz, the wavelength of the transmission is 30 cm, and an
uncertainty of 15 cm in the channel length causes an uncer-
c0 (t) = c̃0 (t) , where c̃0 (t) = ej(2πfc t+γ0 ) (7) tainty of 180◦ in γi . If left uncorrected this is disastrous for
that serves as the reference signal for the network. The master distributed beamforming, because a 180◦ offset would change
sensor broadcasts c0 (t) to all the slaves. We assume that constructive interference between transmitters into destructive
the local communication channel between master and slave interference. In centralized antenna arrays, the array elements
sensors has a large SNR and ignore the receiver noise in this are arranged in a known geometry, and therefore, the offset for
channel. After reception and amplification, the slave sensor i each element can be precisely computed. This is not a reason-
receives the signal broadcast by reception and amplification, able assumption for ad-hoc and sensor networks considered in
the slave sensor i receives the signal broadcast by the master this paper. Thus it is necessary to develop methods to explicitly
as: measure and correct for this unknown offset. Fortunately,
if the sensors are not moving relative to each other, this
ci,0 (t) = c̃i,0 (t) , where c̃i,0 (t) = Ai,0 ej(2πfc t+γ0 −γi ) offset stays roughly constant for significant time intervals,
(8) and therefore, frequent recalibration is not required. In Section
where γi is the phase shift between the master and slave. Ai,0 III-A, we describe a protocol for performing this calibration,
is the amplitude of the received signal, its precise value is based on each slave sensor transmitting their frequency-locked
unimportant to the phase synchronization process (as the PLL carrier signal ci,0 (t) back to the master sensor. We now
is only sensitive to its phase). We simply set the term Ai,0 to sketch the process of channel estimation, and the algorithm
unity, and the constant γ0 to zero for simplicity. for distributed beamforming assuming that slave i has an
The sensor i uses this signal ci,0 (t) from (8) as input to estimate γˆi = γi + φei of its phase offset, where φei is the
a second-order phase locked-loop, driven by a VCO with a estimation error in the phase calibration. Slave i then has the
quiescent frequency close to fc . From PLL theory [12], we can calibrated carrier signal ci (t), which it uses to perform channel
show that the steady-state phase error between VCO output estimation and beamforming:
and ci,0 (t) is zero, and therefore, the steady-state VCO output
can be used as a carrier signal consistent across all sensors - ci (t) = c̃i (t)
provided that the offset γi can be corrected for. where c̃i (t) = c̃i,0 (t)ejγ̂i
The phase offset γi is the total phase shift between the e
= ej2πfc t+jφi (9)
master sensors’ reference oscillator signal c0 (t), and the input
signal at the slave sensors’ PLL to which the slave VCO is So far the synchronization process has been coordinated
synchronized in steady-state. One contribution to γi is from within the sensor network by the master sensor without
1758 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY 2007
and C in Fig. 5. Let the random phase values at these instants B. Comparison with fundamental Cramer-Rao bounds
be denoted as φA , φB and φC , and their standard deviations as So far in this analysis we have limited ourselves arbitrarily
σA , σB and σC respectively. By the cyclostationarity of φdi (t), to a second-order PLL because it is the most commonly used
σC ≡ σA . Using the linearity of the PLL’s phase response, device in practice. However, we can also derive fundamental
we can write the phase at time B as the superposition of the limits on the size of the frequency and phase offsets, by
deterministic decay of the initial error φA , to a small fraction viewing the PLL as a frequency and phase estimator. The
ρ of its starting value (ial error φA , to a small fraction ρ of PLL uses the (noisy) oscillator signal in the sync timeslot to
its starting value (e.g. ρ = 1%), and a noise term: form estimates fˆl and φ̂. It uses the estimate φ̂ to drive the
phase difference with the PLL input to zero, and fˆl to tune the
φB = ρφA + ψ1 (22) VCO’s input to the frequency of the reference, and the sample-
and-hold element keeps the VCO tuned to that estimate in
φB is small by design, and its variance can be written as:
the transmit timeslot. The Cramer-Rao lower bound for the
2
σB = ρ2 σA
2
+ Np ωn (23) variance of these offsets has been computed in previous work
on frequency estimation [14]:
In addition to the small phase error, at time instant B, the VCO . 3Np
σ̂f2 = var(fˆl ) = 2 3
input is sampled to set the VCO frequency for the transmit π T1
timeslot. The sampled value has a random offset Δf from . 2Np
the reference carrier frequency, and this offset consists of a σ̂φ2 = var(φ̂) = (28)
T1
transient term and a noise term:
Using the same values used in Fig. 8, we find σ̂f = 2.5
Δf = ρωn φA + ωn ψ3 Hz, and σ̂φ
1◦ . Since σ̂f = 2.5 Hz, and σ̂φ
1◦ . Since
σ̂f is substantially smaller than the PLL’s root-mean squared
Therefore σf2 = ρ2 ωn2 σA
2
+ ωn3 Np (24) frequency offset σf = 418 Hz, we conclude that there is
significant suboptimality in using an analog PLL, therefore,
We have for the evolution of the phase between time instants
performance can be further improved by using optimal digital
B and C:
processing.
φC = Δf T2 + φB + ψ2 (25)
V. C ONCLUSION
Of the three terms in (25), the frequency offset is the dominant We have investigated a master-slave architecture for achiev-
term because it causes a phase drift that grows with time. The ing the carrier synchronization necessary for distributed trans-
phase φB is small by design, and ψ2 represents a stationary mit beamforming. There are several sources of synchroniza-
term, and we can safely neglect both terms compared to the tion error in this procedure, and the aggregate phase errors
linear drift. This is also illustrated in the simulation shown in limit the achievable SNR gains from beamforming. We iden-
Fig. 8. Thus we have: tified the dominant source of errors as VCO drift arising
2 2 from time-division duplexed operation of the synchroniza-
σC ≡ σA = σf2 T22 (26)
tion protocol. We examined the phase noise process of a
Combining (24), (23) and (26), we get: second order analog PLL by simulation and analysis, and
calculated the resulting beamforming gains. We also compared
2 Np ωn3 T22 the performance of the PLL with the fundamental Cramer-
σA = (27)
1 − ρ2 ωn2 T22 Rao estimation bounds. Our results show that even with
the suboptimal analog PLL, and with phase errors on the
Fig. 8 shows a simulation of the phase error over time with order of 60◦ , it is possible to achieve SNR gains of 70%
T1 = 150μsec, T2 = 0.85 ms, ωn = 100 kHz, ρ = 1% of the maximum. In summary, our investigation indicates that
and Np = 7 × 10−11 Hz −1 or −101 dBc/Hz. The VCO in implementation of distributed beamforming at RF frequencies
this simulation has a quiescent frequency that is 1 kHz offset is challenging but potentially feasible.
from the reference carrier signal. The spectral density of phase One way to improve the beamforming performance is to
noise is chosen conservatively compared to typical numbers use an optimal frequency and phase estimator instead of an
reported e.g. −110 dBc/Hz in [13]. For these numbers, we analog PLL. This would require a more sophisticated digital
get σA ≈ 24◦ from (27). Since the phase error is a Gaussian implementation, and a detailed performance study of such a
variable with standard deviation smaller than 24◦ at all times, scheme is a topic for future work.
βφ = E(cos φi ) ≥ 0.91, and by Proposition 1, we can see that In this paper, we studied a reciprocity based approach to
average beamforming gains of at least 91% are achievable. channel estimation designed to minimize coordination with the
This is an average number and occasionally, phase errors BS. An alternative methodology for distributed beamforming
larger than this can occur as seen in Fig. 8, where phase error is to use feedback from the receiver (i.e. the BS) for distributed
becomes almost 35◦ at one point. Even with this large phase phase synchronization. We explored this approach in [11], [15]
error, the resulting beamforming gain is 81% of the maximum. and our results are promising. It is also possible to combine
This confirms the results of Section II, that beamforming gain these ideas with multi-hop routing schemes for wireless net-
is robust to phase errors and demonstrates the basic feasibility works. These issues are not considered in this present work
of the distributed beamforming algorithm. and are interesting areas for further inquiry.
1762 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY 2007
2
A PPENDIX I where α = E[hi cos(φi )] = E[cos(φi )]. Invoking the
P ROOFS : central limit theorem, as N gets large, the first term in (35)
Proof of Proposition 1: We can rewrite (2) as follows: 2 random variable with mean 0 and variance
tends to a Gaussian
2 σc2 ≡ var[hi cos(φi )]. Similarly, the second term tends
1 N
2 jφ
PR = N
hi e
i
(29) 2 random variable with mean 0 and variance
to a Gaussian
N σs2 ≡ var[hi sin(φi )]. Since the last term in (35) is real and
i=1
constant, it only shifts the mean of the first Gaussian random
Invoking
2 the law of large numbers, and the fact that the
variable, so we can write
{ hi }, are i.i.d. exponential random variables which are 2
independent from the i.i.d {φi }, we have PR ≈ Xc + jXs (36)
1 2 jφi
N
√ 2 2
2 where Xc ∼ N ( N
hi e → E hi (cos φi + j sin φi ) a.s. (30) 2σc ), and Xs ∼ N (0, σs ). Making
α,
N i=1 use of the fact that hi is a unit mean exponential random
The expectation on the RHS of (30) simplifies as follows variable,
2 2
2
E hi (cos φi + j sin φi ) = E[hi ]E[cos φi ] σc2 = var[hi cos(φi )]
4 2
= E[cos φi ] (31) = E[hi cos2 (φi )] − E[hi cos(φi )]2
We have assumed that φi is symmetrically distributed around = 2E[cos2 (φi )] − E[cos(φi )]2
0, and hence E[sin φi ] = 0. Equation (31) results because and similarly, σs2 = 2E[sin2 (φi )] (37)
2
hi ∼ CN (0, 1) and hence hi is exponential with unit mean. √
We thus have that Letting mc ≡ N α, we have that PR = Xc2 + Xs2 , as given.
2 The variance of PR follows from standard calculations for
1 N
2 jφ
hi e i
→ (E[cos(φi )])2 a.s. (32) moments of Gaussian random variables.
N
i=1
since continuous functions of variables which are converging
almost surely also converge almost surely, and the desired R EFERENCES
result follows.
[1] J. Laneman and G. Wornell, “Distributed space-time-coded protocols
for exploiting cooperative diversity in wireless networks,” IEEE Trans.
Proof of Proposition 2: The expected value of PR can be Inf. Theory, vol. 49, no. 10, pp. 2415–2425, Oct. 2003.
written as [2] S. Alamouti, “A simple transmit diversity technique for wireless commu-
N nications,” IEEE J. Sel. Areas Commun., vol. 16, no. 8, pp. 1451–1458,
1 2 N
2 −jφ Oct. 1998.
E[PR ] = E hi e i
jφ hl e l
[3] M. Dohler, J. Dominguez, and H. Aghvami, “Link capacity analysis
N i=1 for virtual antenna arrays,” in Proc. 56th IEEE Vehicular Technology
l=1
1 N (N − 1) 2 2 Conference 2002, vol. 1, pp. 440–443.
= (N + E[ h1 h2 [4] A. swol Hu and S. Servetto, “Optimal detection for a distributed trans-
N 2 mission array,” in Proc. IEEE International Symposium on Information
.2(ej(φ1 −φ2 ) )] (33) Theory 2003, pp. 200–200.
[5] O. Oyman, R. Nabar, H. Bolcskei, and A. Paulraj, “Characterizing the
statistical properties of mutual information in MIMO channels,” IEEE
1 N (N − 1) Trans. Signal Processing, vol. 51, no. 11, pp. 2784–2795, Nov. 2003.
= N+ 2E[cos(φ1 − φ2 )] [6] B. Hassibi and A. Dana, “On the power efficiency of sensory and ad-
N 2 hoc wireless networks,” in Proc. IEEE International Symposium on
= 1 + (N − 1)E[cos(φ1 − φ2 )] Information Theory 2003, pp. 412–412.
[7] Y.-S. Tu and G. Pottie, “Coherent cooperative transmission from mul-
= 1 + (N − 1)E[cos(φ1 ) cos(φ2 ) tiple adjacent antennas to a distant stationary antenna through AWGN
− sin(φ1 ) sin(φ2 )] channels,” in Proc. 55th IEEE Vehicular Technology Conference Spring
2002, vol. 1, pp. 130–134.
= 1 + (N − 1)E[cos(φi )]2 (34) [8] D. Brown, A method for carrier frequency and phase synchronization
of two autonomous cooperative transmitters. [Online]. Available:
where we have used the fact that the {hi }, {φi } are i.i.d. and http://spinlab.wpi.edu/publications/conferences/Brown SPAWC 2005.pdf
that the {φi } are symmetrically distributed around 0. [9] J. Elson, L. Girod, and D. Estrin, “Fine-grained network time synchro-
nization using reference broadcasts,” SIGOPS Oper. Syst. Rev., vol. 36,
no. SI, pp. 147–163, 2002.
Proof of Proposition 3: We once again begin with the [10] H. Ochiai, P. Mitran, H. Poor, and V. Tarokh, “Collaborative beamform-
definition for PR . ing for distributed wireless ad hoc sensor networks,” IEEE Trans. Signal
N 2 Process. (See also IEEE Trans. Acoustics, Speech, Signal Processing,
1 2 2
vol. 53, no. 1053-1058, pp. 4110–4124, 2005.)
PR = √ hi cos(φi ) + j hi sin(φi ) [11] R. Mudumbai, J. Hespanha, U. Madhow, and G. Barriac, “Scalable
N i=1 feedback control for distributed beamforming in sensor networks,” in
Proc. IEEE Intl. Symp. on Inform. Theory (ISIT) 2005.
1 N
2 [12] H. Meyr and G. Ascheid, Synchronization in Digital Communications.
= √ (hi cos(φi ) − α) New York: John Wiley and Sons, 1990.
N [13] B. Razavi, “A study of phase noise in CMOS oscillators,” IEEE J. Solid-
i=1
2 State Circuits, vol. 31, no. 3, pp. 331–343, 1996.
1 2
N √
[14] D. Rife and R. Boorstyn, “Single tone parameter estimation from
+j √ hi sin(φi ) + N α (35) discrete-time observations,” IEEE Trans. Inf. Theory, vol. 20, no. 5,
N pp. 591–598, 1974.
i=1
MUDUMBAI et al.: ON THE FEASIBILITY OF DISTRIBUTED BEAMFORMING IN WIRELESS NETWORKS 1763
[15] R. Mudumbai, B. Wild, U. Madhow, and K. Ramchandran, “Distributed Upamanyu Madhow (S 86 M 90 SM 96 F 05)
beamforming using 1 bit feedback: from concept to realization,” in Proc. received the bachelor’s degree in electrical engi-
44th Allerton Conference on Communication Control and Computing, neering from the Indian Institute of Technology,
Sept. 2006. Kanpur, India, in 1985, and the M.S. and Ph.D.
degrees in electrical engineering from the University
Raghuraman Mudumbai received the B. Tech of Illinois, Urbana-Champaign, in 1987 and 1990,
degree in electrical engineering from the Indian respectively. From 1990 to 1991, he was a Visiting
Institute of Technology, Madras, India in 1998, Assistant Professor at the University of Illinois.
and the MS degree in electrical engineering from From 1991 to 1994, he was a Research Scientist
Polytechnic University, Brooklyn, USA in 2000. He with Bell Communications Research, Morristown,
is currently working for his Ph.D at the University NJ. From 1994 to 1999, he was on the faculty
of California Santa Barbara. of the Department of Electrical and Computer Engineering, University of
Illinois, Urbana-Champaign. Since December 1999, he has been with the
Department of Electrical and Computer Engineering, University of California,
Santa Barbara, where he is currently a Professor. His research interests are in
communication systems and networking, with current emphasis on wireless
Gwen Barriac received the B.S. degree in electrical communication, sensor networks, and data hiding. Dr. Madhow is a recipient
engineering from Princeton University, Princeton, of the NSF CAREER award. He has served as Associate Editor for Spread
NJ, in 1999, and the M.S. and Ph.D. degrees in Spectrum for the IEEE Transactions on Communications, and as Associate
electrical engineering from the University of Cal- Editor for Detection and Estimation for the IEEE Transactions on Information
ifornia at Santa Barbara in 2004. She is currently Theory.
with Qualcomm, San Diego, CA.