Skip to content

Advertisement

EURASIP Journal on Wireless Communications and Networking
EURASIP Journal on Wireless Communications and Networking Cover Image
  • Research
  • Open Access

On an HARQ-based coordinated multi-point network using dynamic point selection

EURASIP Journal on Wireless Communications and Networking20132013:209

https://doi.org/10.1186/1687-1499-2013-209

©  Makki et al.; licensee Springer. 2013

  • Received: 25 February 2013
  • Accepted: 2 August 2013
  • Published:

Abstract

This paper investigates the performance of coordinated multi-point (CoMP) networks in the presence of hybrid automatic repeat request (HARQ) feedback. With an information theoretic point of view, the throughput and the outage probability of different HARQ protocols are studied for slow-fading channels. The results are compared with the ones obtained in the presence of repetition codes and basic HARQ, or when there is no channel state information available at the base stations. The analytical and numerical results demonstrate the efficiency of the CoMP-HARQ techniques in different conditions.

Keywords

  • Channel State Information
  • Outage Probability
  • Maximum Ratio Combine
  • Backhaul Link
  • Repetition Code

1 Introduction

Coordinated multi-point (CoMP), also known as network multiple-input multiple-output (MIMO), is one of the most promising techniques for improving the data transmission efficiency of wireless cellular networks [1–4]. The main idea of a CoMP network is to allow geographically separated base stations (BSs) to cooperate in serving the users. The cooperation is achieved through high-speed backhaul links such that the users’ data and channel state information (CSI) can be shared between the BSs. Theoretically, coordinated systems should outperform non-cooperative schemes. In practice, however, the performance gain of the CoMP networks largely depends on (1) the amount of CSI available at the transmitters (CSIT) and receivers (CSIR) and (2) the limited capacity of the backhaul links. This is the main motivation for studying the CoMP systems under limited CSI and backhaul capacity conditions, which has become a hot topic recently.

Performance of CoMP networks has been studied, e.g., by [5–10] under a perfect CSI assumption and by [11–14] in finite backhaul capacity conditions. The papers dealing with imperfect CSI in CoMP networks can be divided into two categories. The first group is the ones in which both the CSIT and the CSIR are assumed to be partially known [14–17]. In these works, the focus is on investigating the effect of training signals, providing imperfect CSIR, on the network performance. The second group, on the other hand, is the papers in which, while the receivers are assumed to perfectly estimate the channels (perfect CSIR), the BSs have access to imperfect CSIT obtained by quantized CSI feedback [18–30]. Here, it is concentrated on the effects of the CSIT quantization and the quantized CSIT error is normally modeled as Gaussian noise. However, some other CSI quantization schemes have been summarized in [21–28] as well. Finally, to study the effect of BS synchronization, [27–30] have considered the cases where the BSs are provided with quantized CSI of the channel phase, while the amplitudes are perfectly fed back. Some of the most important conclusions drawn from these works are as follows:

  • Compared to non-cooperative systems, the cooperation-based schemes suffer more from inaccurate CSIR. That is, the CoMP systems need larger number of pilot symbols than single-cell transmission to make use of its potential [14–17]. Therefore, the CoMP networks are more appropriate for low-mobility communication setups, where the channels change slowly and can be estimated accurately.

  • The presence of phase ambiguity and asynchronous data transmission can degrade the system performance severely and even make it worse than a non-CoMP model [28–30]. Particularly, an important phase ambiguity source, not considered by [28–30], is phase-noise and frequency offset [31, 32] which makes the synchronization very difficult.

  • For realistic results, simple cooperation schemes should be considered, where not only the amount of backhaul capacity and feedback resources is minimized but also the implementation complexity is as low as possible.

These points are the main motivations for our paper. Here, the goal is to develop a simple cooperation scheme for low-mobility CoMP networks which leads to minimum feedback requirement, acceptable backhauling resources, and affordable implementation complexity. Therefore, we propose that hybrid automatic repeat request (HARQ) feedback is selected and, at every moment, each user is served by a single BS, while the serving BSs are switched in the successive time slots. The reasons for our selection are

  • HARQ is a technique in the data link layer already provided in many wireless protocols, e.g., IEEE 802.11n [33], IEEE 802.16e [34], and 3GPP LTE [35]. Hence, it needs no new additional design which introduces it as a cost- and complexity-efficient approach.

  • From an information theory point of view, HARQ is a sequential feedback approach; in each (re)transmission round, only 1-bit feedback is sent by the users which, compared to the quantized CSI schemes reporting all corresponding fading coefficients of the channel, reduces the feedback load substantially. Moreover, there is no quantized CSI feedback to be shared between the BSs, decreasing the backhauling requirements (Meanwhile, the HARQ feedback bits are shared between the BSs).

  • In the proposed scheme, each user is served by only one BS in each time slot. Therefore, there is no need to synchronize the BSs, which decreases the implementation complexity substantially.

In summary, the proposed scheme achieves some advantages related to coordinated data transmission but can still avoid many problems that may limit the practical implementation of CoMP networks.

The results are of particular interest when we remember that, although HARQ schemes have been widely studied in single-user [36–41] and MIMO systems with asymptotically high signal-to-noise ratios (SNRs) [42–47], there are very few results for CoMP-HARQ [48]. Specifically, reviewing the third generation partnership project (3GPP) reports, e.g. [49], there are many aspects of the CoMP-HARQ that have not been studied yet. Therefore, the final conclusions of the paper should be useful for the people involved in limited feedback issues in CoMP network standardization.

As described both theoretically and numerically, the proposed scheme leads to considerable performance improvement in terms of system throughput and the user outage probability. Particularly, the BS cooperation makes it possible to combine the advantages of fast-fading channels, having a large diversity gain, with the potential for accurate channel estimation in slow-fading channels. For sufficiently large number of users, the proposed CoMP-HARQ scheme can be modeled as a collection of single-user interference-free networks experiencing a modified SNR. Moreover, to have a positive multiplexing gain, the number of retransmissions should be scaled with the transmission power. Finally, compared to code-combining HARQ protocols, the diversity combining schemes are preferable at low powers, because they lead to the same throughput and outage probability with less complexity at the encoders and decoders.

2 System model

