# Optimizing distance, transmit power, and allocation time for reliable multi-hop relay system

- Pham Thanh Hiep
^{1}Email author, - Fumie Ono
^{1}and - Ryuji Kohno
^{1}

**2012**:153

https://doi.org/10.1186/1687-1499-2012-153

© Hiep et al; licensee Springer. 2012

**Received: **13 October 2011

**Accepted: **30 April 2012

**Published: **30 April 2012

## Abstract

In multi-hop relay systems, the end-to-end channel capacity is restricted by bottleneck node. In order to prevent some relay nodes from being the bottleneck of system and to guarantee the end-to-end channel capacity, the method of optimizing transmit power, distance and allocation time is proposed in this article. We show that the optimizing distance has more end-to-end channel capacity than the optimizing transmit power in case that both the distance and the transmit power are changeable. However, the optimizing transmit power can let the system reach high end-to-end channel capacity when the relay nodes have to shift from the desired location. We also propose the Markov Chain Monte Carlo method to optimize all transmit power, distance and allocation time simultaneously. The optimizing all transmit power, distance and allocation time is the most effective and achieves the highest channel capacity. Based on the average signal-to-noise-ratio, the average channel capacity is evaluated in this article.

## 1 Introduction

In the future, it is believed that the MIMO service area will become popular. Therefore, a MIMO relay system is considered. However, in a relay system with one relay, when the number of relay antenna elements is less than the number of transmitter and receiver antenna elements, the capacity of MIMO relay system is lower than that of the original MIMO system. In addition, when the number of relay antenna elements is equal to or more than the number of the transmitter and receiver antenna elements, a MIMO relay system can provide the same average capacity as an original MIMO system. In other words, although the number of relay antenna elements is larger than the transmitter and receiver antenna elements, the capacity of MIMO relay system cannot exceed the channel capacity of original MIMO system [1–3].

Therefore, a system with multi relays called multi-hop relay system was proposed and have been discussed in several literatures. The Gaussian MIMO relay channel with fixed channel condition has derived upper bounds and lower bounds that can be obtained numerically by convex programming [4–6]. Moreover, the capacity of a particular large Gaussian relay network is determined by the limit as the number of relays tends to infinity [7]. In addition, a multi-hop relay network with multi antenna terminals in a quasi-static slow fading environment also has been considered [8]. However, these researches assumed the signal-to-noise-ratio (SNR) at receiver(s) is fixed, the distance between the transceivers and the transmit power of transmitter(s) are not considered.

In multi-hop MIMO relay systems, when the distance between the base station (Tx) and the final receiver (Rx) is fixed, the distance between the Tx to a relay node (RS), an RS to an RS, an RS to the Rx called the distances between transceivers, is shorten. Consequently, the SNR and the channel capacity are increased. However, according to the number of the relay nodes, the location and the transmit power of each relay node; the channel capacity of each relay node is changed. In addition, the end-to-end channel capacity is limited by bottleneck node. Therefore, to obtain the upper bound of end-to-end channel capacity, the location of each relay node meaning the distance between the transceivers and the transmit power of each relay node need to be optimized. We have analyzed performance of multi-hop MIMO relay system with amplify-and-forward (AF) [9]. The distance between the transceivers is optimized when the transmit power of each relay node is assumed to be equal. However, the location of the relay nodes is not always changeable. Consequently, in order to obtain a certain value of end-to-end channel capacity, the distance and the transmit power need to be optimized. In this article, the distance and the transmit power are optimized separately or simultaneously to guarantee the end-to-end channel capacity in decode-and-forward scheme multi-hop relay systems. In addition, allocation time is optimized to guarantee and/or to obtain the higher end-to-end channel capacity. Moreover, the channel capacity that is mentioned in this article is average channel capacity. The rest of the article is as follows. After the introduction of the system model in Section 2, we propose the optimizing method of transmit power and distance in Section 3 and the optimizing method of allocation time in Section 4. The optimizing of all transmit power, distance and allocation time simultaneously is described in Section 5. Finally, Section 6 concludes the article.

## 2 Multi-hop MIMO relay system

### 2.1 System model

*m*relays intervened multi-hop MIMO relay system. Here,

*K*

