1. Reliable Recovery In Mobile Ad Hoc Multicast Networks  教授：林振緯  班級：碩士在職專班（一）  學號： 492515045  姓名：呂國銓  日期： 93.06.01

2. - 2 - O UTLINE Introduction Related Work Proposal Protocol Future Work Reference

3. - 3 - Introduction Importance of MANET Mobility ＝＞ Disconnect Detect by Data Link Layer Reconnect by the underlying multicast routing protocol Focus on recovery mechanism Transport Layer S X

4. - 4 - Relate Work Reliability ： Reduce Control Message FAT Protocol  Region Hierarchy  Directional Recovery RALM Protocol  Congestion Control  Send-And-Wait

5. - 5 - Directional Recovery A B1 C1 D1 E1 F1 B2 C2 D2 E2 F2 Backtracking = 1 Backtracking = 2 Backtracking = 3

6. - 6 - FAT ACK Table Node123456789101112 CID100200300400500600700800900100011001200 PID-100200 300 5007008001200100 GID-100 200 300 500100 1 2 34 5 6 7 9 8 10 12 11

7. - 7 - Original Multicast Tree S X F  Node X moves  Data link layer detects disconnected

8. - 8 - Reconnect By Routing Protocol S F  Reconnect by multicast routing protocol

9. - 9 - NACK AND RTQ Of FAT S F  Every node sends NACK and RTQ to its reliability agent

10. - 10 - Retransmission Of FAT S F  Everyone’s agent sends packet to its children

11. - 11 - Disadvantage Of FAT All Nodes Of Subtree Send NACK And RTQ to one’s Reliability Agent They Receive Packets And Unicast To Their Children

12. - 12 - NACK Of RALM S F  Every nodes send NACK to source  Source adds nodes to Receive List NACK

13. - 13 - RTQ Of RALM S F  Source selects Feedback Receiver form Receiver List  Feedback Receiver sends RTQ to source Multicast Domain RTQ

14. - 14 - Retransmission Of RALM S F  Source multicast packet to everyone of Receiver List Multicast Domain RTQ

15. - 15 - ACK Of RALM S F  Every nodes send ACK to source  Source deletes nodes from Receive List ACK

16. - 16 - Disadvantage Of RALM All Of NACK And ACK To Source Feedback Receiver selected is passive All Of Receiver List Works One By One Include Subtree And The Other Node

17. - 17 - Proposal Recovery Scheme S X F  Data link layer detects disconnect Multicast Domain  Node F multicast descendant “silent”

18. - 18 - Proposal Recovery Scheme S F A  Recovery only F  No any other control message from the others Multicast Domain

19. - 19 - Proposal Recovery Scheme S F  F multicasts packet to descendant Multicast Domain

20. - 20 - Proposal Recovery Scheme S F  F sends ACK to Agent  F multicasts “wake” to descendants Multicast Domain

21. - 21 - Conclusion Combination Of FAT And RALM Departing Nodes Always In The Same Subtree Root Of The Orphan Subtree Is Certain Feedback Receiver Feedback Receiver Notifies Descendant Nodes Stop Sending Until Feedback Receiver’s ACK (receives all loss packet) Both Localization And Congest Control

22. - 22 - Future Work Study About “Hierarchical Region” Study About Multicast Routing Protocol NS-2 Simulation  Packet Delivery Ratio  Control Overhead  End-to-End Delay  Compare with FAT and RALM

23. - 23 - Metrics Of Simulation Packet Delivery Ratio  Effectiveness  Reliability Control Overhead =  Efficiency End-to-End Delay  Timeliness Total Data and Control Packets Data Packets Received

24. - 24 - References  Wanjiun Liao and Ming-Yu Jiang, “ Family ACK Tree (FAT): Supporting Reliable Multicast in Mobile Ad Hoc Networks “, Vehicular Technology, IEEE Transactions on, Volume: 52, Issue: 6, Nov. 2003. Pages:1675 - 1685  Tang, K.; Obraczka, K.; Lee, S.-J.; Gerla, M.,” Reliable Adaptive Lightweight Multicast Protocol “ Communications, 2003. ICC '03. IEEE International Conference on, Volume: 2, 11-15 May 2003 pages:1054 - 1058 vol.2  S. Floyd, V. Jacobson, S. McCanne, C. Liu, and L. Zhang, “A reliable multicast framework for lightweight sessions and application-level framing,” IEEE/ACM Trans. Networking, vol. 5, no. 6, pp. 784–803, Dec. 1997.  Tang, K.; Obraczka, K.; Sung-Ju Lee; Geria, M., “A reliable, congestion-control led multicast transport protocol in multimedia multi-hop networks” Wireless Personal Multimedia Communications, 2002. The 5th International Symposium on, Volume: 1, 27- 30 Oct. 2002 Pages:252 - 256 vol.1