Consider a CoMP communication setup consisting of N geographically distributed BSs and K users, with K≥N. The BSs are connected via delay-free backhaul links such that the users’ data can be shared between the BSs. The BSs are limited to a peak power constraint P. Let hj,i be the channel coefficient between the j-th BS and the i-th user. Also, define the channel gains g j , i ≐ | h j , i | 2 . We study the low-mobility, also called slow-fading, scenario where the channel gains remain constant in a fading block, determined by the channel coherence time Lc, and then change independently to other values according to the probability density functions (pdfs) f g j , i ( . ) . The simulation results are given for both homogenous and heterogenous links. However, to be more tractable, the analytical results are presented for homogenous links where the channels experience the same fading pdfs. Note that considering the same pdfs does not mean that the channel realizations are the same in a time slot, as they have independent random values. However, for ergodic channels, the same pdf indicates that in the long-run, i.e., over infinitely many time slots, they experience the same behavior. Also, extension of the results for heterogenous networks is straightforward.

The length of the fading block, Lc, is assumed to be so long that many packetsa are transmitted in a single fading block. As a result, the channel gains can be assumed to be perfectly known by the receivers [18–30, 36–41]. On the other hand, there is no CSI available at the BSs (CSIT), except the HARQ feedback bits. The complex white Gaussian noises added at the receivers are supposed to have distributions C N ( 0 , 1 ) . Finally, the results are presented in natural logarithm basis, and the throughput is obtained in nats per channel use (npcu).

2.1 Data transmission model

A maximum of M HARQ-based retransmission rounds are considered, i.e., each codeword is (re)transmitted a maximum of M+1 times. In each fading block, N users are selected randomlyb. From a specific user perspective, the user receives the data from one BS in each time slot. Then, in the next slot, the serving BSs are switched and the user is served by another BS. The BS switching is done independently of whether new codewords are going to be sent to the users or the previous messages should be retransmitted in an HARQ-based fashion. By this technique, the HARQ protocol has a large diversity gain compared to the non-CoMP case.

Remark 1

Four different schemes have been considered for the CoMP networks in the 3GPP community during Release 11 [50, 51]: (1) joint transmission, (2) dynamic point selection (DPS), (3) dynamic point blanking, and (4) coordinated scheduling/beamforming. The proposed scheme belongs to the DPS approach of the CoMP networks where the transmission points are varied according to the considered cooperation rules.

Here, although some discussions about the basic ARQ and repetition codes are presented, the main focus is on two stop-and-wait HARQ protocols:
  1. 1)

    Repetition time diversity (RTD). This scheme belongs to the diversity combining category of HARQ protocols [52] where the same data is repeated in the (re)transmission rounds and, in each round, the receiver performs maximum ratio combining (MRC) of all received signals.

     
  2. 2)

    Incremental redundancy (INR). The INR belongs to the category of code combining protocols [52]. Here, a codeword is sent with an aggressive rate in the first round. Then, if the user cannot decode the initial codeword, further parity bits are sent in the next retransmission rounds and in each round, the receiver decodes the data based on all received signals.

     

In harmony with, e.g., [36–41], we study the system performance for the complex Gaussian codes which have been proved to be optimal for power-limited data transmission in fading AWGN channels with long codewords ([53], Chapter 9). The same approach as in, e.g., [54], can be used to extend the results to the case with, e.g., low-density parity-check codes.

2.2 Figures of merit

We consider two, namely, outage probability and long-term throughput, evaluation yardsticks. A user outage probability is the probability of the event that the data cannot be decoded by the user when all retransmission rounds are used. The long-term throughput, on the other hand, is defined as follows. Let the total number of channel uses and the number of successfully decoded information nats up to the end of the k-th slot be τ(k) and Q(k), respectively. Then, the long-term throughput [36–41] is defined as
η = lim k → ∞ Q ( k ) τ ( k ) = E { Q ~ } E { τ ~ } ,
(1)
where E{.} is the expectation operator and Q ~ and τ ~ are the number of successfully decoded information nats and the number of channel uses in a fading block, respectively. Here, the continuous communication model is considered, where the users are always actively requesting new information. In this case, all of the channel uses during a fading block are used. Therefore, defining R ~ as the achievable rate random variable of the HARQ protocols in a fading block, the long-term throughput is rephrased as
η = E { L c R ~ } L c = E { R ~ } ,
(2)

i.e., the average rate [37–40].

3 Performance analysis for the RTD HARQ protocol

In this section, we derive the throughput and outage probability of the network in the presence of RTD HARQ protocol. The simulation results for the RTD are summarized in the figures presented in Section 6.

With no loss of generality, assume that the new data transmission of the k-th user is started from the k-th BS. Also, let us focus on a specific, say the first, user while the final throughput is obtained by summation on all users throughput. In this way, the signal-to-interference-and-noise ratio (SINR) received at the first user in the m-th (re)transmission round is
γ m = P g m , 1 1 + P ∑ j = 1 , j ≠ m N g j , 1 .
(3)
Here, (3) is based on the fact that starting from the first BS, the user is served by the m-th BS in the m-th (re)transmission round. Considering Rayleigh fading channels f g j , i ( g ) = λ e − λg , g ≥ 0 , ∀ i , j , on which we focus, the SINR cumulative distribution function (cdf) is obtained as
F γ m ( x ) = Pr P g m , 1 1 + P ∑ j = 1 , j ≠ m N g j , 1 ≤ x = ( a ) 1 − e − λ P x ( 1 + x ) N − 1 , x ≥ 0 ,
(4)

where (a) is found by integration on the gains pdfs and λ represents the fading parameter determined by the path loss and shadowing between the BSs and the terminalsc.

Using MRC at the receiver, the equivalent received SINR at the end of the m-th (re)transmission round of the RTD is γ ( m ) = ∑ n = 1 m γ n . Also, as the same data is repeated in the retransmission rounds of the RTD, the equivalent data rate at the end of the m-th round is R ( m ) = Q mL = R m where Q is the number of information nats considered for the initial codeword, L denotes the codewords length, and R = Q L represents the initial codeword rate.

