Separation Theorems And Partial Orderings For Sensor Network Problems
In this chapter, we discuss information-theoretic techniques to understand sensor network performance. From an information-theoretic perspective, sensor network problems are typically joint source-channel coding problems: The goal is to recover an approximate version of the underlying source information (by contrast to, for example, the standard channel coding problems where the goal is to communicate bits at the smallest possible error probability). Hence, the overall encoding process maps a sequence of source observations into a suitable sequence of channel inputs in such a way that the decoder, upon observing a noisy version of that sequence, can get an estimate of the source observations at the highest possible fidelity. Successful code constructions must exploit the structure of the underlying source (and the mechanism by which the source is observed) and the communication channel. Designing codes that simultaneously achieve both should be expected to be a rather difficult task, and it is therefore somewhat surprising that Shannon  found a very elegant solution for the case of point-to-point communication (as long as both the source and the channel are stationary and ergodic, and cost and fidelity are assessed by per-letter criteria). The solution consists in a separation of the overall task into two separate tasks. Specifically, an optimal communication strategy can be designed in two parts, a source code, exploiting the structure of the source and the observation process, followed by a channel code, exploiting the structure of the communication channel. The two stages are connected by a universal interface - bits- that does not depend on the precise structure. For the purpose of this chapter, we will refer to such an architecture as separation-based.
KeywordsSensor Network Network Code Channel Code Separation Theorem Source Symbol
Unable to display preview. Download preview PDF.
- R. Ahlswede. Multi-way communication channels. In Proc IEEE Int Symp Info Theory, Tsahkadsor, Armenian S.S.R., September 1971.Google Scholar
- J. Barros and S. Servetto. Reachback capacity with non-interfering nodes. In Proc IEEE Int Symp Info Theory, Yokohama, Japan, July 2003.Google Scholar
- M. Gastpar. To Code Or Not To Code. PhD thesis, Ecole Polytechnique Fédérale (EPFL), Lausanne, Switzerland, 2002.Google Scholar
- M. Gastpar. Uncoded transmission is exactly optimal for a simple Gaus-sian sensor network. In Proc. 2007 Information Theory and Applications Workshop, San Diego, CA, February 2007.Google Scholar
- M. Gastpar, B. Rimoldi, and M. Vetterli. To code or not to code. In Proc IEEE Int Symp Info Theory, page 236, Sorrento, Italy, June 2000.Google Scholar
- M. Gastpar and M. Vetterli. On the capacity of wireless networks: The relay case. In Proc IEEE Infocom 2002, volume 3, pages 1577 - 1586, New York, NY, June 2002.Google Scholar
- M. Gastpar and M. Vetterli. Source-channel communication in sensor net- works. In Leonidas J. Guibas and Feng Zhao, editors, 2nd International Workshop on Information Processing in Sensor Networks (IPSN’03), pages 162-177. Lecture Notes in Computer Science, Springer, New York, NY, April 2003.CrossRefGoogle Scholar
- M. Gastpar and M. Vetterli. Power, spatio-temporal bandwidth, and distortion in large sensor networks. IEEE Journal on Selected Areas in Communications (Special Issue on Self-Organizing Distributive Collaborative Sensor Networks), 23(4):745-754, April 2005.Google Scholar
- H. Liao. A coding theorem for multiple access communications. In Proc IEEE Int Symp Info Theory, Asilomar, CA, February 1972.Google Scholar
- J. L. Massey. Causality, feedback and directed information. In Proc 1990 Int Symp Info Theory and Its Applications (ISITA’90), pages 303-305, Hawaii, U.S.A., November 1990.Google Scholar
- B. Nazer and M. Gastpar. Reliable computation over multiple access channels. In Proc 43rd Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, September 2005.Google Scholar
- B. Nazer and M. Gastpar. Computing over multiple-access channels with connections to wireless network coding. In Proceedings of the 2006 Inter-national Symposium on Information Theory (ISIT 2006), Seattle, WA, July 2006.Google Scholar
- S. S. Pradhan, S. Choi, and K. Ramchandran. An achievable rate region for multiple access channels with correlated messages. In Proc IEEE Int Symp Info Theory, Chicago, IL, June 27-July 2 2004.Google Scholar
- S. Ray, M. Effros, M. Médard, R. Koetter, and T. Ho abd D. Karger abd J. Abounadir. On separation, randomness and linearity for network codes over finite fields. March 2006. http://arxiv.org/abs/cs/0603022.
- I. E. Telatar. Capacity of multi-antenna Gaussian channels. Bell Labs Technical Memorandum, June 1995. Also published in European Trans-actions on Telecommunications, 10(6):585-596, Nov.-Dec. 1999.Google Scholar