_{i}(

*i*= 0, . . . ,

*m*+ 1) denotes the number of the antenna elements at the Tx, the Rx and each relay node.

*d*

_{i}(

*i*= 0, . . . ,

*m*) represents the distance between the transceivers. The distance between the Tx and the Rx is fixed as

*d*. The signal is transmitted from the Tx to the

*RS*

_{1}. At the

*RS*

_{1}, the signal is decoded, encoded and transmitted to the

*RS*

_{2}. Similarly, the signal is transmitted over and over until the signal reaches to the final receiver. We assumed the transmit power of the $\text{Tx}\left({E}_{\mathrm{Tx}}\right)$ and the total transmit powers of relay node (

*E*

_{ RS }) are fixed regardless of the number of the relay nodes and the number of antenna elements at each relay. The transmit power of each relay node is denoted by

*E*

_{ i }. Moreover, the transmit power of each relay is equally divided into each antenna element. On the other hand, as described in Section 1, if the number of antenna elements at one relay is smaller than the other, this relay will be a bottleneck of the system and the end-to-end channel capacity will be restricted by this relay. Since in this article we consider the distance, transmit power and allocation time, the number of antenna elements at each relay is assumed to be the same as that of the

*Tx*and the

*Rx*and denoted by M. Moreover, we assume that the time-division-multiple-access (TDMA) algorithm is applied to control the transmission of each relay node. The allocation time of

*RS*

_{i}is denoted as

*t*

_{ i }.

**H**

_{ii+1}denotes a

*K*

_{i+1}×

*K*

_{ i }channel matrix between the

*RS*

_{ i }and the

*RS*

_{i+1}. Since the path loss is taken into consideration, H

_{ii+1}is the composite matrix. We model

**H**

_{ii+1}as

where **H**_{wii+1} is a matrix with independent and identically distributed (i.i.d.), zero mean, unit variance, circularly symmetric complex Gaussian entries, and *l*_{ii+1} represents the path loss between the *RS*_{
i
} and the *RS*_{i+1}. The path loss is described in detail in the following section.

### 2.2 Path loss

*a*. The path loss between the transceivers is described in Figure 2. The path loss in this case is expressed as [10]

*ref*

_{i}is the number of reflection while a signal is transmitted between

*RS*

_{ i }and

*RS*

_{i+1}. In addition, in order to obtain the number of reflection, the propagation environment coefficient

*W*

_{i}is defined as the average distance from a reflection point to the next reflection point. In other words, it is the average of line-of-sight (LOS) distance between

*RS*

_{ i }and

*RS*

_{i+1}. Therefore, the number of reflection between the transceivers can be expressed as $\text{re}{\text{f}}_{\text{i}}=\frac{{d}_{\text{i}}}{{W}_{\text{i}}}$. Consequently, the path loss in (2) can be rewritten as

### 2.3 Channel capacity

Let the channel capacity between the *RS*_{
i
} and the *RS*_{i+1}is *C*_{i}, and *C* denotes the end-to-end channel capacity of the multi-hop MIMO relay system (Figure 2).

**S**

_{i- 1}is transmitted from the

*RS*

_{i- 1}, the received signal at the

*RS*

_{ i }is expressed as cite9,

*Tr*(

*·*) and

*p*

_{ij}denote the trace and transmit power of

*j*

^{th}antenna element of

*RS*

_{ i }, respectively.

**n**

_{i}is the noise vector with i.i.d., zero mean,

*σ*

^{2}variance. The transmit power of every antenna in the same relay node was assumed to be equal.

*K*

_{i}×

*K*

_{i}unit matrix. Since the channel capacity of each relay node is independent from each other, the end-to-end channel capacity is equal to channel capacity of bottleneck relay node.

## 3 Optimizing transmit power and distance

*i*= 0, . . . ,

*m*) is independent from the distance and the transmit power. Consequently, the SNR can be examined instead of a channel capacity. Hence, in order to avoid that some nodes become the bottleneck and to obtain high channel capacity, the channel capacity of each node should be equal. Consequently, the received SNR of each node is necessary to be equal.

### 3.1 Optimizing transmit power

#### 3.1.1 Optimization method

*E*

_{ i }to (9), it can be rewritten as