The data is decoded at the end of the m-th round if (1) it has not been decoded before and (2) retransmitting the data at the m-th round, the channel SINR, accumulated after MRC, supports the data rate. In this way, the achievable data rate random variable for the RTD protocol is obtained as
R ~ RTD = R m if log ( 1 + γ ( m − 1 ) ) < R ≤ log ( 1 + γ ( m ) ) , γ ( m ) = ∑ n = 1 m γ n 0 if R > log ( 1 + γ ( M + 1 ) )
(5)
where γ 0 ≐ 0 . Here, (5) follows from the fact that with accumulated SINR x at the end of the m-th round the maximum decodable data rate is 1 m log ( 1 + x ) if the codeword is repeated m times. In this way, the long-term throughput for the first user is
η 1 RTD = ∑ m = 1 M + 1 R m Pr log ( 1 + γ ( m − 1 ) ) < R ≤ log ( 1 + γ ( m ) ) = ∑ m = 1 M + 1 R m F γ ( m − 1 ) ( e R − 1 ) − F γ ( m ) ( e R − 1 )
(6)
where F γ (m) is the cdf of auxiliary variable γ(m). Hence, as the packet starts from each BS with probability 1 N and the network is homogenous, the system long-term throughput is found as
η RTD = N η 1 RTD = N ∑ m = 1 M + 1 R m F γ ( m − 1 ) ( e R − 1 ) − F γ ( m ) ( e R − 1 ) .
(7)
Here, (7) gives the users expected achievable rates for different message decoding conditions. Moreover, (7) indicates that the performance of the HARQ protocol improves as the number of retransmissions increases (as seen in the following, the throughput is scaled with the number of retransmission rounds at most logarithmically). Moreover, the user outage probability is
Pr { outage } i RTD = Pr { R > log ( 1 + γ ( M + 1 ) ) } = F γ ( M + 1 ) ( e R − 1 ) , ∀ i.
(8)

The optimal parameter R, in terms of, e.g., throughput, can be found numerically. Finally, bounds of the throughput and comparisons between the RTD and other schemes are presented in Section 5.

4 Performance analysis for the INR HARQ protocol

As mentioned before, the INR protocol is based on an aggressive codeword transmission in the first round, sending further parity bits in the retransmissions and combining all received representations of the signal at the receiver. Therefore, the results of, e.g., [36–39, 41] can be used to find the achievable rate random variable of the first user with packet transmission starting from the first BS as
R ~ INR = R m if ∑ n = 1 m − 1 log ( 1 + γ n ) < R ≤ ∑ n = 1 m log ( 1 + γ n ) 0 if R > ∑ n = 1 M + 1 log ( 1 + γ n ) .
(9)
Here, (9) is based on the fact that with SINR γ n in the n-th, n=1,…,m, time slot the maximum decodable data rate is 1 m ∑ n = 1 m log ( 1 + γ n ) if different codewords are sent in each round. In this way, the first user long-term throughput is found as
η 1 INR = ∑ m = 1 M + 1 R m Pr ∑ n = 1 m − 1 log ( 1 + γ n ) < R ≤ ∑ n = 1 m log ( 1 + γ n )
(10)
and the system long-term throughput is
η INR = N ∑ m = 1 M + 1 R m Pr ∑ n = 1 m − 1 log ( 1 + γ n ) < R ≤ ∑ n = 1 m log ( 1 + γ n ) .
(11)
According to (7) and (11), the only difference between the RTD and INR protocols is in the achievable rate terms where log ( 1 + ∑ n = 1 m γ n ) of the RTD is replaced by ∑ n = 1 m log ( 1 + γ n ) in the INR (Further comparisons between the RTD and INR protocols are presented in Section 5). Again, R is optimized to maximize the throughput for each transmission power. Also, the user outage probability is obtained by
Pr { outage } i INR = Pr { R > ∑ n = 1 M + 1 log ( 1 + γ n ) } , ∀ i.
(12)

In Section 5, we use (10) to (12) to analyze the throughput at asymptotically low and high powers, and evaluate the effect of BS cooperation on the performance of the network.

5 On the performance of the proposed schemes

In this section, we derive performance bounds for various cases and compare the performance of different schemes operating in the CoMP scenario.

5.1 Performance bounds

This subsection presents performance bounds/approximations for the throughput and outage probability of the proposed CoMP-ARQ approach. Theorem 1 shows that the performance of the considered protocols becomes bounded if the number of retransmission rounds is finite.

Theorem 1

With a fixed number of retransmissions, the throughput achieved by the considered CoMP-HARQ schemes is upper bounded even if the transmission power goes to infinity.

Proof

The theorem is proved for the INR protocol which, as stated in the following, results in higher throughput compared to the RTD. The throughput upper bound is found based on the following (in)equalities:
η INR = ( b ) N ∑ m = 1 M R m ( m + 1 ) Pr ∑ n = 1 m log ( 1 + γ n ) ≥ R + NR M + 1 Pr ∑ n = 1 M + 1 log ( 1 + γ n ) ≥ R ≤ ( c ) N ∑ m = 1 M E { ∑ n = 1 m log ( 1 + γ n ) } m ( m + 1 ) + N E { ∑ n = 1 M + 1 log ( 1 + γ n ) } M + 1 ≤ ( d ) N N − 1 ∑ m = 0 M 1 m + 1 ≤ ( e ) N N − 1 1 + log ( M + 1 ) .
(13)
Here, (b) is obtained by some manipulation on (11) and (c) comes from the Markov’s inequality, Pr ( X ≥ x ) ≤ E ( X ) x [55]. Then, (d) follows from
Λ = E { ∑ n = 1 m log ( 1 + γ n ) } = m E { log ( 1 + γ n ) } = m ∫ 0 ∞ log ( 1 + x ) f γ n ( x ) d x = ( f ) m ∫ 0 ∞ ( 1 − F γ n ( e z − 1 ) ) d z ≤ ( g ) m ∫ 0 ∞ e − ( N − 1 ) z d z = m N − 1 ,
(14)

where (f) is obtained by variable transform log(1+x)=z and partial integration and (g) is based on (4) and e − λ P x ≤ 1 . Finally, (e) in (13) follows from ∑ m = 0 M 1 m + 1 ≤ 1 + log ( M + 1 ) which is obtained by Riemann integral and the fact that 1 x is a decreasing functiond. □

