These courses are part of the post-graduate lectures on wireless networks provided by the Department of Communications Engineering of the University of Oulu.

 

Advanced Routing & Network Coding

- Introduction: Network Coding for the Internet and Wireless Networks
- Maximizing Throughput
- Single-Session Network Coding
- The Unicast Case: MinCut Bound, Menger?s Theorem, and Path Packing
- The Broadcast Case: Edmonds' Theorem and Spanning Tree Packing
- The Multicast Case: Steiner Tree Packing and Non-Achievability of MinCut Bound
- Alswede et al.'s Theorem, Multicast Capacity
- Minimizing Energy per Bit
- Minimizing Delay
- Applicability to Real Networks: Theory vs. Practice
- Practical Network Coding
- Local and Global Encoding Vectors, Decoding
- Random Encoding and Inevitability
- Packet Tagging
- Buffering and Generations
- Earliest Decoding
- Applications
- File Download
- Video on Demand, Live Media Broadcast, Game Spectating, and Instant Messaging
- Distributed Storage
- Wireless Mesh Networks
- Sensor Networks
- Advanced topics
- Security
- Resource Optimization
- Multi-session Network Coding
- Joint Network Coding and Distributed Source Coding
- Joint Network Coding and Channel Coding

Papers

1. Zur allgemeinen Kurventheorie. Menger. 1927, Fund. Math., Vol. 10, pp. 95--115.

2. Ford, L. R. and Fulkerson, D. R. Flows in Networks. Princeton : Princeton University Press, 1962.

3. Note on Maximum Flow through a Network. Elias, P., Feinstein, A. and Shannon, C. E. s.l. : IRE, 1956, Trans. Information Theory, Vol. 2.

4. Schrijver, A. Combinatorial Optimization: Polyhedra and Efficiency. s.l. : Springer-Verlag, 2003.

5. Edmonds, J. Edge-Disjoint Branchings. [ed.] R. Rustin. Combinatorial Algorithms. New York : Academic Press, 1973.

6. Packing Steiner Trees. Jain, K., Mahdian, M. and Salavatipour, M. R. Baltimore : ACM-SIAM, January 2003. Symp. on Discrete Algorithms (SODA).

7. Network Information Flow. Alswede, R., et al. s.l. : IEEE, 2000, Trans. Information Theory, Vol. 46.

8. An Algebraic Approach to Network Coding. Koetter, R. and Médard, M. 5, s.l. : IEEE/ACM, October 2003, Trans. Networking, Vol. 11, pp. 782-795.

9. Linear Network Coding. Li, S.-Y. R., Yeung, R. W. and Cai, N. s.l. : IEEE, 2003, Trans. Information Theory, Vol. 49, pp. 371-381.

10. Polynomial time algorithms for multicast network code construction. Jaggi, S., et al. 6, s.l. : IEEE, 2005, Trans. Information Theory, Vol. 51, pp. 1973-1982.

11. Convolutional Network Codes for Cyclic Networks. Erez, E. and Feder, M. Riva del Garda : s.n., April 2005. NetCod.

12. Minimum-energy multicast in mobile ad hoc networks using network coding. Wu, Y., Chou, P. A. and Kung, S.-Y. 11, s.l. : IEEE, November 2005, Trans. Communications, Vol. 53.

13. A Random Linear Network Coding Approach to Multicast. Ho, T., et al. 10, October 2006, IEEE Trans. Information Theory, Vol. 52.

14. Polynomial Time Algorithms for Network Information Flow. Sanders, P., Egner, S. and Tolhuizen, L. San Diego : ACM, June 2003. Symp. Parallelism in Algorithms and Architectures (SPAA).

15. Practical Network Coding. Chou, P. A., Wu, Y. and Jain, K. Allerton : s.n., October 2003. Conference on Communication, Control, and Computing.

16. Measuring ISP topologies with Rocketfuel. Spring, N., Mahajan, R. and Wetherall, D. Pittsburg, PA : s.n., 2002. ACM SIGCOMM.

17. Cohen, B. Incentives Build Robustness in BitTorrent. [Online] May 2003. http://www.bittorrent.org/bittorrentecon.pdf.

18. Network Coding for Large Scale Content Distribution. Gkandsidis, C and Rodruiguez, P. Miami : IEEE, March, 2005. INFOCOM.

19. Comprehensive View of a Live Network Coding P2P System. Gkantsidis, G., Miller, J. and Rodriguez, P. Rio de Janeiro : ACM SIGCOMM/USENIX, 2006. IMC.

20. A Content Distribution System Based on Sparse Network Coding. Ma, G., et al. San Diego : s.n., 2007. NetCod.

