Wireless network information flow: A deterministic approach

IEEE Transactions on Information Theory

Volumn 57, Issue 4, 2011, Pages 1872-1905

  Avestimehr, A Salman ^a   Diggavi, Suhas N ^b   Tse, David N C ^c  

^a School of Operations Research and Industrial Engineering   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Information flow; network capacity; network information theory; relay networks; wireless networks

Indexed keywords

ARBITRARY NUMBER; CHANNEL PARAMETER; CODEWORD; CUT-SET; DETERMINISTIC ANALYSIS; DETERMINISTIC APPROACH; DETERMINISTIC CHANNEL MODEL; DIAMOND NETWORKS; ERGODICS; GAUSSIAN NETWORKS; GAUSSIANS; HALF-DUPLEX; INFORMATION FLOWS; MAX-FLOW MIN-CUT; MULTICAST NETWORK; NATURAL GENERALIZATION; NETWORK CAPACITY; NETWORK INFORMATION FLOW; NETWORK INFORMATION THEORY; NOISE LEVELS; RECEIVED SIGNALS; RELAY CHANNELS; RELAY NETWORKS; RELAY NODE; SIGNAL STRENGTHS; SINGLE SOURCE; STANDING PROBLEMS; TWO-STEP APPROACH; UPPER BOUND; WIRED NETWORKS;

GAUSSIAN DISTRIBUTION; INFORMATION THEORY; INTERFERENCE SUPPRESSION; RELAY CONTROL SYSTEMS;

WIRELESS NETWORKS;

EID: 79952852802     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2011.2110110     Document Type: Article

References (30)

1. L. R. Ford and D. R. Fulkerson, Maximal flow through a network Canad. J. Math., vol. 8, pp. 399-404, 1956.
2. M. Effros, M. Medard, T. Ho, S. Ray, D. Karger, and R. Koetter, Linear network codes: A unified framework for source channel, and network coding presented at the DIMACS Workshop on Network Information Theory, 2003.
3. E. C. van der Meulen, Three-terminal communication channels Ad. Appl. Pmb., vol. 3, pp. 120-154, Sep. 1971.
4. T. M. Cover and A. El Gamal, Capacity theorems for the relay channel IEEE Trans. Inf. Theory, vol. 25, no. 5, pp. 572-584, Sep. 1979.
5. M. Aref, Information Flow in Relay Networks Ph.D. dissertation, Stanford Univ., Stanford, CA, Oct. 1980.
6. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, Network information flow IEEE Trans. Inf. Theory, vol. IT-46, no. 4, pp. 1204-1216, Jul. 2000.
7. S.-Y. R. Li, R. W. Yeung, and N. Cai, Linear network coding IEEE Trans. Inf. Theory, vol. 43, no. 2, pp. 371-381, Feb. 2003.
8. R. Koetter and M. Médard, An algebraic approach to network coding IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, 2003.
9. N. Ratnakar and G. Kramer, The multicast capacity of deterministic relay networks with no interference IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2425-2432, Jun. 2006. (Pubitemid 43898902)
10. P. Gupta, S. Bhadra, and S. Shakkottai, On network coding for interference networks presented at the IEEE Int. Symp. Information Theory (ISIT), Seattle, WA, Jul. 2006.
11. A. F. Dana, R. Gowaikar, R. Palanki, B. Hassibi, and M. Effros, Capacity of wireless erasure networks IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 789-804, Mar. 2006. (Pubitemid 46444874)
12. B. Schein, Distributed Coordination in Network Information Theory. Cambridge, MA: Mass. Inst. Technol., 2001.
13. L. L. Xie and P. R. Kumar, A network information theory for wireless communication: Scaling laws and optimal operation IEEE Trans. Inf. Theory, vol. IT-50, no. 5, pp. 748-767, May 2004.
14. G. Kramer, M. Gastpar, and P. Gupta, Cooperative strategies and capacity theorems for relay networks IEEE Trans. Inf. Theory, vol. 51, no. 9, pp. 3037-3063, Sep. 2005. (Pubitemid 41430974)
15. R. W. Yeung, S.-Y. Li, and N. Cai, Network Coding Theory (Foundations and Trends(R) in Communications and Information Theory). Hanover, MA: Now Publishers, 2006.
16. C. Fragouli and E. Soljanin, Network coding fundamentals Found. Trends Netw., vol. 2, no. 1, pp. 1-133, 2007. (Pubitemid 47007533)
17. T. Ho, R. Koetter, M. Medard, M. Effros, J. Shi, and D. Karger, A random linear network coding approach to multicast IEEE Trans. Inf. Theory, vol. 52, no. 10, pp. 4413-4430, Oct. 2006. (Pubitemid 46445282)
18. G. D. Forney and G. Ungerboeck, Modulation and coding for linear Gaussian channels IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 2384-2415, Oct. 1998. (Pubitemid 128741894)
19. T. M. Cover and J. A. Thomas, Elements of Information Theory, ser. Wiley Series in Telecommunications and Signal Processing, 2nd ed. Hoboken, NJ: Wiley, 2006.
20. A. Ozgur and S. N. Diggavi, Approximately achieving Gaussian relay network capacity with lattice codes presented at the IEEE Int., Symp. Information Theory, Austin, TX, Jun. 2010 [Online]. Available: http:// arxiv.org/abs/1005.1284
21. E. Perron, S. N. Diggavi, and I. E. Telatar, On noise insertion strategies for wireless network secrecy in Proc. IEEE Information Theory and Applications Workshop (ITA), Feb. 2009, pp. 77-84.
22. S. Avestimehr, S. N. Diggavi, and D. Tse, Wireless network information flow presented at the 45th Allerton Conf. Comm., Control, and Computing, Monticello, IL, Sep. 26-28, 2007.
23. M. Feder and A. Lapidoth, Universal decoding for channels with memory IEEE Trans. Inf. Theory, vol. 44, no. 9, pp. 1726-1745, Sep. 1998. (Pubitemid 128738547)
24. D. Blackwell, L. Breiman, and A. J. Thomasian, The capacity of a class of channels Ann. Math. Statist., vol. 30, no. 4, pp. 1229-1241, Dec. 1959.
25. W. L. Root and P. P. Varaiya, Capacity of classes of Gaussian channels SIAM J. Appl. Math., vol. 16, no. 6, pp. 1350-1393, Nov. 1968.
26. M. A. Khojastepour, A. Sabharwal, and B. Aazhang, Bounds on achievable rates for general multi-terminal networks with practical constraints in Proc. 2nd International Workshop on Information Processing (IPSN), 2003, pp. 146-161.
27. B. Bollobas, Modern graph theory in Graduate Texts in Mathematics. New York: Springer, 1998, vol. 184.
28. A. Orlitsky and J. Roche, Coding for computing IEEE Trans. Inf. Theory, vol. 47, no. 3, pp. 903-917, Mar. 2001. (Pubitemid 32425425)
29. E. Perron, Information-Theoretic Secrecy for Wireless Networks Ph.D. dissertation, no 4476, EPFL, Aug. 2009.
30. U. Nieson and S. N. Diggavi, The approximate capacity of the Gaussian N-relay diamond network. [Online]. Available: http://arxiv.org/abs/1008.2813.