Cooperative network-coding system for wireless sensor networks

Describes a cooperative network coding system for wireless sensor networks. In this paper, we propose two practical power) and bandwidth)efficient systems based on amplify)and)forward (AF) and decode)and)forward (DF) schemes to address the problem of information exchange via a relay. The key idea is to channel encode each source’s message by using a high)performance non)binary turbo code based on Partial Unit Memory (PUM) codes to enhance the bit)error)rate performance, then reduce the energy consumption and increase spectrum efficiency by using network coding (NC) to combine individual nodes’ messages at the relay before forwarding to the destination. Two simple and low complexity physical layer NC schemes are proposed based on combinations of received source messages at the relay. We also present the theoretical limits and numerical analysis of the proposed schemes. Simulation results under Additive White Gaussian Noise, confirm that the proposed schemes achieve significant bandwidth savings and fewer transmissions over the benchmark systems which do not resort to NC. Theoretical limits for capacity and Signal to Noise Ratio behaviour for the proposed schemes are derived. The paper also proposes a cooperative strategy that is useful when insufficient combined messages are received at a node to recover the desired source messages, thus enabling the system to retrieve all packets with significantly fewer retransmission request messages

The energy efficiency of the ergodic fading relay channel

In this paper, we address the energy ef ciency analysis of the relay channel under ergodic fading. The study considers full duplex and half duplex terminals. Since the capacity of general relay channels is unknown, we investigate achievable rates with decode and forward and capacity upper bounds with the cut-set bound. The maximum rate per energy and the slope of the spectral ef ciency with the energy per bit are computed to asses the impact of the duplexing capabilities, the resource allocation and the channel fading distribution.Postprint (published version

Lecture Notes on Network Information Theory

These lecture notes have been converted to a book titled Network Information Theory published recently by Cambridge University Press. This book provides a significantly expanded exposition of the material in the lecture notes as well as problems and bibliographic notes at the end of each chapter. The authors are currently preparing a set of slides based on the book that will be posted in the second half of 2012. More information about the book can be found at http://www.cambridge.org/9781107008731/. The previous (and obsolete) version of the lecture notes can be found at http://arxiv.org/abs/1001.3404v4/

Self-concatenated code design and its application in power-efficient cooperative communications

In this tutorial, we have focused on the design of binary self-concatenated coding schemes with the help of EXtrinsic Information Transfer (EXIT) charts and Union bound analysis. The design methodology of future iteratively decoded self-concatenated aided cooperative communication schemes is presented. In doing so, we will identify the most important milestones in the area of channel coding, concatenated coding schemes and cooperative communication systems till date and suggest future research directions

Molecular communication in fluid media: The additive inverse Gaussian noise channel

We consider molecular communication, with information conveyed in the time of release of molecules. The main contribution of this paper is the development of a theoretical foundation for such a communication system. Specifically, we develop the additive inverse Gaussian (IG) noise channel model: a channel in which the information is corrupted by noise with an inverse Gaussian distribution. We show that such a channel model is appropriate for molecular communication in fluid media - when propagation between transmitter and receiver is governed by Brownian motion and when there is positive drift from transmitter to receiver. Taking advantage of the available literature on the IG distribution, upper and lower bounds on channel capacity are developed, and a maximum likelihood receiver is derived. Theory and simulation results are presented which show that such a channel does not have a single quality measure analogous to signal-to-noise ratio in the AWGN channel. It is also shown that the use of multiple molecules leads to reduced error rate in a manner akin to diversity order in wireless communications. Finally, we discuss some open problems in molecular communications that arise from the IG system model.Comment: 28 pages, 8 figures. Submitted to IEEE Transactions on Information Theory. Corrects minor typos in the first versio

Analysis of hybrid-ARQ based relaying protocols under modulation constraints

In a seminal paper published in 2001, Caire and Tuninetti derived an information theoretic bound on the throughput of hybrid-ARQ in the presence of block fading. However, the results placed no constraints on the modulation used, and therefore the input to the channel was Gaussian. The purpose of this thesis is to investigate the impact of modulation constraints on the throughput of hybrid-ARQ in a block fading environment. First, we consider the impact of modulation constraints on information outage probability for a block fading channel with a fixed length codeword. Then, we consider the effect of modulation constraints upon the throughput of hybrid-ARQ, where the rate of the codeword varies depending on the instantaneous channel conditions. These theoretical bounds are compared against the simulated performance of HSDPA, a newly standardized hybrid-ARQ protocol that uses QPSK and 16-QAM bit interleaved turbo-coded modulation. The results indicate how much of the difference between HSDPA and the previous unconstrained modulation bound is due to the use of the turbo-code and how much is due to the modulation constraints. (Abstract shortened by UMI.)