21. Network Coding for Peer-to-Peer Storage. Dimakis, A. G., et al. Anchorage : IEEE, May 2007. INFOCOM.

22. How Good is Random Linear Coding Based Distributed Networked Storage? Acedanski, S., et al. Riva del Garda : s.n., April 2005. NetCod.

23. Decentralized Erasure Codes for Distributed Networked Storage. Dimakis, A. G., Prabhakaran, V. and Ramchandran, K. s.l. : IEEE, June 2006, Trans. Information Theory.

24. Information Exchange in Wireless Networks with Network Coding and Physical-Layer Broadcast. Wu, Y., Chou, P. A. and Kung, S.-Y. Baltimore : s.n., March 2005. CISS.

25. XORs in the Air: Practical Wireless Network Coding. Katti, S., et al. Pisa : ACM, September 2006. SIGCOMM.

26. Overcoming Untuned Radios in Wireless Networks with Network Coding. Petrovic, D., Ramchandran, K. and Rabaey, J. Riva del Garda : s.n., April 2005. NetCod.

27. Cooperative Security for Network Coding File Distribution. Gkandsidis, C and Rodruiguez, P. Barcelona, Spain : s.n., 2006. IEEE INFOCOM.

28. Signatures for Network Coding. Charles, D., Jain, K. and Lauter, K. Princeton : s.n., 2006. 40th Annual Conference on Information Sciences and Systems.

29. Distributed utility maximization for network coding based multicasting: a shortest path approach. Wu, Y. and Kung, S.-Y. 8, August 2006, IEEE Journal on Selected Areas in Communications, Vol. 24, pp. 1475--1488.

30. Minimum-Cost Multicast Over Coded Packet Networks. Lun, D. S., et al. 6, June 2006, IEEE Transactions on Information Theory, Vol. 52, pp. 2608--2623.

31. Distributed utility maximization for network coding based multicasting: a critical cut approach. Wu, Y., Chiang, M. and Kung, S.-Y. 2006. 2nd workshop on Network Coding, Theory, and Applications.

32. Min-Cost Selfish Multicast with Network Coding. Bhadra, S, Shakkottai, S. and Gupta, P. Novemeber 2006, IEEE Transactions on Information Theory, pp. 5077--5087.

33. On Achieving Maximum Multicast Throughput in Undirected Networks. Li, Z., Li, B. and Lau, L. C. 6, June 2006, IEEE Trans. Information Theory, Vol. 52, pp. 2467--2485.

34. Linearity and Solvability in Multicast Networks. Dougherty, R., Freiling, C. and Zeger, K. 10, 2004, IEEE Trans. Information Theory, Vol. 50, pp. 2243--2256.

35. On constructive multi-source network coding. Wu, Y. Seattle, WA : s.n., 2006. IEEE Int'l. Symp. Information Theory.

36. Zero-error network coding for acylic network. Song, L. and Yeung, Y. W. 12, Dec. 2003, IEEE Trans. on Information Theory, Vol. 49, pp. 3129--3139.

37. The Capacity region for Multi-source Multi-sink Network Coding. Yan, X., Yeung, R. W. and Zhang, Z. Nice, France : s.n., 2007. IEEE International Symposium on Information Theory.

38. Noiseless coding of correlated information sources. Slepian, D. and Wolf, J. K. July 1973, IEEE Trans. Information Theory, Vol. 19, pp. 471--480.

39. Distributed source coding for sensor networks. Xiong, Z., Liveris, A. and Cheng, S. September 2004, IEEE Signal Processing Magazine, Vol. 21, pp. 80--94.

40. Network information flow -- multiple sources. Song, L. and Yeung, R. W. 2001. IEEE Int'l Symp. Information Theory.

41. Network Coding for Correlated Sources. Ho, T., et al. Princeton : s.n., March 2004. Conf. Information Sciences and Systems (CISS).

42. On practical design for joint distributed source and network coding. Wu, Y., et al. Riva del Garda, Italy : s.n., 2005. 1st Workshop on Network Coding, Theory, and Applications (NETCOD).

43. Nested codes with multiple interpretations. Xiao, L., et al. Princeton, NJ : s.n., 2006. 40th Annual Conf. Information Science and Systems.

44. Broadcasting when Receivers Know Some Messages A Priori. Wu, Y. Nice, France : s.n., 2007. IEEE Int'l Symp. Information Theory.

45. Yeung, R. W., et al. Network coding theory. Foundation and Trends in Communications and Information Theory. 2005, Vol. 2, 4,5, pp. 241--381.

46. Network Coding: An Instatant Primer. Fragouli, C., Le Boudec, J.-Y. L. and Widmer, J. 1, January 2006, ACM SIGCOMM Computer Communication Review, Vol. 36.