A Performance Bound of Multi-hop Multi-Relay Wireless Communication Systems with Optimal Path Selection 


Vol. 36,  No. 1, pp. 1-7, Jan.  2011


PDF
  Abstract

Recently, multi-hop relay transmission has drawn much attention owing to its advantage of coverage extension at low power consumption. In this paper, we derive a performance bound of multi-hop communication systems with multiple amplify-and-forward relays when the optimal path is selected. The bound is derived in generalized Nakagami fading channels with different parameters for each hop by applying the geometric mean bound to the path signal-to-noise ratio (SNR) and obtaining the moment generation function of the bound. It is shown that the bound based on the geometric mean is closer to the actual performance of optimal path selection when the fading effect is small.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

K. Almuradov, J. B. Park, Y. H. Kim, "A Performance Bound of Multi-hop Multi-Relay Wireless Communication Systems with Optimal Path Selection," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 1, pp. 1-7, 2011. DOI: .

[ACM Style]

Kamol Almuradov, Jin Bae Park, and Yun Hee Kim. 2011. A Performance Bound of Multi-hop Multi-Relay Wireless Communication Systems with Optimal Path Selection. The Journal of Korean Institute of Communications and Information Sciences, 36, 1, (2011), 1-7. DOI: .

[KICS Style]

Kamol Almuradov, Jin Bae Park, Yun Hee Kim, "A Performance Bound of Multi-hop Multi-Relay Wireless Communication Systems with Optimal Path Selection," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 1, pp. 1-7, 1. 2011.