1. On-Demand, Link-State, Multi-Path QoS Routing in a Wireless Mobile Ad-Hoc Network 指導教授：石 貴 平 報告學生：莊 宗 翰 報告日期： 2003/04/24 Yuh-Shyan Chen, Yu-Chee Tseng, Jang-Ping Sheu, and Po-Hsuen Kuo European Wireless, 2002.

2. Outline  Introduction  Basic Idea  The On-Demand, Link-State, Multi-Path QoS Routing Protocol  Experimental Results  Conclusions

3. Introduction  An on-demand, link-state, multi-path QoS routing protocol in a MANET.  A CDMA-over-TDMA channel model was assumed.  The routing protocol reactively collects link-state information from source to destination.  Calculate the end-to-end path bandwidth.  Search multi-path routes at the destination which satisfy the bandwidth requirement.

4. Basic Idea (1)  Multi-Path QoS Routing

5. Basic Idea (2)  Calculate the end-to-end path bandwidth Example of hop-by-hop time slot reservation scheme

6. Basic Idea (3)  Calculate the end-to-end path bandwidth Example of slot reservation by our protocol

7. The On-Demand, Link-State, Multi-Path QoS Routing Protocol (1)  Phase 1: On-Demand, Link-State Delivery and Collection  QRREQ(S, D, node_history, free_time_slot_list, B, TTL)

8. The On-Demand, Link-State, Multi-Path QoS Routing Protocol (2)  Phase 2: Uni-Path Discovery  Time-Slot Reservation Tree ( T )

9. The On-Demand, Link-State, Multi-Path QoS Routing Protocol (3)  Phase 2: Uni-Path Discovery  Least-Cost-First Time-Slot Reservation Tree ( T LCF )

10. The On-Demand, Link-State, Multi-Path QoS Routing Protocol (4)  Phase 3: Multi-Path Discovery and Reply  Bandwidth requirement = 4

11. The On-Demand, Link-State, Multi-Path QoS Routing Protocol (5)  Phase 3: Multi-Path Discovery and Reply S E C D 1 253

12. The On-Demand, Link-State, Multi-Path QoS Routing Protocol (6)  Phase 3: Multi-Path Discovery and Reply S E C D 0 253

13. The On-Demand, Link-State, Multi-Path QoS Routing Protocol (7)  Phase 3: Multi-Path Discovery and Reply S E C D 0 253

14. The On-Demand, Link-State, Multi-Path QoS Routing Protocol (8)  Phase 3: Multi-Path Discovery and Reply  Bandwidth requirement = 4

15. Experimental Results (1)  Compared protocol  MP1: Our Multi-path QoS routing protocol with T LCF  MP2: Our Multi-path QoS routing protocol without T LCF  LIN: C.-R. Lin. On-Demand QoS Routing in Multihop Mobile Networks. In Proc. of IEEE INFOCOM 2001, pages 1735–1744, April 2001.  Simulation parameters:  Hosts: 20~40  Time slots in data phase: 16  Bandwidth requirement: 1, 2, and 4  Bandwidth density: 25%~75% network density  Mobility: 2~10 ft/sec

16. Experimental Results (2)  Success Rate (SR) Hosts=30 Number of routing packets=30 Hosts=30 Network density=63%

17. Experimental Results (3)  Slot Utilization (SU) Hosts=30 Number of routing packets=30 Hosts=30 Network density=63%

18. Experimental Results (4)  OverHead (OH) Number of routing packets=30 Network density=38% Hosts=30 Number of routing packets=30

19. Experimental Results (5)  Incomplete Rate (IR) Hosts=30 Number of routing packets=30 Network density=38%

20. Conclusions  We present an on-demand, link-state, multi-path QoS routing protocol in a MANET.  Our approach greatly improves the success rate by means of searching the QoS multi-path routing.  Performance analysis results demonstrate that our proposed protocol outperforms existing QoS routing protocol.

21. END Thank you!!