Coding for Wireless Sensor Networks

In this chapter, we show how network-wide coding can be used to construct reliable wireless sensor networks that are power and bandwidth efficient. There are many challenges in designing efficient wireless sensor networks. Performance of wireless communication systems is severely affected by high path loss, fading, and interference. Furthermore, change in network topology due to mobility complicates neighbor discovery, routing, and scheduling. Our proposed network-wide coding, a coding strategy over networks, is a technique that can provide both reliability and efficiency when applied to a large-scale wireless sensor network in the presence of such obstacles.

[1]  John S. Seybold,et al.  Introduction to RF Propagation: Seybold/Introduction to RF Propagation , 2005 .

[2]  Sung Hoon Lim,et al.  Distributed decode-forward for multicast , 2014, 2014 IEEE International Symposium on Information Theory.

[3]  Peter Elias,et al.  A note on the maximum flow through a network , 1956, IRE Trans. Inf. Theory.

[4]  R. Gallager,et al.  The Gaussian parallel relay network , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[5]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

[6]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[7]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[8]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[9]  Sae-Young Chung,et al.  Noisy Network Coding , 2010, IEEE Transactions on Information Theory.

[10]  Ayfer Özgür,et al.  Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks , 2006, IEEE Transactions on Information Theory.

[11]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

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

[13]  Sae-Young Chung,et al.  A Unified Achievability Theorem , 2014, ArXiv.

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

[15]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[16]  Te Sun Han,et al.  A new achievable rate region for the interference channel , 1981, IEEE Trans. Inf. Theory.

[17]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

[18]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[19]  J. Seybold.  Introduction to RF Propagation , 2005 .

[20]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[21]  Abbas El Gamal,et al.  Relay Networks With Delays , 2007, IEEE Transactions on Information Theory.