*RS*

_{1}is obtained.

#### 3.1.2 Numerical evaluation of optimizing transmit power

*W*, $W=\frac{{\sum}_{i=0}^{m}{W}_{i}}{m+1}$, meaning the average of LOS distance between the

*Tx*and

*Rx*, is set as 500 m.

Numerical parameters

Antenna elements at | 4 |
---|---|

Transmit power of | 100 |

Total transmit power of | 100 |

Noise power (mW) | 6.12e-011 |

Reflection factor | 0.38 |

Distance between | 3000 |

Average LOS | 500 |

As shown in Figure 3, in case the number of the relay nodes is 9, the channel capacity of bottleneck node is improved and the end-to-end channel capacity is increased. However, since the transmit power of *Tx* is assumed to be constant, the channel capacity of *RS*_{1} is fixed. Therefore *RS*_{1} becomes a bottleneck node if *d*_{0} is large, such as the number of the relay nodes is 3. In this case, the end-to-end channel capacity can not be improved. Moreover, SNR is increased by transmit power to the 1st power and decreased by distance to the 2nd power. Hence, in order to increase the channel capacity, the huge transmit power needs to be provided when the distance is large. Under the assumption that total transmit power of relay node is fixed; the channel capacity is not considerably improved. It is the reason why the end-to-end channel capacity of the system with 6 relay nodes is low.

### 3.2 Optimizing distance between transceivers

#### 3.2.1 Optimization method

Since the optimizing of transmit power remains some drawbacks as mentioned above, the distance between the transceivers needs to be considered. In order to analyze the distance more easily, the transmit power of each relay node is assumed to be equal. Therefore, the channel capacity only depends on the distance.

*W*). Therefore, by substituting the path loss of (3) in (7), this equation becomes,

*g*(

*d*

_{i}), and (14) can be expressed as

- (15)is rewritten as${x}^{\text{4}}+p{x}^{\text{2}}+qx+r=0,$(16)

*y*is added to this equation.

*y*is obtained.

*x*can be obtained.

As a result, the optimized *d*_{i} can be obtained by ${d}_{i}=x-\frac{{b}_{3}}{4{b}_{4}}$ with the condition that *d*_{i} is a real number within (0,d). For the system parameter described in the next section, only ${d}_{i}=\frac{\sqrt{y}+\sqrt{-2p-y-\frac{2q}{\sqrt{y}}}}{2}-\frac{{b}_{3}}{4{b}_{4}}$ is satisfied.

In analyzing the performance of the system that has all channel models between the transceivers which are different, (*W*_{i}) is similar. The system in this case is indicated for scheme 2. The Taylor expansion is approximately used for a term ${a}^{\frac{-2{d}_{\text{i}}}{{W}_{\text{i}}}}$. Then, the partial differential equation with respect to each *d*_{i} is obtained, and each *d*_{i} can be obtained similarly to be mentioned above. However, in this case, we have made the Taylor expansion, solving partial differential *m* + 1 times to obtain each *d*_{i}.

#### 3.2.2 Numerical evaluation of optimizing distance

*RS*

_{1}and improve the channel capacity of all bottleneck nodes. The comparison in channel capacity of optimizing the distance and optimizing the transmit power is shown in Figure 5. It is clear that in the case of optimizing the distance, the channel capacity of all relay nodes is the same and relatively higher than the end-to-end channel capacity in the case of optimizing the transmit power. The optimizing of the distance is effective; however, the relay node can not always be set at the desired location. For example, the desired location is on roads, in rivers, and so on. Thus, the relay node needs to be shifted in the front or the rear of the desired location. As a result, the channel capacity is decreased. In order to remain high channel capacity, the transmit power is adjusted after shifting distance by method of optimizing transmit power mentioned above. Figures 6 and 7 show the end-to-end channel capacity before and after adjusting the transmit power. In this scenario, the channel capacity of all relay nodes after adjusting the transmit power is almost the same, and achieves the end-to-end channel capacity of the system without shifting the location of the relay nodes. The optimizing of the transmit power in this scenario is much more effective.