Intuitively, both the signal and the interference powers grow linearly with P. Hence, with high transmission power, the system becomes interference-limited and, according to (4), the users received SINR is bounded. In other words, the theorem states that: (1) the multiplexingz gain of the proposed CoMP scheme, defined as ρ = lim P → ∞ η log ( P ) [56], is zero if a fixed number of retransmission rounds are considered for the HARQ protocols. (2) To have a positive multiplexing gain, a necessary condition is to scale the number of retransmission rounds with the transmission power. (3) Also, according to (13), the throughput is scaled with the number of retransmission rounds at most logarithmically. Finally, denoting the channel instantaneous capacity by C, we can use (b) in (13) to write
η INR ≤ ( h ) NR ( ∑ m = 1 M e − 1 m E { ( 1 m ∑ n = 1 m log ( 1 + γ n ) ) 1 R } m ( m + 1 ) + e − 1 M + 1 E { ( 1 M + 1 ∑ n = 1 M + 1 log ( 1 + γ n ) ) 1 R } M + 1 ) ≤ ( i ) NR E { C 1 R } ( ∑ m = 1 M e − 1 m m ( m + 1 ) + e − 1 M + 1 M + 1 ) ≤ ( j ) NR E { C 1 R } ( ξ + 1 )
(15)

which indicates that for sufficiently high initial transmission rate, where E { C 1 R } → 1 , the throughput scales with the initial rate R at most linearly. Note that (h) in (15) is obtained with the same procedure as in (b) of (13) and then implementation of the exponential Chebyshev’s inequality, Pr(X≥x)≤e−t xE(e t X ),∀t>0 [55]. Also, (i) follows from the fact that 1 m ∑ n = 1 m log ( 1 + γ n ) ≤ C , i.e., the maximum decodable rates is less than the channel instantaneous capacity C, and (j) comes from e − 1 M + 1 M + 1 ≤ 1 and ∑ m = 1 M e − 1 m m ( m + 1 ) ≤ ξ where ξ is the Euler’s number. Finally, the same qualitative conclusions are valid for the RTD protocol.

Theorem 2

For Rayleigh fading channels, the proposed CoMP-HARQ network can be modeled/underestimated by N interference-free single-user networks having a modified transmission SNR.

Proof

With the same procedure as in (13), the RTD- and INR-based throughput, i.e., (7) and (11), can be rewritten as
η RTD = N ∑ m = 1 M R m ( m + 1 ) Pr log ( 1 + ∑ n = 1 m γ n ) ≥ R + NR M + 1 Pr log ( 1 + ∑ n = 1 M + 1 γ n ) ≥ R
(16)
η INR = N ∑ m = 1 M R m ( m + 1 ) Pr ∑ n = 1 m log ( 1 + γ n ) ≥ R + NR M + 1 Pr ∑ n = 1 M + 1 log ( 1 + γ n ) ≥ R .
(17)
Moreover, from (4), we can show that the auxiliary random variable γ n is dominatede by the random variable ω n which follows the cdff
F ω n ( x ) = 1 − e − ( λ P + N − 1 ) x .
(18)
Therefore, using (16), (17), and the fact that F γ n (x)≤F ω n (x),∀x, i.e., Pr{γ n ≥x}≥ Pr{ω n ≥x}, ∀x, we have
η RTD ≥ N ∑ m = 1 M R m ( m + 1 ) Pr log ( 1 + ∑ n = 1 m ω n ) ≥ R + NR M + 1 Pr log ( 1 + ∑ n = 1 M + 1 ω n ) ≥ R = ( k ) N ∑ m = 1 M R m ( m + 1 ) Pr log ( 1 + P ̄ ∑ n = 1 m ω ̄ n ) ≥ R + NR M + 1 Pr log ( 1 + P ̄ ∑ n = 1 M + 1 ω ̄ n ) ≥ R = η RTD,SU
(19)
η INR ≥ N ∑ m = 1 M R m ( m + 1 ) Pr ∑ n = 1 m log ( 1 + ω n ) ≥ R + NR M + 1 Pr ∑ n = 1 M + 1 log ( 1 + ω n ) ≥ R = ( k ) N ∑ m = 1 M R m ( m + 1 ) Pr ∑ n = 1 m log ( 1 + P ̄ ω ̄ n ) ≥ R + NR M + 1 Pr ∑ n = 1 M + 1 log ( 1 + P ̄ ω ̄ n ) ≥ R = η INR,SU .
(20)

Here, (k) in (19) and (20) is obtained by defining ω ̄ n : F ω ̄ n ( x ) = 1 − e − x and the equivalent SNR P ̄ = P λ + ( N − 1 ) P , i.e., by appropriate scaling of the fading pdf and the transmission SNR. Also, ηRTD,SU and ηINR,SU denote the throughput achieved by the RTD and INR protocols, respectively, in the equivalent channel model of (18). In words, (19) and (20) imply that the CoMP-HARQ network performance can be underestimated by N interference-free single-input single-output (SISO) Rayleigh fading channels with fading coefficient h ∼ C N ( 0 , 1 ) , ω ̄ n = | h | 2 , and transmission SNR P ̄ = P λ + ( N − 1 ) P . Interestingly, the approximation F γ n ≃F ω n becomes very tight for moderate/high values of N. Thus, the collection of SISO channels becomes an accurate model for the proposed CoMP-HARQ network, as stated in the theorem. □

One of the benefits of Theorem 2 is that there are closed-form/approximate expressions for the probability terms of (19) and (20) such as
Pr log ( 1 + P ̄ ∑ n = 1 m ω ̄ n ) ≥ R = 1 − V ( e R − 1 P ̄ , m ) ,
(21)

where V(x,y) is the normalized incomplete Gamma function (please see [57] for more details about (21)).

5.2 Comparisons

This subsection compares the performance of different schemes in terms of the throughput and the outage probability.

Remark 2

Let M<N. The spatial diversity gained in the proposed CoMP-HARQ scheme with slow-fading channel is the same as the time diversity achieved in the non-CoMP-HARQ schemes when the channel is fast-fading, i.e., when the channel gains change in each retransmission round independently.

In order to show this, consider a non-CoMP model where each user is always served by a specific BS and there is no cooperation between the BSs. In this way, the link between the i-th user and its corresponding BS is an interference-affected SISO channel. Assuming a fast-fading model, i.e., the channels take new values in each retransmission round, the received SINR of the i-th user in round n is u ( n ) = P g i ( n ) 1 + P ∑ j = 1 ≠ i N g j ( n ) where g i (n) represents the gain realization of the channel between the i-th user and its corresponding BS at round n. Hence, a user throughput in the presence of the RTD and INR protocols is
η i RTD,Fast = ∑ m = 1 M + 1 R m Pr log 1 + ∑ n = 1 m − 1 u ( n ) < R ≤ log 1 + ∑ n = 1 m u ( n )
(22)
η i INR,Fast = ∑ m = 1 M + 1 R m Pr ∑ n = 1 m − 1 log 1 + u ( n ) < R ≤ ∑ n = 1 m log 1 + u ( n ) ,
(23)

