Optimal Decoding and Performance Analysis of a Noisy Channel Network with Network Coding

We investigate sink decoding approaches and performance analysis for a network with intermediate node encoding (coded network). The network consists of statistically independent noisy channels. The sink bit error probability (BEP) is the performance measure. First, we investigate soft-decision decoding without statistical information on the upstream channels (the channels not directly connected to the sink). Numerical results show that the decoder cannot significantly improve the performance from a hard-decision decoder. We develop union bounds for analysis. The bounds show the asymptotic (regarding SNR: signal-to-noise ratio) performance of the decoder. Using statistical information about the upstream channels, we can find the error patterns of final hop channels (channels directly connected to sinks).With the error patterns, maximum-likelihood (ML) decoding can be performed, and a significant improvement in the BEP is obtained. To evaluate the union bound for the ML decoder, we use an equivalent point procedure. It is reduced to the least-squares problem with a linear constraint in the medium-to-high SNR region. With deterministic knowledge of the errors in the upstream channels, a genie-aided decoder can further improve the performance. We give the union bound for the genie decoder, which is straightforward to evaluate. By analyzing these decoders, we find that knowledge about the upstream channels is essential for good sink decoding.

[1]  Ning Cai,et al.  Network coding and error correction , 2002, Proceedings of the IEEE Information Theory Workshop.

[2]  I. M. Jacobs,et al.  Principles of Communication Engineering , 1965 .

[3]  Ming Xiao,et al.  A Physical Layer Aspect of Network Coding with Statistically Independent Noisy Channels , 2006, 2006 IEEE International Conference on Communications.

[4]  K. K. Chi,et al.  Analysis of network error correction based on network coding , 2005 .

[5]  Anna Scaglione,et al.  Opportunistic large arrays: cooperative transmission in wireless multihop ad hoc networks to reach far distances , 2003, IEEE Trans. Signal Process..

[6]  Christina Fragouli,et al.  Processing along the way: forwarding vs. coding , 2004 .

[7]  Gerhard Kramer,et al.  On the separation of channel and network coding in aref networks , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[8]  Ming Xiao,et al.  Energy-Efficient Network Coding for the Noisy Channel Network , 2006, 2006 IEEE International Symposium on Information Theory.

[9]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[10]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[11]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[12]  Lihua Song,et al.  A separation theorem for single-source network coding , 2006, IEEE Transactions on Information Theory.

[13]  Muriel Médard,et al.  On coding for reliable communication over packet networks , 2005, Phys. Commun..

[14]  C. Fragouli.  Processing Along the Way : Forwarding vs , 2004 .

[15]  Gianluigi Ferrari,et al.  Ad Hoc Wireless Networks: A Communication-Theoretic Perspective , 2006 .

[16]  Aaron D. Wyner,et al.  Coding Theorems for a Discrete Source With a Fidelity CriterionInstitute of Radio Engineers, International Convention Record, vol. 7, 1959. , 1993 .

[17]  Shu Lin,et al.  Error Control Coding , 2004 .

[18]  Ozan K. Tonguz,et al.  Ad Hoc Wireless Networks , 2005 .

[19]  Alexander Vardy,et al.  Generalized minimum-distance decoding of Euclidean-space codes and lattices , 1996, IEEE Trans. Inf. Theory.

[20]  Robert M. Gray,et al.  Joint source and noisy channel trellis encoding , 1981, IEEE Trans. Inf. Theory.

[21]  Harish Viswanathan,et al.  Comparison of schemes for streaming multicast in cellular networks with relays , 2006, IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006..

[22]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[23]  Christina Fragouli,et al.  On the throughput improvement due to limited complexity processing at relay nodes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[24]  G. David Forney.  Lower Bounds on Error Probability in the Presence of Large Intersymbol Interference , 1972, IEEE Trans. Commun..

[25]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[26]  Robert M. Gray,et al.  The design of joint source and channel trellis waveform coders , 1987, IEEE Trans. Inf. Theory.

[27]  John G. Proakis,et al.  Digital Communications , 1983 .

[28]  R. Koetter,et al.  An algebraic approach to network coding , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[29]  Sun-Yuan Kung,et al.  Network planning in wireless ad hoc networks: a cross-Layer approach , 2005 .

[30]  Yunnan Wu,et al.  Minimum-energy multicast in mobile ad hoc networks using network coding , 2004, Information Theory Workshop.

[31]  Mung Chiang.  Balancing transport and physical Layers in wireless multihop networks: jointly optimal congestion control and power control , 2005 .