*×*of calculation is shown in Figure 8. The end-to-end channel capacity is increased when the number of the relay nodes is small. Moreover, when the number of the relay nodes exceeds a certain value, the end-to-end channel capacity is decreased. The reason is that the SNR increases when the number of the relay nodes increases, however the allocation time of each relay node reduces rapidly. Therefore, although the SNR is high, the end-to-end channel capacity is decreased. As a result, there is the optimum number of the relay nodes for maximum end-to-end channel capacity.

As shown in Figure 8, we can confirm that after shifting the location of the relay nodes, the end-to-end channel capacity is rapidly decreased, especially when the shifted distance is large and/or the number of the relay nodes increases. However, the optimizing of the transmit power is quite effective in this case, and the end-to-end channel capacity after adjusting the transmit power is approximate to the end-to-end channel capacity of the system without shifting the location of the relay nodes.

## 4 Optimizing allocation time

### 4.1 Optimization method of allocation time

It means that the end-to-end channel capacity of the system after optimizing allocation time is higher than that of the system with equal allocation time.

### 4.2 Numerical evaluation of optimizing allocation time

*RS*

_{ k }is the lowest (

*C*

_{ k }≪

*C*

_{ i },

*i*≠

*k*,). It means $\frac{\text{1}}{{C}_{k}}\gg \frac{\text{1}}{{C}_{i}}$. Consequently, the end-to-end channel capacity in (30) can be changed as follows.

## 5 Optimized transmit power, distance, and allocation time simultaneously

Till now, we explained the method of optimizing transmit power, distance and allocation time separately in Sections 3 and 4. Each method is effective. However, the optimizing of the transmit power, the distance and the allocation time simultaneously is expected to achieve higher channel capacity than optimizing each one separately.

### 5.1 Mathematical method

*SNR*

_{ i }can be expressed as follows.

Thus, when *W*_{
i
} and *d*_{
i
} , *i* = 1, . . . , *m* are equal, respectively (the optimum distance of scheme 1), *SNR*_{i} becomes maximum. In this case, the equal allocation time is also the optimum solution. In other words, the optimized distance, transmit power and allocation time at scheme 1 is one of the optimal solutions for maximal end-to-end channel capacity of any channel model. Consequently, the optimizing of the distance, the transmit power and the allocation time lets the end-to-end channel capacity reach to this maximum.

### 5.2 Markov chain Monte Carlo method

The MCMC method is constructed to find the optimal state of transmit power, distance and allocation time that has the end-to-end channel capacity close to the maximal channel capacity. The algorithm is explained as follows.

Calculate $W=\frac{1}{\left(m+1\right)}{\sum}_{i=0}^{m}\left({W}_{i}\right)$ and maximal channel capacity *C*_{max} (optimize transmit power, distance and allocation time at scheme 1).

*d*

_{i},

*E*

_{i}and

*t*

_{i}randomly. Subject to

*C*

_{i}, and soften them from high to low. Adjust the distance, the transmit power and the allocation time to make all channel capacity to be almost the same.

here, rand1, rand2, rand3 are random value within (0,1). Iterate step 2 until standard deviation of all channel capacities is smaller than sigma (*σ*).

Step 3: If end-to-end channel capacity of scheme 2 is close to maximal channel capacity $\left(\frac{{C}_{max}-C}{{C}_{max}}\le \alpha \right)$, the algorithm is finished. Otherwise, return to step 1.

Compare to the mathematical method, MCMC algorithm is easier to optimize the distance, the transmit power and the allocation time simultaneously at any channel model. However, the MCMC algorithm requests running in the computer and the convergence of this algorithm should be discussed. The convergence is dependent on *σ* and *α*, if *σ* is not tight enough, the algorithm doesn't converge. On the other hand, if *σ* is too tight, the algorithm takes a long time for convergence. Hence, for each *α*, the suitable *σ* needs to be considered.

*C*= min(

*C*

_{ i })) is approximate to the maximal channel capacity (

*C*

_{max}), we have $\stackrel{\u0304}{C}\approx {C}_{\text{max}}\text{and}|\text{max}\left({C}_{i}\right)-\stackrel{\u0304}{C}|\phantom{\rule{2.77695pt}{0ex}}\approx \phantom{\rule{2.77695pt}{0ex}}|\text{min}\left({C}_{i}\right)-\stackrel{\u0304}{C}|$. Thus,

