By Topic

Analysis of a Mixed Strategy for Multiple Relay Networks

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
$33 $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

2 Author(s)
Peter Rost ; Tech. Univ. of Dresden, Dresden ; Gerhard Fettweis

Infrastructure-based wireless communications systems as well as ad hoc networks experience a growing importance in present-day telecommunications. An increased density and popularity of mobile terminals poses the question how to exploit wireless networks more efficiently. One possibility is to use relay nodes supporting the end-to-end communication of two nodes. In their landmark paper, Cover and El Gamal proposed different coding strategies for the single-relay channel. These strategies are the decode-and-forward and compress-and-forward approach, as well as a general lower bound on the capacity of a single-relay network which relies on the combined application of the previous two strategies. So far, only parts of their work-the decode-and-forward and the compress-and-forward strategy-have been applied to networks with multiple relays. In this paper a generalizing framework for multiple-relay networks is derived using a combined approach of partial decode-and-forward and the ideas of successive refinement with different side information. After describing the protocol structure, the achievable rates for the discrete memoryless relay channel as well as the Gaussian multiple-relay channel are presented and analyzed. Using these results the derived framework is compared with protocols of lower complexity, e.g., multilevel decode-and-forward and distributed compress-and-forward.

Published in:

IEEE Transactions on Information Theory  (Volume:55 ,  Issue: 1 )