Approximately optimal wireless broadcasting

IEEE Transactions on Information Theory

Volumn 58, Issue 12, 2012, Pages 7154-7167

  Kannan, Sreeram ^a   Raja, Adnan ^b   Viswanath, Pramod ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Broadcast network; broadcast relay channels; capacity; Marton code; multiuser channels; network information theory; wireless networks

Indexed keywords

BROADCAST NETWORKS; BROADCAST-RELAY CHANNELS; CAPACITY; MARTON CODE; MULTI-USER CHANNEL; NETWORK INFORMATION THEORY;

CHANNEL CAPACITY; CONCATENATED CODES; GAUSSIAN NOISE (ELECTRONIC); RADIO BROADCASTING; RADIO TRANSMISSION; WIRELESS NETWORKS;

CHANNEL CODING;

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

References (28)

1. A. S. Avestimehr, S. N. Diggavi, and D. N. C. Tse, "Wireless network information flow: A deterministic approach," IEEE Trans. Inf. Theory, vol. 57, no. 4, pp. 1872-1905, Apr. 2011.
2. M. Anand and P. R. Kumar, "A digital interface for Gaussian relay and interference networks: Lifting codes from the discrete superposition model," IEEE Trans. Inf. Theory, vol. 57, no. 5, pp. 2548-2564, May 2011.
3. T. M. Cover and J. A. Thomas, Elements of Information Theory, ser. Wiley Series in Telecommunications and Signal Processing. New York: Wiley, 2006.
4. A. El Gamal, "On information flow in relay networks," in Proc. IEEE Nat. Telecommun. Conf., Nov. 1981, vol. 2, pp. D4.1.1-D4.1.4.
5. S. H. Lim, Y.-H. Kim, A. ElGamal, and S.-Y. Chung, "Noisy network coding," IEEE Trans. Inf. Theory, vol. 57, no. 5, pp. 3132-3152, May 2011.
6. K. Marton, "A coding theorem for the discrete memoryless broadcast channel," IEEE Trans. Inf. Theory, vol. IT-25, no. 3, pp. 306-311, May 1979. (Pubitemid 9450752)
7. A. El Gamal and E. Van der Meulen, "A proof of Marton's coding theorem for the discrete memoryless broadcast channel," IEEE Trans. Inf. Theory, vol. IT-27, no. 1, pp. 120-122, Jan. 1981.
8. Y. Liang and V. V. Veeravalli, "Cooperative relay broadcast channels," IEEE Trans. Inf. Theory, vol. 53, no. 3, pp. 900-928, Mar. 2007. (Pubitemid 46487783)
9. M. S. Pinsker, "Capacity of noiseless broadcast channels," Probl. Pered. Inf., vol. 14, no. 2, p. 2834, Apr.-Jun. 1978,
10. translated in Probl. Inf. Transm., pp. 97-102, Apr.-Jun. 1978).
11. P. Bergmans, "Random coding theorem for broadcast channels with degraded components," IEEE Trans. Inf. Theory, vol. IT-19, no. 2, pp. 197-207, Mar. 1973.
12. H. Weingarten, Y. Steinberg, and S. Shamai, "The capacity region of the Gaussian multiple-input multiple-output broadcast channel," IEEE Trans. Inf. Theory, vol. 52, no. 9, pp. 3936-3964, Sep. 2006. (Pubitemid 44363826)
13. M. X. Goemans, S. Iwata, and R. Zenklusen, "An algebraic framework for wireless information flow," presented at the Allerton Conf. Commun., Control, Comput., Sep. 2009.
14. S. M. S. Yazdi and S. A. Savari, "A combinatorial study of linear deterministic relay networks," presented at the Allerton Conf. Commun., Control, Comput., Sep. 2009.
15. A. Raja, V. Prabhakaran, and P. Viswanath, "Reciprocity in linear deterministic networks under linear coding," presented at the IEEE Inf. Theory Workshop, Volos, Greece, Jun. 2009.
16. S. Kannan, A. Raja, and P. Viswanath, "Approximately optimal broadcasting in wireless networks," presented at the IEEE Int. Conf. Signal Process. Commun., Bangalore, India, Jul. 2010.
17. S. Kannan, A. Raja, and P. Viswanath, "Approximately optimal broadcasting-cum-multicasting in wireless networks," presented at the IEEE Int. Symp. Inf. Theory, St. Petersburg, Russia, Aug. 2011.
18. E. Perron, "Information-theoretic secrecy for wireless networks," Ph.D. dissertation, École Polytechnique Fédéral de Lausanne, Lausaane, Switzerland, Sep. 2009.
19. R.Koetter and M. Médard, "An algebraic approach to network coding," IEEE Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2003.
20. M. Kim, E. Erez, E. M. Yeh, and M. Médard, Deterministic network model revisited: An algebraic network coding approach [Online]. Available: http://arxiv.org/abs/1103.0999
21. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory., vol. 46, no. 4, pp. 1204-1216, Jul. 2000.
22. S. Riis, "Reversible and irreversible information networks," IEEE Trans. Inf. Theory., vol. 53, no. 11, pp. 4339-4349, Nov. 2007. (Pubitemid 350141930)
23. S. Vishwanath, N. Jindal, and A. J. Goldsmith, "Duality, achievable rates and sum-rate capacity of Gaussian MIMO broadcast channel," IEEE Trans. Inf. Theory., vol. 49, no. 10, pp. 2658-2668, Oct. 2003.
24. P. Viswanath and D. Tse, "Sum capacity of the multiple antenna Gaussian broadcast channel and uplink-downlink duality," IEEE Trans. Inf. Theory., vol. 49, no. 8, pp. 1912-1923, Aug. 2003.
25. M. M. Butt,G.Caire, and R. R. Müller,Linear finite-field deterministic networks with many sources and one destination [Online]. Available: http://arxiv.org/abs/1001.2464.
26. E. Telatar, "Capacity of multi-antenna Gaussian channels," Eur. Trans. Telecomm., vol. 10, pp. 585-596, Nov. 1999.
27. D. Vasudevan and S. B. Korada, "Polymatroidal flows on two classes of information networks," IEEE Trans. Inf. Theory, vol. 57, no. 1, pp. 227-233, Jan. 2011.
28. R. Dougherty, K. Zeger, and C. Freiling, "Nonreversibility and equivalent constructions of multiple-unicast networks," IEEE Trans. Inf. Theory, vol. 52, no. 11, pp. 5067-5077, Nov. 2006. (Pubitemid 44680592)