By Topic

Optimal power allocation for decode-and-forward multihop relaying system with direct link

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 $31
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)
Yang, J. ; Dept. of Commun. & Inf. Eng., Nanjing Univ. of Posts & Telecommun., Nanjing, China ; Rui, X. ; Cao, X.

There are two fundamental channel models in decode-and-forward (DF) multihop relaying system: one is DF multihop channel and the other is DF multihop diversity channel. The latter outperforms the former at the cost of computational and hardware complexity at each relay. In this study, the authors consider a trade-off of the above two channel models and propose a new channel model, which is DF multihop channel with direct link. The new channel model can exploit partial spatial diversity without any extra request for the receiver of relays. The authors focus on the optimal power allocation problem of their proposed system. The authors first derive the end-to-end outage probability, and then they formulate and evaluate the optimisation problem by minimising the outage probability under the total power constraint. Numerical results demonstrate that their proposed system can improve system performance compared with fundamental multihop relaying system. In addition, their proposed power allocation scheme can effectively enhance the system performance compared with uniform power allocation scheme, especially if the number of relays is large.

Published in:

Communications, IET  (Volume:6 ,  Issue: 18 )