respectively, which are the corresponding throughputs obtained for the i-th user in the proposed CoMP model when the channel is slow-fading (see (6) and (10)).

In other words, although each channel remains constant in all retransmission rounds of the slow-fading model, by switching between the BSs, a different SINR realization is observed in each round, the same as in the fast-fading channels. Thus, the CoMP model works well as (1) the slow-fading behavior of the channel gives the opportunity to accurately estimate the channels at the receivers and (2) the same diversity as in the fast-fading channels is gained by a simple cooperation approach. Finally, the spatial diversity exploited by the proposed CoMP scheme will be less than the time diversity achieved in the non-CoMP fast-fading channel if M≥N. This is because it may occur that we return back to the same BSs when the number of retransmissions exceeds the number of BSs. However, this case is of less interest because the maximum number of possible HARQ-based retransmissions is normally less than the number of cooperative BSs.

Remark 3

It has been previously shown that the INR outperforms the RTD in terms of outage probability and throughput ([38], lemma 1). However, as log(1+x)→x for small x’s, (7) and (11) can both be rewritten as
η = N ∑ m = 1 M + 1 R m Pr { γ ( m − 1 ) < R ≤ γ ( m ) }
(24)

when P→0. That is, the same performance is achieved by the INR and RTD protocols at low transmission powers.

This is interesting when we remember that the superiority of the INR over the RTD is at the cost of complexity; in the INR, the codewords are changed in each retransmission which results in more complex encoders and decoders. Therefore, compared to the INR, the RTD is preferable at low transmission powers, because the same throughput and outage probability are achieved in both schemes while the RTD leads to less implementation complexity.

As demonstrated in [58], the gain of the INR scheme over the RTD increases with the initial transmission rate R. Also, [58] has previously shown that the difference between the performance of the RTD and INR protocols decreases with the SINR variation between the retransmissions. Thus, compared to the non-CoMP setup, the gain of the INR over RTD decreases in the CoMP scenario.

Finally, it is worth noting that the considered HARQ protocols, RTD and INR, lead to better system performance compared to (1) the open-loop communication model, (2) basic ARQ protocols, and (3) the case when repetition codes are implemented in a cooperative fashion; the open-loop communication model is a special case of the HARQ-based schemes with no retransmissions, i.e., M=0. Hence, setting M=0 in, e.g., (8), the open-loop system throughput is
η Open = NR 1 − F γ 1 ( e R − 1 )
(25)
which is clearly less than the throughput obtained in (7) and (11). In basic ARQ, on the other hand, the same codeword is transmitted in different retransmission rounds and the users decode the data in each round independently of the previously received signals. In this way, with some manipulations, the throughput of the basic ARQ approach is found as
η Basic = N ∑ m = 1 M + 1 R m ∏ l = 1 m − 1 Pr log ( 1 + γ l ) < R Pr R ≤ log ( 1 + γ m ) .
(26)

Then, as less information is exploited by the basic ARQ decoder, compared to the RTD, the throughput in the RTD model is obviously higher than the throughput in the basic ARQ (the superiority of the HARQ protocols over the basic ARQ has been previously shown in the literature, e.g., [36, 38]). Here, it is interesting to note that with a slow-fading condition, e.g., [38] has shown that there are no performance gains with basic ARQ and the optimal throughput/outage probability achieved by the basic ARQ is the same as the one in the open-loop communication setup if the channel does not change in the retransmissions. However, the proposed CoMP-HARQ approach makes it possible to utilize the SINR variations and, depending on the channel pdf, increase the throughput by implementation of basic ARQ.

Finally, using repetition codes the same codeword is transmitted by the switching BSs in different rounds, the same as in RTD. However, as opposed to RTD, the MRC-based decoder is not implemented in each round but only when all possible repetition rounds are used. In this case, removing the m-th, m=1…M, probability terms of (7), the system throughput for the repetition codes is obtained by
η Rept = NR M + 1 Pr { R ≤ log ( 1 + γ ( M + 1 ) ) } < η RTD ≤ η INR .
(27)

The same arguments can be used when comparing the outage probability of these schemes. Here, the only important difference is that the RTD HARQ and the repetition code schemes lead to the same outage probability. This is because in RTD, the outage occurs if and only if the data is not decodable in the last retransmission round, the same as in the repetition codes.

6 Simulation results

In Figures 1, 2, 3, 4, and 5, we set λi,j=1, ∀i,j, i.e., the channel is assumed to be homogenous. Figures 6 and 7 study the heterogenous networks. The throughput is given in npcu and transmission power is presented in decibels which is given by 10 log10P (as the noise variance is set to 1, the transmission power is the same as the transmission SNR). For the outage probability, the results are obtained for fixed initial transmission rates, specified in the figures. For the throughput and in each transmission power, the initial transmission rate is optimized by exhaustive search, to maximize the throughput for that power.
Figure 1
Figure 1

System throughput vs the transmission SNR 10 log10 P . Homogenous network λ=1, N=4 BSs, a maximum of M=1 retransmission rounds for the HARQ protocols.

Figure 2
Figure 2

User outage probability vs the initial transmission rate R . Homogenous network λ=1, N=2 BSs, SNR=5 dB, a maximum of M=1 retransmission rounds for the HARQ protocols.

Figure 3
Figure 3

Difference between the throughput of CoMP-HARQ and single-user channel model introduced in Theorem 2, that is, Δ η = η INR − η INR,SU . Homogenous network, INR HARQ protocol with a maximum of M=1 retransmission round. N represents the number of BSs/users.

Figure 4
Figure 4

Throughput of the CoMP setup for different number of retransmissions M . Homogenous network, N=5, transmission SNR=10 dB.

Figure 5
Figure 5

Outage probability for different number of retransmissions M . Homogenous network, N=5, transmission SNR=10 dB, initial transmission rate R=0.5.

