Cart (Loading....) | Create Account
Close category search window
 

Performance of Fountain Codes in Collaborative 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
$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

4 Author(s)
Molisch, A.F. ; Mitsubishi Electr. Corp., Cambridge ; Mehta, N.B. ; Yedidia, Jonathan S. ; Jin Zhang

Cooperative communications, where parallel relays forward information to a destination node, can greatly improve the energy efficiency and latency in ad-hoc networks. However, current networks do not fully exploit its potential as they only use traditional energy-accumulation, which is often used in conjunction with repetition coding or cooperative space-time codes. In this paper, we show that the concept of mutual- information-accumulation can be realized with the help of fountain codes, and leads to a lower energy expenditure and a lower transmission time than energy accumulation. We then provide an analysis of the performance of mutual information accumulation in relay networks with N relay nodes. We first analyze the quasi-synchronuous scenario where the source stops transmitting and the relay nodes start transmitting after L relay nodes have successfully decoded the source data. We show that an optimum L exists, and is typically on the order of 3 or 4. We also give closed-form equations for the energy savings that can be achieved by the use of mutual-information-accumulation at the receiver. We then analyze and provide bounds for an alternate scenario where each relay node starts its transmission to the destination as soon as it has decoded the source data, independent of the state of the other relay nodes. This approach further reduces the transmission time, because the transmission by the relay nodes helps the other relay nodes that are still receiving.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:6 ,  Issue: 11 )

Date of Publication:

November 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.