1. Distributed Network Coding Based Opportunistic Routing for Multicast Abdallah Khreishah, Issa Khalil, and Jie Wu

2. Enhancing the Performance of Wireless Networks Why to study the problem? – Wireless multihop networks are becoming integral part of our lives. (Mesh networks, sensor networks, etc..) – The unique features of these networks. Interference. Lossy behavior. Broadcast nature. Correlation among the links.

3. Opportunistic Routing

6. Global Scheduling

8. Network Coding

10. From Which & How many to How many.

11. How many packets should each node forward? Assuming independent links: [Chachulski et al., 2007]. Depends on many factors: – The Loss rate of the links. – The fraction of time a node is scheduled. – The correlation among the links. [Srinivasan et al., 2010]

12. Correlation example

13. Cont.

14. Preliminary evaluation

15. Challenges for Multicast

16. Settings

17. Law of Diminishing Returns

18. Formulation

19. Wireless to Wireline Mapping

20. Optimality

21. The Lagrange

23. Distributed algorithm

24. Virtual Queues Updates

25. Practical problems If a node is scheduled to send packets, from which session it should send? When and how to assign credits to next-hop nodes?

26. Coded-feedback

27. Deciding the packet to send

28. Credit assignment

29. Convergence

32. Multicast results

33. Conclusion A simple distributed algorithm that achieves the optimal unicast rate in wireless networks. It is a combination of: – Opportunistic routing. – Intrasession network coding. – Convex optimization. – Coded-feedback. Arbitrary delivery rates and correlations among the links.

34. Some Future Directions Studying Intersession Network Coding. Studying Video Multicast with Multi- resolution Coding (MRC) or Layered Coding. How to optimally construct the multicast tree?

35. Thanks Questions?