Figure 6
Figure 6

Outage probability vs the transmission SNR 10 log10 P . Heterogenous network N=2, a maximum of M=1 retransmission rounds. The fading parameters are set to λ1,1=λ2,2=1, λ1,2=λ2,1=0.1. The same outage probability as in the RTD scheme is achieved by repetition codes with repetition order of 2.

Figure 7
Figure 7

System throughput vs the second BS fading parameters λ 2,1 = λ 2,2 . Heterogenous network λ1,i = 1,i = 1,2, a maximum of M = 1 retransmission round, INR protocol.

Considering N=4 BSs and a maximum of M=1 retransmission round, i.e., a maximum of two (re)transmissions, Figure 1 demonstrates the system throughput for different schemes. As seen in the figure, the difference between the INR and RTD protocols is negligible at low transmission powers. Also, the system throughput starts to become bounded at high powers, in harmony with Theorem 1. Therefore, implementation of HARQ in CoMP networks is more appropriate at low transmission powers. With even a single (re)transmission round, substantial performance improvement is achieved by the HARQ schemes, compared to the case with no CSI at the BSs. Also, the CoMP data transmission scheme results in considerable throughput increment, compared to the non-CoMP models. Interestingly, the cooperation gain, i.e., the difference between the throughput of the CoMP and non-CoMP schemes, is observed to be (almost) constant, at medium and high powers. Finally, the repetition codes are simple but perform poorly in terms of throughput, in comparison to the other schemes.

The effect of CoMP transmission on the user outage probability is studied in Figure 2 where, setting N=2, the user outage probability is obtained for different initial transmission rates. As shown in the figure, CoMP transmission leads to considerable outage probability reduction, particularly at low rates. Moreover, the difference between the performance of the RTD and INR protocols increases with the initial transmission rate.

The validity of Theorem 2 is verified in Figure 3. Here, the throughput difference Δ η=ηINR−ηINR,SU is plotted as a function of the transmission power where ηINR and ηINR,SU are obtained by (11) and (20), respectively. As demonstrated in the figure, the difference between the throughput of the two models considered in Theorem 2 becomes small as the number of users increases. Also, the throughput difference increases with the transmission power. However, using (4) and (18), it can be shown that the difference becomes bounded as the power increases.

Setting N=5, Figures 4 and 5 study the system throughput and outage probability as a function of the maximum number of retransmissions. As demonstrated, considerable performance improvement is achieved by increasing the number of retransmissions. Also, the difference between the performance of INR and RTD protocols and the difference between the CoMP and non-CoMP data transmission models increase with M substantially.

Figures 6 and 7 focus on heterogenous networks. With N=2 BSs and a maximum of M=1 retransmissions, Figure 6 shows a user outage probability for different transmission powers and initial transmission rates. Here, the fading parameters are set to λi,i=1,i=1,2, and λj,i=0.1,i≠j,i,j=1,2. Again, the results show that the INR protocol outperforms the RTD, particularly at high transmission rates. However, as stated before, the superiority of the INR over RTD is at the cost of complexity at the encoders and decoders. Moreover, it is worth noting that, with the same argument as in Theorem 2, the user outage probability becomes bounded at high powers, as the system becomes interference-limited.

Finally, setting N=2 and M=1, Figure 7 investigates the system throughput in a heterogenous network. Here, while we set λ1,i=1,i=1,2, the throughput is plotted as a function of the fading coefficients associated with the second BS, i.e., λ2,1=λ2,2. As it can be seen, the system throughput decreases when the distance between the second BS and the users, modeled by λ2,i,i=1,2, increases. At asymptotic condition λ2,i→∞,i=1,2, the network is mapped to a 1×2 SIMO channel working in a TDMA fashion.

7 Conclusions

This paper studied the performance of a CoMP-HARQ network. The proposed approach exploits the advantages of coordinated data transmission schemes and, meanwhile, solves some of the important problems that may limit the practical implementation of CoMP networks. As demonstrated both theoretically and numerically, considerable performance improvement can be achieved by implementation of CoMP-HARQ systems. However, the system performance becomes bounded if the number of HARQ-based retransmission rounds does not scale with the transmission power. The proposed CoMP network can be modeled by a collection of interference-free single-user channels experiencing a specific SNR. Finally, the diversity combining HARQ schemes outperform the code-combining HARQ protocols at low transmission powers. This is because the same outage probability and throughput are achieved by these protocols, while the diversity combining schemes lead to less implementation complexity.

Endnotes

a A packet is defined as the transmission of a codeword along with all its possible retransmission rounds.

b This is the best scheme for scheduling N users with no CSIT at the BSs [56] as well as when, due to scheduling delay and complexity, the users are selected for transmission based upon queue lengths instead of on channel conditions.

c For heterogenous Rayleigh fading channels, f g j , i ( g ) = λj,ie−λj,ig,g≥0, (4) is rephrased as F γ k , i m ( x ) = 1 − e − λ k + m − 1 , i P x ∏ j = 1 , j ≠ m N ( 1 + λ k + m − 1 , i λ k + j , i x ) , x ≥ 0 .

d Straightforward modifications can be applied to (13) and (14) to prove the theorem for heterogenous networks.

e The random variable X dominates the random variable Y if F X (x)≥F Y (x), ∀x[59].

f For heterogenous channels, we can use F γ k , i m ( x ) ≤ F ω k , i m ( x ) , ∀ x , where F ω k , i m = 1 − e − ( λ k + m − 1 , i P + ∑ j = 1 , j ≠ m N λ k + m − 1 , i λ k + j , i ) x .

Declarations

Authors’ Affiliations

(1)
Department of Signals and Systems, Chalmers University of Technology, Gothenburg, 412 96, Sweden

