Fountain codes over fading relay channels
IEEE Transactions on Wireless Communications
A statistical model for indoor office wireless sensor channels
IEEE Transactions on Wireless Communications
Nonlinear network code for high throughput broadcasting with retransmissions
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Signal combining for relay transmission with rateless codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Outage performance of half-duplex cooperative relay networks using rateless codes
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
A rateless coding based multi-relay cooperative transmission scheme for cognitive radio networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
An asynchronous multi-relay cooperation protocol exploiting rateless codes
ACM SIGMOBILE Mobile Computing and Communications Review
Global design methods for raptor codes using binary and higher-order modulations
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
A highly efficient protocol for rateless coding aided cooperative cellular networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Opportunistic cooperation for multi-antenna multi-relay networks
IEEE Transactions on Wireless Communications
IEEE Transactions on Communications
Benefit from rateless characteristic
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
A novel cooperative relay scheme employing fountain codes and rotated constellations
International Journal of Wireless and Mobile Computing
Hi-index | 0.01 |
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.