Академический Документы
Профессиональный Документы
Культура Документы
I. I NTRODUCTION
Manuscript received December 20, 2012; revised March 29, 2013; accepted
May 25, 2013. The associate editor coordinating the review of this paper and
approving it for publication was S. Valaee.
The authors are with the Department of Electrical and Computer Engineering, Rice University, Houston, TX 77005, USA (e-mail: {jingwen.bai,
ashu}@rice.edu).
This work was partially supported by NSF CNS-1012921 and NSF CNS1161596.
Digital Object Identifier 10.1109/TWC.2013.071913.122015
Rx
Tx
BS
Inter-node Interference
M1
M2
c 2013 IEEE
1536-1276/13$31.00
BAI and SABHARWAL: DISTRIBUTED FULL-DUPLEX VIA WIRELESS SIDE-CHANNELS: BOUNDS AND PROTOCOLS
4163
Z1
X1
BS
M1
Fig. 2.
1
m
21
X2
X3
s
21
+
+
Y1
Y3
M2
Z3
+
Y2
Z2
BS
The following equations capture the input-output relationship between transmitted and received signals:
m
Y1 =1 X1 + 21
X2 + Z 1
Y2 =2 X2 + Z2
s
Y3 =21
X3 + Z 3 ,
where for i = 1, 2, 3, Xi is the codeword with input power
constraint E(|X1 |2 ) P1 , E(|X2 + X3 |2 ) P2 . Let Zi be independently and identically distributed (i.i.d.) white Gaussian
noise with zero mean and variance of 2 . The coefficients
1 , 2 are the channel gains of the direct link from the
m
transmitters to their intended receivers, 21
is the channel gain
s
of the interference link from M1 to M2, and 21
is the channel
2
gain of the side-channel from M1 to M2. To simplify the no2
2
| m |2 P
tation, let SNR1 = |1| 2P1 , SNR2 = |2| 2P2 , INR = 212 2
| s |2 P
and SNRside = 212 2 .
III. F OUR S CHEMES FOR S IDE - CHANNEL A SSISTED
T HREE - NODE N ETWORK
In this section, we propose four distributed full-duplex
interference cancellation schemes by using a wireless sidechannel between the two mobile nodes. The four schemes
are labeled bin-and-cancel (BC), compress-and-cancel (CC),
decode-and-cancel (DC) and estimate-and-cancel (EC). Each
scheme leverages the side-channel in a different manner to
send information about INI from Node M1 to Node M2. Since
the side-channel operates on an orthogonal band compared
to the main-channel, Node M2 can use the side information
obtained from the side-channel while decoding its signal of
interest from BS.
A. Bin-and-cancel
In bin-and-cancel, we use Han-Kobayashi [11] style
common-private message splitting. The main idea behind BC
scheme is to divide the interfering message of Node M1 into
two parts: private message which can only be decoded at
the intended receiver Node BS, and common message which
can be decoded at both receivers. Next, we partition the
common message of M1 into equal size bins, encode the bin
indexes into codewords and send through the side-channel.
2 All channels are assume to be real for simplicity and all results can be
extended to complex channels.
4164
TxBS
TxM1
Fig. 3.
S1
X1
S22
X22
S20
bin l
X20
X3
Y1
RxM2
Y3
RxBS
Y2
Depiction of bin-and-cancel.
1 + INR
R2 min C SNR
2 , C SNR2
SNRside
INR
+C
+W C
(1)
W
1 + INR
SNR1 + INR
R1 + R2 C SNR
2 +C
1 + INR
SNRside
+ WC
,
W
= 1 and C(X) =
where , [0, 1], + = 1, +
Wm log (1 + X).
In the strong interference regime defined by SNR2
INR SNR2 (1 + SNR1 ), the achievable rate region is
R1 C (SNR1 )
R2 C SNR
2
R1 + R2 C SNR1 + INR
+ WC
SNRside
W
(2)
.
(3)
W = 0, we define W log 1 +
x
W
0.
strategy, the common message can be decoded at both receivers, while private message can only be decoded at the
intended receiver. Message S1 is of size 2nR1 , and X1 is
intended to be decoded at Y1 only. Message S2 is divided
into common part S20 of size 2nR20 , and private part S22 of
size 2nR22 . Superpose the codewords of both S22 and S20
such that X2 = X20 + X22 . Then partition the set [1 : 2nR20 ]
into 2nR3 equal size bins, B(l) = [(l 1)2n(R20 R3 ) + 1 :
l2n(R20 R3 ) ], l [1 : 2nR3 ], and X3 (l) is sent through the
side-channel over n blocks. In the Gaussian channels, we
assume all inputs are i.i.d. Gaussian distributed satisfying
2 ), X22 N(0, P
2 ), and
X1 N(0, P1 ), X20 N(0, P
X3 N(0, P2 ), respectively, where , [0, 1], + =
+ = 1. The parameter denotes the fraction of power
1,
allocated to the side-channel and denotes the fraction of
power split for the private message of M1.
Decoding occurs in two steps. Upon receiving
Y2 , (S20 , S22 ) are first decoded. The achievable rate
region of (R20 , R22 ) is the capacity region of a Gaussian
multiple-access channel denoted as C1 , where
R20 C SNR
2
R22 C SNR
(4)
2
1 + INR
SNRside
INR
R20 C
+W
C
W
1 + INR
SNR1 + INR
SNRside
+W
C
R1 + R20 C
.
W
1 + INR
(5)
The achievable rate region of Gaussian side-channel assisted
three-node network is the set of all (R1 , R2 ) such that
R1 , R2 = R20 + R22 satisfying that (R20 , R22 ) C1 and
(R1 , R20 ) C2 . Using Fourier-Motzkin elimination, we can
derive the results in Proposition 1.
In the strong interference regime where SNR2 INR
SNR2 (1 + SNR1 ), it is not difficult to find out the achievable
rate region is a decreasing function of (see e.g. [10]).
Therefore, we can obtain the achievable region by substituting
= 0.
When the interference is very strong where INR
SNR2 (1 + SNR1 ), Carleial ([12]) shows that the communication is not impaired by the very strong interference at all.
Because the interfered receiver can first decode the interfering
signal, then subtract it out from the received signal and finally
decode its own message. Thus the capacity region is contained
by the point-to-point capacity of uplink and downlink.
Remark 1. In the weak interference regime, BC scheme
contributes to improving the downlink rate R1 which is limited
by the interference from M1. While in the strong interference
regime where INR SNR2 , M1 sends all common message,
BAI and SABHARWAL: DISTRIBUTED FULL-DUPLEX VIA WIRELESS SIDE-CHANNELS: BOUNDS AND PROTOCOLS
W
side
1 + SNR
1
SNR1 1 + SNR1 + (1 + SNR1 + INR)
W
R1 C
SNRside W
(1 + SNR1 + INR) 1 +
1
+
(1
+
SNR
)(1
+
INR))
1
W
.
R2 C SNR
2
4165
(7)
(6)
SNRside
R2 min W C
, C SNR2
W
(8)
3) Estimate-and-cancel: We also propose an estimate-andcancel scheme which is even simpler than DC scheme. In
estimate-and-cancel, M1 sends a scaled version of the waveform of the interfering signal over the side-channel. At the
receiver M2, we first estimate the interfering signal from the
side-channel received signal Y3 , then rescale it according to
X2 and cancel it out from Y1 . Finally decode the signal-ofinterest at the main-channel receiver at M2 using single-user
4166
P2
.
Side-channel
sigwith X1 N(0, P1 ), X2 N 0, (1+K)
2
2
K P2
nal X3 is correlated with X2 such that X3 N 0, (1+K)
,
2
where K 0. The resulting rate of EC is given as follows,
with calculation of rate shown in Appendix VI-B.
Proposition 4. For Gaussian side-channel assisted three-node
full-duplex network, the following rate region is achievable for
estimate-and-cancel
2
SNRside
SNR1 1 + K(1+K)
2
R1 C
2 SNR
INR
side
1 + K(1+K)
+ (1+K)
2
2
(9)
SNR2
R2 C
,
(1 + K)2
where K 0.
+ 2 SNR
R1 + R2 C SNR1 + INR
1 INR
SNRside
+ WC
,
W
= 1.
where , [0, 1], +
= 1, +
In this section, we derive a new outer bound to characterize the performance of the four schemes discussed in
Sections III-A and III-B. When there is no INI in the sidechannel assisted three-node full-duplex network, we can obtain
the no-interference outer bound,
R1 C1
R2 C2 .
(10)
R2 C SNR
2
SNR
INR
+ SNR1 + 2
1 INR
R1 + R2 C
1 + INR
SNRside
.
+ C SNR2 + W C
W
(11)
In the strong interference regime, i.e., INR SNR2 , the
capacity region is outer bounded by
R1 C1
R2 C SNR
2
(13)
(12)
i=1
n
i=1
n
i=1
n
(17)
i=1
i=1
(16)
n
I(X3i ; Y3i )
i=1
(19)
+n1
n
n
=
I(S1 , Y2i1 , X1i ; Y1i ) +
I(X3i ; Y3i ) + n1 (20)
i=1
n
n
i=1
i=1
(21)
i=1
H(S2 |S1 )
=
=
(22)
H(S2 |Y2n , S1 )
I(S2 ; Y2 |S1 ) +
I(S2 ; Y2 n |S1 ) + n2
n
I(S2 ; Y2i |Y2i1 , S1 ) + n2
i=1
n
i=1
n
(23)
(24)
(25)
(26)
(27)
i=1
where (24) follows from Fanos inequality; (26) follows because X1i is a function of (S1 , Y2i1 ).
Now by applying the standard time sharing argument, we
can obtain
R1 + R2 I(U, X1 ; Y1 ) + I(X2 , Y2 |U, X1 ) + I(X3 ; Y3 ), (28)
for product distribution p(u)p(x1 x2 x3 |u)p(y1 y2 |x1 x2 x3 ).
BAI and SABHARWAL: DISTRIBUTED FULL-DUPLEX VIA WIRELESS SIDE-CHANNELS: BOUNDS AND PROTOCOLS
<1
(29)
<2.
= 1,
noise level at the receiver M2, i.e., INRp = INR
1
4
) RBC . We can
when INR 1. Thus RBC ( = INR
4 If INR < 1, the interference is even weaker than the Gaussian noise, one
can easily show that treating interference as noise can achieve the capacity
region to within one bit.
4167
1
compute RBC ( = INR
) directly from Proposition 1,
log
1
+
R
1
Wm + Ws
2 + SNR1
1
<
1
1+W
Wm
SNRside
BC
R2
max 0, 1 W log 1 +
Wm +Ws
W
1 + SNR2
INR
+log
INR + SNR2
1+ INR
1
1
<
1+W
Wm
2 SNR
1 INR
BC
R1 +R2
1 + log 1+
Wm + Ws
1+SNR1 + INR
1 + SNR
INR
2
+log
INR + SNR2
1 + INR
2
2.
<
1+W
(30)
Wm
2 SNR
1 INR
log 1 +
Wm + Ws
1 + SNR1 + INR
1
1.
1+W
(31)
2
SNRside 1 + 21 (INR 2).
Proof:
1) We first prove the condition on half bit capacity gap for
DC scheme. It is not difficult to find that the achievable
rate of DC is an increasing
function of W .
When W 1,
SNR2 SNRside
. Hence when
according to [9], R2 C SNR
2 +SNRside
W 1 and SNRside SNR2 , comparing with the nointerference outer bound in (10) we prove that
4168
DC
R
1
=0
DC
R
2
Wm
log (1 + SNR2 )
Wm + Ws
SNR2 SNRside
Wm
log
Wm + Ws
SNR2 + SNRside
SNR22
Wm
log 1+
=
Wm +Ws
SNR2 +SNRside +SNR2 SNRside
1
1
1+W
2
(32)
2) For EC scheme, the bandwidth ratio between sidechannel and main-channel is required to be greater than
1, i.e., W 1. Comparing the rate region of EC in
Propostion 4 with the no-interference outer bound we
have
Wm
log (1 + SNR1 )
Wm + Ws
K 2 SNRside
1
+
SNR
1
2
(1+K)
Wm
log 1 +
2
Wm + Ws
1 + K SNRside
+ INR 2
2
EC
R
(1+K)
(1+K)
Wm
log (1+
=
Wm + Ws
SNR1 INR
(1+K)2
1+
K 2 SNRside
(1+K)2
INR
(1+K)2
+ SNR1 1 +
K 2 SNRside
(1+K)2
Wm
log (1 + SNR2 )
Wm + Ws
SNR2
Wm
log 1 +
Wm + Ws
(1 + K)2
K(K+2)SNR2
Wm
(1+K)2
log 1 +
.
=
SNR2
Wm + Ws
1 + (1+K)
2
EC
R
2
(33)
of K, where
2
(INR 2), and
Therefore, when SNRside 1 + 21
1+W
2
1
1
.
1+W
2
EC
R
1
EC
R
2
(34)
SNR1
C(SNR
INR SNR2 ,
)
+
C
2
1+INR
BAI and SABHARWAL: DISTRIBUTED FULL-DUPLEX VIA WIRELESS SIDE-CHANNELS: BOUNDS AND PROTOCOLS
4169
1 +2 SNR
1 INR
NoSC
log(1 + SNR2 )+log 1+INR+SNR
1+INR
C sum
lim
=
lim
SNR1 ,SNR2 , C NoSC
SNR1 ,SNR2 ,
1
log(1 + SNR2 )+log 1+INR+SNR
sum
INR
INR
1+INR
log(SNR2 )+log(INR+SNR1 +2
SNR1 INR)log(INR)
=
lim
SNR1 ,SNR2 ,
log(SNR2 )+log(SNR1 +INR)log(INR)
INR
lim
(36)
2SNR1 + SNR2 (1 + SNR1 ) 2 SNR1 (SNR1 + SNR2 + SNR1 SNR2 )
INR
lim
=
lim
= 1.
SNR1 ,SNR2 , SNR2 (1 + SNR1 )
SNR1 ,SNR2 ,
SNR2 (1 + SNR1 )
INR
INR
(37)
INR
INR , where INR = 2SNR1 + SNR2 (1 + SNR1 )
2 SNR1 (SNR1 + SNR2 + SNR1 SNR2 ). Thus in the strong
interference regime, using the result obtained in (37) at the
top of the page, we have
NoSC
C sum
lim
=
SNR1 ,SNR2 ,INR C NoSC
sum
(38)
0 < 1,
2
NoSC
Csum
=
M NoSC =
1 < 2, (39)
Csingleuser
2
2.
When = 0, there is no interference. And 0 < 1
corresponds to the weak interference regime while 1
corresponds to the strong and very strong interference regimes.
In the no-side-channel case, only when interference level
is zero or above very strong can a maximum value of 2
for asymptotic multiplexing gain be achieved. However, INI
causes the multiplexing gain to reduce significantly in all other
regimes. For BC, the achievable sum-rate can be expressed as
SNR1
BC
max C
+ min C SNR
Rsum
2 ,
01
INR + 1
01
INR
C SNR2 + C
SNR1 + INR
+1
SNRside
+W C
.
W
(40)
And which maximizes achievable sum-rate of BC in (40)
is
(1+SNR
2 )(1+SNR1 )a(1+SNR1 +INR)
1,
4170
BC
Rsum
Csingleuser
Wm min log 1 +
SNR
2
+ log(1 + SNR),
log 1 +
SNR+INR1
2
+ log 1 +
SNR
INR
+ Wlog 1 +
SNRside
W
Wm log(1 + SNR)
min {2log (SNR) , 2log (SNR) log(INR) + Wlog (SNRside )}
log(SNR)
min{2, 2 + W }.
(41)
Csingleuser
min {2log (SNR) , log(INR) + Wlog (SNRside )}
log(SNR)
min{2, + W }.
(42)
(43)
M
min{ , 1 +
} 1 < 2.
(44)
When W = 0, namely, there is no side-channel available,
(43) will degenerate into (39). From (44), we can see that
the improvement is dominated by the interference level (i.e.,
), as well as the side-channel condition (i.e., W ). In the
weak interference regime where [0, 1), the improvement
is an increasing function of the interference level, while in
the strong interference regime where 1, the improvement
will decrease as increases. Therefore, we can obtain the
maximum multiplexing gain improvement when = 1. The
improvement rises as W increases till reaching the maximum
multiplexing gain of 2. If W 1 and = 1, then leveraging
DC
Rsum
= min{2, 1 + W } 0,
(46)
EC
Rsum
M EC =
=
Csingleuser
min{2, 2 + } 0 < + 1, W N+ ,
1 + 1, W N+ .
(47)
Csingleuser
Comparing (43) and (45)-(47), we can find out that for all
parameters, CC scheme is asymptotic sum-capacity achieving
in the weak interference regime, while in the strong interference regime, the performance of CC coincides with that of the
DC scheme. Moreover, it is straightforward to show that CC
achieves larger asymptotic multiplexing gain than DC and EC
in the weak interference regime.
Next we discuss the effect of the side-channel on the
multiplexing gain of our proposed schemes. When W = 1,
EC is also asymptotically sum-capacity achieving in the weak
interference regime in addition to BC and CC. Specifically,
for EC scheme, when W N+ and , EC can achieve a
asymptotic multiplexing gain of 2 for all interference levels.
In addition, DC can achieve a asymptotic multiplexing gain of
2 for all interference levels when W 1. For BC and CC,
a asymptotic multiplexing gain of 2 can be achieved for all
interference levels when W for [0, 1), and W 1
for 1.
The asymptotic multiplexing gain of each scheme is plotted
in Figure 4. When < , the multiplexing gain of EC is a
decreasing function of . The intuition is that the side-channel
can not provide a better estimate of the interfering signal when
the side-channel is worse than the interference link (i.e., mainchannel between M1 and M2). While for DC, when is fixed,
the multiplexing gain of DC will scale with interference level.
However, DC has poor performance when the interference
level is very low. The reasons behind this is that the optimal
power allocated to the side-channel is inversely proportional to
the interference level as derived in [9]. Therefore, uplink Node
M1 needs to allocate most of its power to the side-channel to
decode the interfering signal in the very weak interference
regime, with little power left to send its own data to the base
1.8
1.8
Sidechannel
sumcapacity
Rsum
Csingleuser
Rsum
Csingleuser
BAI and SABHARWAL: DISTRIBUTED FULL-DUPLEX VIA WIRELESS SIDE-CHANNELS: BOUNDS AND PROTOCOLS
Nosidechannel
sumcapacity
1.6
W=0.5, 2=3
1.4
4171
1.6
SNR=15 dB
1.4
Upper bound
Binandcancel
Decodeandcancel
Estimateandcancel
Compressandcancel
Nosidechannel
Binandcancel
Decodeandcancel
Compressandcancel
Nosidechannel
1.2
1
0
0.5
1.5
log INR
log SNR
1.2
1
1
2.5
0.5
0.5
1
log INR
log SNR
Sidechannel
sumcapacity
1.6
W=1, 2=
Binandcancel
Decodeandcancel
Estimateandcancel
Compressandcancel
Nosidechannel
1.4
1.2
1.5
log INR
log SNR
2.5
Rsum
Csingleuser
Nosidechannel
sumcapacity
2.5
100
1.8
0.5
Fig. 5.
Multiplexing gain of proposed schemes versus no-side-channel
achievable schemes for finite SNR when W = 1 and = .
1
0
1.5
Binandcancel
Decodeandcancel
Estimateandcancel
Compressandcancel
90
80
70
60
50
SNR=15 dB
40
30
20
10
0
1
0.5
0.5
1
log INR
log SNR
1.5
2.5
Fig. 6.
Optimal power allocated to the side-channel which maximizes
achievable sum-rates of proposed schemes for finite SNR when W = 1
and =
is better than decoding the signal to help cancel INI. For the
percentage of the optimal power allocated to the side-channel
of each scheme, only a small portion of transmit power needs
to be allocated to the side-channel in the regime where the
proposed schemes offer better performance.
V. C ONCLUSION
In a three-node full-duplex network where an infrastructure
node communicates with half-duplex mobile nodes for both
uplink and downlink simultaneously in the same band, one of
the key challenges is the inter-node interference. We identify
the availability of multi-radio interfaces on current mobile
devices to create a wireless side-channel that allows for new
approaches to mitigate inter-node interference. Therefore we
propose distributed full-duplex architecture via wireless sidechannels for advanced interference management.
In this paper, we presented four distributed full-duplex internode interference cancellation schemes by leveraging a deviceto-device side-channel for improved interference cancellation.
We characterize the bounds on the capacity region of sidechannel assisted three-node network and show that bin-and-
4172
M1: [1 : 2nR1 ]
M2: [1 : 2
nR2
X1
X2
Y1
Y3
X3
Fig. 7.
(48)
(49)
(50)
(51)
(52)
(53)
(55)
(56)
and
3 P2
I(X3 ; Y3 ) Ws log 1 +
.
W 2
q2
.
W
3 P2
2
(1 P1 + 21 P2 + ) 1 + W 2
1
(58)
(59)
BAI and SABHARWAL: DISTRIBUTED FULL-DUPLEX VIA WIRELESS SIDE-CHANNELS: BOUNDS AND PROTOCOLS
And
R1 I(X1 ; Y1 , X2 )
2 + 2 )
1 P1 (P
q
= Wm log 1 +
2 + 2 )
2 + 2 + 2 (P
21 P
q
.
(60)
q2 ,
= C SNR
2 .
(61)
P2
For estimate-and-cancel, since E(|X2 |2 ) (1+K)
2 , we
choose X1 and X2 from independent
Gaussian
codebooks
P2
with X1 N(0, P1 ), X2 N 0, (1+K)
. The correla2
and
X
is
one,
and X3
tion
coefficient
between
X
2
3
K 2 P2
N 0, (1+K)2 . For Gaussian channels, by substituting the
channel parameters and power constraint, the achievable rate
region can be calculated
R1 I(X1 ; Y1 , Y3 )
= h(Y1 , Y3 ) h(Y1 , Y3 |X1 )
2
SNRside
SNR1 1 + K(1+K)
2
=C
K 2 SNRside
INR
1 + (1+K)2 + (1+K)2
(62)
R2 I(X2 ; Y2 )
SNR2
=C
.
(1 + K)2
R EFERENCES
[1] E. Everett, M. Duarte, C. Dick, and A. Sabharwal, Empowering fullduplex wireless communication by exploiting directional diversity, in
Proc. 2011 IEEE Asilomar Conf. Signals, Syst., Comput.
[2] A. Sahai, G. Patel, and A. Sabharwal, Pushing the limits of full-duplex:
design and real-time implementation, Rice University Technical Report
TREE1104, June 2011. Available: http://arxiv.org/abs/1107.0607
[3] M. Duarte, A. Sabharwal, V. Aggarwal, R. Jana, K. Ramakrishnan,
C. Rice, and N. Shankaranarayanan, Design and characterization of
a full-duplex multi-antenna system for wifi networks, submitted to
IEEE Trans. Veh. Technol. Available: http://arxiv.org/abs/1210.1639,
Oct. 2012.
[4] J. I. Choi, M. Jain, K. Srinivasan, P. Levis, and S. Katti, Achieving
single channel, full duplex wireless communication, in Proc. 2010
International Conf. Mobile Comput. Netw., ser. MobiCom 10.
[5] M. Duarte, C. Dick, and A. Sabharwal, Experiment-driven characterization of full-duplex wireless systems, to appear IEEE Trans. Wireless
Commun.
4173