References

  1. Gesbert D, Hanly S, Huang H, Shamai S, Simeone O, Yu W: Multi-cell MIMO cooperative networks: a new look at interference. IEEE J. Sel. Areas Commun. 2010, 28(9):1380-1408.View ArticleGoogle Scholar
  2. Zhang J: Networked MIMO with clustered linear precoding. IEEE Trans. Wireless Commun 2009, 8(4):1910-1921.View ArticleGoogle Scholar
  3. Chae CB, Kim S, Heath RW: Network coordinated beamforming for cell-boundary users: linear and nonlinear approaches. IEEE J. Sel. Topics Signal Process 2009, 3(6):1094-1105.View ArticleGoogle Scholar
  4. Shen C, Chang TH, Wang KY, Qiu Z, Chi CY: Distributed robust multi-cell coordinated beamforming with imperfect CSI: an ADMM approach. IEEE Trans. Signal Process 2012, 60(6):2988-3003.MathSciNetView ArticleGoogle Scholar
  5. Marsch P, Fettweis G: A framework for optimizing the uplink performance of distributed antenna systems under a constrained backhaul. In ICC 2007. Glasgow; 24–28 June 2007:975-979.Google Scholar
  6. Sanderovich A, Somekh O, Shamai S: Uplink macro diversity with limited backhaul capacity. In ISIT 2007. Nice; 24–29 June 2007:11-15.Google Scholar
  7. Ng BL, Evans JS, Hanly SV, Aktas D: Distributed downlink beamforming with cooperative base stations. IEEE Trans. Inf. Theory 2008, 54(12):5491-5499.MathSciNetView ArticleMATHGoogle Scholar
  8. Levy N, Shamai S: Clustered local decoding for wyner-type cellular models. IEEE Trans. Inf. Theory 2009, 55(11):4967-4985.MathSciNetView ArticleGoogle Scholar
  9. Levy N, Shamai S: Information theoretic aspects of users’ activity in a wyner-like cellular model. IEEE Trans. Inf. Theory 2010, 56(5):2241-2248.MathSciNetView ArticleGoogle Scholar
  10. Karakayali MK, Foschini GJ, Valenzuela RA: Network coordination for spectrally efficient communications in cellular systems. IEEE Wireless Commun 2006, 13(4):56-61. 10.1109/MWC.2006.1678166View ArticleGoogle Scholar
  11. Shamai S, Simeone O, Somekh O, Sanderovich A, Zaidel BM, Poor HV: Information-theoretic implications of constrained cooperation in simple cellular models. In PIMRC 2008. Cannes; 15–18 September 2008:1-5.Google Scholar
  12. Shamai S, Simeone O, Somekh O, Poor HV: Joint multi-cell processing for downlink channels with limited-capacity backhaul. In ITAW 2008. Washington, D.C.; 2–4 June 2008:345-349.Google Scholar
  13. Hoydis J, Kobayashi M, Debbah M: Optimal channel training in uplink network MIMO systems. IEEE Trans. Signal Process 2011, 59(6):2824-2833.MathSciNetView ArticleGoogle Scholar
  14. Marsch P, Fettweis G: On downlink network MIMO under a constrained backhaul and imperfect channel knowledge. In GLOBECOM 2009. Honolulu; 30 November–4 December 2009:1-6.Google Scholar
  15. Wild T: Comparing downlink coordinated multi-point schemes with imperfect channel knowledge. In VTC 2011. Budapest; 15–18 May 2011:1-5.Google Scholar
  16. Sun H, Zhang X, Fang W: Dynamic cell clustering design for realistic coordinated multipoint downlink transmission. In PIMRC 2011. Toronto; 11–14 September 2011:1331-1335.Google Scholar
  17. Ghimire B, Auer G, Haas H: Busy burst enabled coordinated multipoint network with decentralized control. IEEE Trans. Wireless Commun 2011, 10(10):3310-3320.View ArticleGoogle Scholar
  18. Shi J, Zhang T, Zhou Y, Zeng Z, Huang Z: Rate loss caused by limited feedback and channel delay in coordinated multi-point system. In VTC 2011. Budapest; 15–18 May 2011:1-6.Google Scholar
  19. Hou X, Yang C: How much feedback overhead is required for base station cooperative transmission to outperform non-cooperative transmission? In ICASSP 2011. Prague; 22–27 May 2011:3416-3419.Google Scholar
  20. Eslami M, Krzymien WA, Al-Shalash M: A hybrid mode user-location-aware network MIMO with limited feedback for cellular downlink. In MC-SS 2011. Herrsching; 3–4 May 2011:1-4.Google Scholar
  21. Yuan F, Yang C: Bit allocation between per-cell codebook and phase ambiguity quantization for limited feedback coordinated multi-point transmission systems. IEEE Trans. Commun 2012, 60(9):2546-2559.MathSciNetView ArticleGoogle Scholar
  22. Li Y, Ge J, Shen C, Li J, Miao W: Coordinated multi-point transmission with limited feedback for LTE-advanced. In ISCIT 2011. Hangzhou; 12–14 October 2011:68-72.Google Scholar
  23. 3GPP TS 36.211 v9.1.0: Evolved universal terrestrial radio access (E-UTRA); physical channels and modulation. March 2010Google Scholar
  24. Jin J, Wang Q, Lin C, Yang H, Wang Y: Coordinated multi-point transmission with limited feedback. In GLOBECOM 2010. Miami; 6–10 December 2010:850-854.View ArticleGoogle Scholar
  25. Lakshmana TR, Papadogiannis A, Li J, Svensson T: On the potential of broadcast CSI for opportunistic coordinated multi-point transmission. In PIMRC 2012. Sydney; 9–12 September 2012:1262-1267.Google Scholar
  26. Li J, Papadogiannis A, Apelfrojd R, Svensson T, Sternad M: Performance evaluation of coordinated multi-point transmission schemes with predicted CSI. In PIMRC 2012. Sydney; 9–12 September 2012:1055-1060.Google Scholar
  27. Kim D, Shin OS, Sohn I, Lee KB: Channel feedback optimization for network MIMO systems. IEEE Trans. Veh. Technol 2012, 61(7):3315-3321.View ArticleGoogle Scholar
  28. Kim D, Shin OS, Lee KB: Efficient limited feedback schemes for network MIMO systems. In GLOBECOM 2011. Houston, TX; 5–9 December 2011:1-6.Google Scholar
  29. Zhou S, Gong J, Niu Z: Distributed adaptation of quantized feedback for downlink network MIMO systems. IEEE Trans. Wireless Commun 2011, 10(1):61-67.View ArticleGoogle Scholar
  30. Yuan F, Yang C: Phase ambiguity quantization for per-cell codebook based limited feedback coordinated multi-point transmission systems. In VTC 2011. San Francisco; 5–8 September 2011:1-5.Google Scholar
  31. Khanzadi MR, Mehrpouyan H, Alpman E, Svensson T, Kuylenstierna D, Eriksson T: On models, bounds, and estimation algorithms for time-varying phase noise. In ICSPCS 2011. Honolulu; 12–14 December 2011:1-8.Google Scholar
  32. Munier F, Eriksson T, Svensson A: An ICI reduction scheme for OFDM system with phase noise over fading channels. IEEE Trans. Commun 2008, 56(7):1119-1126.View ArticleGoogle Scholar
  33. Peng F, Zhang J, Ryan WE: Adaptive modulation and coding for IEEE 802.11n. In WCNC 2007. Hong Kong; 11–15 March 2007:656-661.Google Scholar
  34. WiMAX Forum: Mobile WiMAX - part II: a comparative analysis. Solana Beach: WiMAX; 2006.Google Scholar
  35. 3GGP: LTE. http://www.3gpp.org/LTE
  36. Caire G, Tuninetti D: The throughput of hybrid-ARQ protocols for the Gaussian collision channel. IEEE Trans. Inf. Theory 2001, 47(5):1971-1988. 10.1109/18.930931MathSciNetView ArticleMATHGoogle Scholar
  37. Makki B, Eriksson T: On hybrid ARQ and quantized CSI feedback schemes in quasi-static fading channels. IEEE Trans. Commun 2012, 60(4):986-997.View ArticleGoogle Scholar
  38. Shen C, Liu T, Fitz MP: On the average rate performance of hybrid-ARQ in quasi-static fading channels. IEEE Trans. Commun 2009, 57(11):3339-3352.View ArticleGoogle Scholar
  39. Makki B, Eriksson T: On the average rate of HARQ-based quasi-static spectrum sharing networks. IEEE Trans. Wireless Commun 2012, 11(1):65-77.View ArticleGoogle Scholar
  40. Makki B, Graell i Amat A, Eriksson T: Power allocation in repetition time diversity hybrid automatic repeat request feedback. In WCNC 2012. Paris; 1–4 April 2012:2329-2334.Google Scholar
  41. Makki B, Graell i Amat A, Eriksson T: HARQ feedback in spectrum sharing networks. IEEE Commun. Lett 2012, 16(9):1337-1340.View ArticleGoogle Scholar
  42. Gamal HE, Caire G, Damen MO: The MIMO ARQ channel: diversity-multiplexing-delay tradeoff. IEEE Trans. Inf. Theory 2006, 52(8):3601-3621.View ArticleMATHMathSciNetGoogle Scholar
  43. Holliday T, Goldsmith AJ, Poor HV: Joint source and channel coding for MIMO systems: Is it better to be robust or quick? IEEE Trans. Inf. Theory 2008, 54(4):1393-1405.MathSciNetView ArticleMATHGoogle Scholar
  44. Chuang A, Guillen A, Fabregas i, Rasmussen LK, Collings IB: Optimal throughput-diversity-delay tradeoff in MIMO ARQ block-fading channels. IEEE Trans. Inf. Theory 2008, 54(9):3968-3986.View ArticleMATHMathSciNetGoogle Scholar
  45. Nguyen KD, Rasmussen LK, Fabregas A, Letzepis N: Rate-diversity-delay tradeoff for ARQ systems over MIMO block-fading channels. In AusCTW 2009. Sydney; 4–7 February 2009:116-121.Google Scholar
  46. Liu H, Razoumov L, Mandayam N, Spasojevic P: An optimal power allocation scheme for the STC hybrid-ARQ over energy limited networks. IEEE Trans. Wireless Commun 2009, 8(12):5718-5722.View ArticleGoogle Scholar
  47. Nguyen KD, Rasmussen LK, Guillen A, Fabregas i, Letzepis N: MIMO ARQ with multibit feedback: outage analysis. IEEE Trans. Inf. Theory 2012, 58(2):765-779.View ArticleMathSciNetGoogle Scholar
  48. Gao Y, Li Y, Yu H, Gao S, Wang X: Modeling and analysis of SU-CoMP HARQ in 3GPP LTE system level simulation. In CHINACOM 2011. Harbin; 17–19 August 2011:295-298.Google Scholar
  49. 3GPP: Report on Hybrid ARQ Type II/III[s]. http://www.3gpp.org/ftp/Specs/html-info/25835.htm
  50. Määttänen HL, Hämäläinen K, Venäläinen J, Schober K, Enescu M, Valkama M: System-level performance of lte-advanced with joint transmission and dynamic point selection schemes. Eurasip J. Adv. Signal Process 2012.Google Scholar
  51. 3rd Generation PartnershipProject: TSG RAN: (E-UTRA); 3GPP TS 36.213 version 11.0.0 Physical layer procedures (Release 11) (2012). http://www.3gpp.org/
  52. Wicker S: Error Control Systems for Digital Communication and Storage. Upper Saddle River: Prentice-Hall; 1995.MATHGoogle Scholar
  53. Cover TM, Thomas JA: Elements of Information Theory. New Jersey: Wiley; 2006.MATHGoogle Scholar
  54. Sesia S, Caire G, Vivier G: Incremental redundancy hybrid ARQ schemes based on low-density parity-check codes. IEEE Trans. Commun 2004, 52(8):1311-1321. 10.1109/TCOMM.2004.833022View ArticleGoogle Scholar
  55. Bronshtein IN, van den Brand M: Handbook of Mathematics, 5th ed. Berlin Heidelberg: Springer-Verlag; 2007.Google Scholar
  56. Jindal N: MIMO broadcast channels with finite-rate feedback. IEEE Trans. Inf. Theory 2006, 52(11):5045-5060.MathSciNetView ArticleMATHGoogle Scholar
  57. Telatar E: Capacity of multi-antenna gaussian channels. Eur Trans. Telecommun 1999, 10: 585-595. 10.1002/ett.4460100604View ArticleGoogle Scholar
  58. Cheng J-F: Coding performance of hybrid ARQ schemes. IEEE Trans. Commun 2006, 54(6):1017-1029. 10.1109/TCOMM.2006.876846View ArticleGoogle Scholar
  59. Bawa VS: Optimal rules for ordering uncertain prospects. J. Financ. Econ 1975, 2(1):95-121. 10.1016/0304-405X(75)90025-2MathSciNetView ArticleGoogle Scholar

Copyright

© Makki et al.; licensee Springer. 2013

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Advertisement