Bounds on the network coding capacity for wireless random networks

2007 Information Theory and Applications Workshop, Conference Proceedings, ITA

Volumn , Issue , 2007, Pages 231-236

  Aly, Salah A ^a   Kapoor, Vishal ^a   Meng, Jie ^a   Klappenecker, Andreas ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CAPACITY-OF-NETWORK; CHERNOFF BOUNDS; EXPECTED VALUES; FLOW CAPACITIES; MINIMUM CUTS; MULTICAST NETWORKS; NETWORK CODING; RANDOM NETWORKS; REALISTIC MODELING; SIMULATION RESULTS; UPPER AND LOWER BOUNDS; WIRELESS NODES;

CONTROL THEORY; CYBERNETICS; INFORMATION THEORY; PROGRAMMING THEORY;

WIRELESS NETWORKS;

EID: 48049116167     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITA.2007.4357585     Document Type: Conference Paper

References (16)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung. Network information flow. IEEE Trans. Info. Theory, 46:1204-1216, 2000.
2. N. Alon and J. H. Spencer. The Probabilistic Method. John Wiley, 2000.
3. Reinhard Diestel. Graph Theory. Graduate Texts in Mathematics, Volume 173. Springer-Verlag, Heidelberg, third edition edition, July 2005.
4. C. Fragouli, J. Le Boudec, and J. Widmer. Network coding: An instant primer. ACM SIGCOMM Computer Communication Review, 36(1):63-68, 2006.
5. T. Ho, R. Koetter, M. Medard, D. Karger, and M. Effros. The benefits of coding over routing in a randomized setting. In Proceedings of the IEEE International Symposium on Information Theory, page 442, Yokohama, Japan, June 2003.
6. T. Ho, M. Medard, R. Koetter, D. R. Karger, M. Effros, J. Shi, and B. Leong. Toward a random operation of networks. submitted to IEEE Trans. Inform. Theory., 2006.
7. T. Ho, M. Medard, J. Shi, M. Effros, and D. R. Karger. On randomized network coding. 41st Annual Allerton Conference on Communication Control and Computing, Oct. 2003.
8. S. Jaggi, P. Sanders, P. A. Chou, M. Effors, S. Egner, and L. M. Tolhuizen. Polynomial time algrithms for multicast network code construction. IEEE Trans. Info. Theory, 51(6), June 2005.
9. D. R. Karger. Random sampling in cut, flow and network design problems. Math. of Oper. Res., 24(2):0383 0413, 1999.
10. R. Koetter and M. Medard. An algebraic approach to network coding. IEEE Trans. on Networking, October 2003.
11. F. Kuhn, R. Wattenhofer, and A. Zollinger. Ad-hoc networks beyond unit disk graphs. 1st ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), San Diego, California, USA, 2003.
12. S.-Y. R. Li, R. W. Yeung, and N. Cai. Linear network coding. IEEE Trans. Inform. Theory, IT-49(2):371381, Feb. 2003.
13. M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005.
14. A. Ramamoorthy, J. Shi, and R.D. Wesel. On the capacity of network coding for random networks. In Allerton Conference on Communica-tion,Control and Computing, 2003.
15. A. Ramamoorthy, J. Shi, and R.D. Wesel. On the capacity of network coding for random networks. IEEE Trans. Info. Theory, 51(8), Aug. 2005.
16. R. W. Yeung. A First Course in Information Theory. Kluwer/Plenum, 2002.