By Topic

Performance Bounds of Multi-Relay Decode-and-Forward Cooperative Networks over Nakagami-m Fading Channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sheng-Qiang Huang ; Dept. of Eng. Sci., Nat. Cheng Kung Univ., Tainan, Taiwan ; Hsiao-Hwa Chen ; Meng-Ying Lee

In this paper, we derive the performance bounds of a cooperative relay network that comprises several relay stations working on decode-and-forward (DF) algorithm over non-identical independent Nakagami-m fading channels. In particular, we derive the upper and lower bounds on the outage probabilities for such a DF based cooperative wireless network based on MRC diversity combining algorithm with the help of probability and order statistics theorem. These bounds also provide the basis to calculate generalized diversity order of a DF relay network, and we show that they are equal to the minimum of the sums of diversity orders on different end-to-end routes between the source and destination nodes.

Published in:

Communications (ICC), 2011 IEEE International Conference on

Date of Conference:

5-9 June 2011