*σ*can be described by

*σ*=

*C*

_{max}

*α*is the suitable value. Since

*C*

_{max}changes when the number of the relay nodes changes.

*σ*is changed for each number of the relay nodes and

*α*. Figure 11 shows the end-to-end channel capacity in case

*σ*is changed, i.e., 1%, 5%, and 10%. Here, let

*W*

_{ i }be random within (0, 1000) and satisfy $\frac{1}{m+1}{\sum}_{i=0}^{m}{W}_{i}=500$. According to

*α*, the end-to-end channel capacity of MCMC method is different. However, with small

*alpha*, MCMC method optimizes the transmit power, the distance, the allocation time simultaneously and achieves the maximal channel capacity in any channel model.

## 6 Conclusion

In this article, we examined the performance of multi-hop relay systems with decode-and-forward method. The optimizing of the transmit power, the distance and the allocation time is effective in preventing some relay nodes from becoming the bottleneck of the system and in guaranteeing the end-to-end channel capacity. However, the optimizing of the distance is the most effective and the optimizing of the transmit power is the least effective. The optimizing of the transmit power is effective when the location of the relay nodes is shifted within a short range from the desired location. The MCMC algorithm was proposed to optimize all transmit power, distance and allocation time simultaneously. MCMC method can achieve the maximal channel capacity.

In this article, in order to simplify the analysis, we have analyzed the system under Gaussian channel model. However, the performance of this system needs to be analyzed under the channel model which is close to the practice. Additionally, in order to apply the optimization method to any channel model, more general path loss functions needs to be considered. We considered the transmit power, the distance and the allocation time to guarantee the end-to-end channel capacity. The other method, such as the changing of modulation and/or coding is left for future studies.

## Declarations

## Authors’ Affiliations

## References

- Tsuruta M, Karasawa Y: Multi-Keyhole model for MIMO repeater system evaluation.
*IEICE Trans Commun*2006, J89-B(9):1746-1754.Google Scholar - Chizhik D, Foschini GJ, Gans MJ, Valenzuela RA: Keyholes, correlations, and capacities of multi-element transmit and receive antennas.
*IEEE Trans Wirel Commun*2002, 1(2):361-368. 10.1109/7693.994830View ArticleGoogle Scholar - Levin G, Loyka S: On the outage capacity distribution of correlated keyhole MIMO channels.
*IEEE Trans Inf Threory*2010, 54(7):3232-3245.MathSciNetView ArticleGoogle Scholar - Wang B, Zhang J: A host-Madsen, On the capacity of MIMO relay channel.
*IEEE Trans Inf Theory*2005, 51(1):29-43.View ArticleGoogle Scholar - Shiu DS, Foschini GJ, Gans MJ, Kahn JM: Fading correlation and its effect on the ca-pacity of multi-element antenna systems.
*IEEE Trans Commun*2000, 48(3):502-513. 10.1109/26.837052View ArticleGoogle Scholar - Gesbert D, Bolcskei H, Gore DA, Paulraj AJ: MIMO wireless channel: capacity and performance prediction.
*Proc GLOBECOM*2000, 2: 1083-1088.Google Scholar - Gastpar M, Vetterli M: On the capacity of large Gaussian relay networks.
*IEEE Trans Inf Theory*2005, 51(3):765-779. 10.1109/TIT.2004.842566MathSciNetView ArticleGoogle Scholar - Giindiiz D, Khojastepour MA, Goldsmith A, Vincent Poor H: Multi-hop MIMO relay networks: diversity-multiplexing trade off analysis.
*IEEE Trans Wirel Commun*2010, 9(5):1738-1747.View ArticleGoogle Scholar - Hiep PT, Kohno R: Optimizing position of repeaters in distributed MIMO repeater system for large capacity.
*IEICE Trans Commun*2010, E93-B(12):3616-3623. 10.1587/transcom.E93.B.3616View ArticleGoogle Scholar - Kita N, Yamada W, Sato A: Path loss prediction model for the over-rooftop propagation environment of microwave band in suburban areas.
*IEICE Trans Commun*2006, J89-B(2):115-125. (in Japanese)Google Scholar

## Copyright

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.