Myopic Coding in Multiterminal Networks

This correspondence investigates the interplay between cooperation and achievable rates in multiterminal networks. Cooperation refers to the process of nodes working together to relay data toward the destination. There is an inherent tradeoff between achievable information transmission rates and the level of cooperation, which is determined by how many nodes are involved and how the nodes encode/decode the data. We illustrate this tradeoff by studying information-theoretic decode-forward-based coding strategies for data transmission in multiterminal networks. Decode-forward strategies are usually discussed in the context of omniscient coding, in which all nodes in the network fully cooperate with each other, both in encoding and decoding. In this correspondence, we investigate myopic coding, in which each node cooperates with only a few neighboring nodes. We show that achievable rates of myopic decode-forward can be as large as that of omniscient decode-forward in the low signal-to-noise ratio (SNR) regime. We also show that when each node has only a few cooperating neighbors, adding one node into the cooperation increases the transmission rate significantly. Furthermore, we show that myopic decode-forward can achieve nonzero rates as the network size grows without bound.

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

[2]  Nils Sandell,et al.  Detection with Distributed Sensors , 1980, IEEE Transactions on Aerospace and Electronic Systems.

[3]  Edward C. van der Meulen,et al.  Partial feedback for the discrete memoryless multiple access channel , 1983, IEEE Trans. Inf. Theory.

[4]  Sergio Verdú,et al.  Fifty Years of Shannon Theory , 1998, IEEE Trans. Inf. Theory.

[5]  Mehul Motani,et al.  Optimal Routing for Decode-and-Forward based Cooperation in Wireless Networks , 2007, 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[6]  C.C. White,et al.  Dynamic programming and stochastic control , 1978, Proceedings of the IEEE.

[7]  Leonidas J. Guibas,et al.  Collaborative signal and information processing: an information-directed approach , 2003 .

[8]  David Lindley,et al.  CBMS-NSF REGIONAL CONFERENCE SERIES IN APPLIED MATHEMATICS , 2010 .

[9]  P.K. Varshney,et al.  Channel-aware distributed detection in wireless sensor networks , 2006, IEEE Signal Processing Magazine.

[10]  H. Vincent Poor,et al.  Decentralized Sequential Detection with a Fusion Center Performing the Sequential Test , 1992, 1992 American Control Conference.

[11]  H. Vincent Poor,et al.  An Introduction to Signal Detection and Estimation , 1994, Springer Texts in Electrical Engineering.

[12]  Y. Mei.  Asymptotically optimal methods for sequential change-point detection , 2003 .

[13]  Gerhard Kramer,et al.  Capacity Theorems for the Multiple-Access Relay Channel , 2004 .

[14]  Frans M. J. Willems,et al.  The discrete memoryless multiple-access channel with cribbing encoders , 1985, IEEE Trans. Inf. Theory.

[15]  T. Lai.  SEQUENTIAL ANALYSIS: SOME CLASSICAL PROBLEMS AND NEW CHALLENGES , 2001 .

[16]  Michael Gastpar,et al.  On the Performance of Independently Designed LDPC Codes for the Relay Channel , 2006, 2006 IEEE International Symposium on Information Theory.

[17]  D. S. Mitrinovic,et al.  Classical and New Inequalities in Analysis , 1992 .

[18]  M. A. Girshick,et al.  Bayes and minimax solutions of sequential decision problems , 1949 .

[19]  G. Kramer.  Capacity Theorems for Wireless Relay Channels , .

[20]  Panganamala Ramana Kumar,et al.  An achievable rate for the multiple-level relay channel , 2005, IEEE Transactions on Information Theory.

[21]  M.A. Khojastepour,et al.  Code design for the relay channel and factor graph decoding , 2004, Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004..

[22]  Leonidas J. Guibas,et al.  Locating and bypassing routing holes in sensor networks , 2004, IEEE INFOCOM 2004.

[23]  Rick S. Blum,et al.  Distributed detection with multiple sensors I. Advanced topics , 1997, Proc. IEEE.

[24]  Abdel R. El Gamal,et al.  On information flow in relay networks , 1981 .

[25]  Michael Gastpar,et al.  Information-theoretic multi-hopping for relay networks , 2004 .

[26]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[27]  J. Tsitsiklis.  On threshold rules in decentralized detection , 1986, 1986 25th IEEE Conference on Decision and Control.

[28]  Hesham El Gamal,et al.  On the scaling laws of multimodal wireless sensor networks , 2004, IEEE INFOCOM 2004.

[29]  Venugopal V. Veeravalli,et al.  Sequential decision fusion: theory and applications , 1999 .

[30]  P. Gupta,et al.  Towards an information theory of large networks: an achievable rate region , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[31]  G. Kramer,et al.  Hierarchical wireless networks: capacity bounds using the constrained multiple-access relay channel model , 2004, Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004..

[32]  Ashutosh Sabharwal,et al.  Low density parity check codes for the relay channel , 2007, IEEE Journal on Selected Areas in Communications.

[33]  Ossama Younis,et al.  Distributed clustering in ad-hoc sensor networks: a hybrid, energy-efficient approach , 2004, IEEE INFOCOM 2004.

[34]  Elza Erkip,et al.  Diversity in relaying protocols with amplify and forward , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[35]  J. Wolfowitz,et al.  Optimum Character of the Sequential Probability Ratio Test , 1948 .

[36]  A.J. van Wijngaarden,et al.  On the white Gaussian multiple-access relay channel , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[37]  John N. Tsitsiklis,et al.  Extremal properties of likelihood-ratio quantizers , 1993, IEEE Trans. Commun..

[38]  Wei Yu,et al.  Bilayer LDPC Codes for the Relay Channel , 2006, 2006 IEEE International Conference on Communications.

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

[40]  J. Andel.  Sequential Analysis , 2022, The SAGE Encyclopedia of Research Design.

[41]  Sanjay Shakkottai,et al.  Asymptotics of query strategies over a sensor network , 2004, IEEE INFOCOM 2004.

[42]  M. Gastpar,et al.  Information-theoretic multihopping for relay networks , 2004, International Zurich Seminar on Communications, 2004.

[43]  Yingbin Liang,et al.  The impact of relaying on the capacity of broadcast channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[44]  R. Srikant,et al.  Unreliable sensor grids: coverage, connectivity and diameter , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[45]  Viktor K. Prasanna,et al.  Energy-latency tradeoffs for data gathering in wireless sensor networks , 2004, IEEE INFOCOM 2004.

[46]  Walter T. Federer,et al.  Sequential Design of Experiments , 1967 .

[47]  Peter Willett,et al.  On the optimality of the likelihood-ratio test for local sensor decision rules in the presence of nonideal channels , 2005, IEEE Transactions on Information Theory.

[48]  Pramod K. Varshney,et al.  Distributed detection with multiple sensors I. Fundamentals , 1997, Proc. IEEE.

[49]  G. Lorden.  On Excess Over the Boundary , 1970 .

[50]  E. Meulen,et al.  Three-terminal communication channels , 1971, Advances in Applied Probability.

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

[52]  M. Jiang,et al.  Cluster based routing protocol (CBRP) , 1999 .