1. タスク A ワイヤレスネットワークシステム 慶應義塾大学 徳田研究室 間 博人

2. 概要 モバイルアドホックネットワーク環境 におけるルーティングに関する研究 広域マルチホップ無線ネットワークシ ステムの構築に関する研究

3. モバイルアドホックネット ワーク 経路短縮 経路切り替え ブロードキャストの抑制 ノードの移動によるトポロジの変 動 電波品質による通信状況の変動 ルーティングコスト

4. 広域マルチホップ無線ネットワークシス テム マルチホップに適したマルチチャネル CSMA シングルチャネル 同一チャネル干渉

6. A Proximity-based Routing Protocol for Wireless Multi-hop Networks Tokuda Lab. Keio Univ. Masato Saito

7. Introduction About Ad hoc Network Current Problem Solution: Optimized Re-Routing (OR2) Main Evaluation Experiments Simulation Conclusion and Future Work DoCoMo 成果発表

8. Mobile Ad Hoc Networks Formed by wireless hosts which may be mobile Without (necessarily) using a pre-existing infrastructure Routes between nodes may potentially contain multiple hops Node Mobility causes route changes Introduction Ease of deployment, Speed of deployment, Decreased dependence on infrastructure → DoCoMo 成果発表

9. Many Applications Personal area networking cell phone, laptop, ear phone, wrist watch Military environments soldiers, tanks, planes Civilian environments taxi cab network meeting rooms Robot network Emergency operations search-and-rescue policing and fire fighting DoCoMo 成果発表

10. An Application Scenario Cellular and BS BS Cannot connect to BS directly. Using multi-hop Connection to BS A B DoCoMo 成果発表

11. Many Protocols Proposed … ＤＳＲ ----- On-demand Source Routing ＡＯＤＶ ----- On-demand Table Driven ＬＡＲ ----- GPS-based Routing ＺＲＰ ----- Proactive Zone Routing, Hybrid → But, these protocols mainly focus on connectivity and route discovery. Previous protocols realize efficient connectivity? DoCoMo 成果発表

12. Problems of Conventional protocols 1. Not identify the nearness of two nodes. For example, 2. Never change the route unless the links fails, So ….. Problem Definition 123 1 2 3 DoCoMo 成果発表

13. Effect of Path Shortening DSR (http://www.monarch.cs.rice.edu/) on FreeBSD,http://www.monarch.cs.rice.edu/ 5 Laptops with 802.11b NICs DoCoMo 成果発表

14. OR2 Solution Estimates the change of network topology (the nearness of two nodes) based on the local link state of SNR Re-routes the path adaptive to node mobility when the links are still active.  Optimized Re-Routing （ OR2 ） 12312 3 12 3 DoCoMo 成果発表

15. Proximity : to identify the nearness The area around Node A where the received SNR value is more than a threshold. suppose that Node A and B are the same location if Node B is in the proximity of A. A B Proximity of Node A Cell OR2 Solution We assume that all nodes in a network. Have the same NIC. DoCoMo 成果発表

16. One-hop path shortening Proximity of Node C A B C C ∈ P (B) flow Proximity of Node A movement Proximity of Node B C 1.IF S(bc) > Smax 2.THEN C ∈ P (B) 3.C sends REQ to A 4.A sends DATA to C S(bc) is the received SNR value of C. Smax is the threshold of proximity. P (B) is the proximity of Node B. S(bc) = S(cb) Symbol Definition

17. Exclusive Control the cases that neighbor nodes initiate shortening the same path….. A B C D E F C flow time OR2_REQ OR2_REP OR2_RREQ Shorten route SSNR > S max SSNR > S min S max > S min B A DoCoMo 成果発表

18. OR2 features Local Decision using local link quality obtainable from own NIC. No periodic control packets. Network bandwidth, interference, power consumption By the Iteration of one hop shortening, we can shorten any hop route as possible. Applicable to previous routing protocols. Simple. DoCoMo 成果発表

19. Evaluation by simulation Simulation Parameters 1500 m x 300 m, flat field, 50 mobile nodes. Speed uniformly distributed between 0 – 20 m/sec. Constant Bit Ratio UDP traffic (512 packet). Five runs with different mobility scenarios Variable The number of traffic sources Node Mobility Model (& Node Pause Time) Evaluation Metric Average Data Packet Delay Packet Delivery Ratio (PDR) Normalized routing overhead

20. Classified Mobility Models 1. Random Way-Point Mobility 2. Our Random Oriented Mobility Makes some node congestion points. This model is favorable for OR2. 3. Our Random Escape Mobility Makes some network partition areas intentionally. Heavy loads to OR2. dst

21. Random Oriented Mobility Model Core NodesOriented Nodes 1 2 3 4 5 6 Random Escape Mobility Model Core NodesEscape Nodes 1 2 3 4 5 6 2 3 4 5 6 1

22. Evaluation: 10 sources Avg. Delay Routing Overhead Packet Delivery Ratio

23. Evaluation: 30 sources Avg. Delay Routing Overhead Packet Delivery Ratio

24. Evaluation: in Oriented Mobility Avg. Delay Routing Overhead Packet Delivery Ratio

25. Simulation Results Summary 1. OR2 improves the end-to-end delay as expected and reduces the routing control packet overhead effectively. 2. In the packet delivery ration (PDR) of light traffic load scenario, OR2 loses about 5 % packets. 3. In heavy traffic loads, OR2 has the highest performance of PDR. 4. AODV with OR2 does not show the improved performance as salient as DSR with OR2. 5. In our Random Oriented Mobility, we can see that the improved delay reduction is significant.

26. Implementation in our testbed As an extension to DSR on FreeBSD- 4.4R SNR (from NIC driver) monitoring module OR2 routing table to maintain the upstream two-hop-away node’s information OR2 control packet for path shortening Using MELCO 802.11b NICs DoCoMo 成果発表

27. Latency of Path Shortening Shortening time is the order of 10 ms. It is suitable for slow mobility (pedestrians and slow vehicle) Ａ ＢＣ ＣＢ Ａ Evaluation DoCoMo 成果発表

28. Future Works Simulation analysis. Development of Signal power and supplemental location information based Wireless Routing Protocol in our testbed (iPAQs running Linux). Design of Transport protocol for Ad Hoc Networks. Simulation evaluation in popular 802.11b & 802.11a wireless LAN environments (in this work, we used 802.11[2Mbps] wireless LAN Network). DoCoMo 成果発表

29. Today’s Summary We proposed Proximity-based Re-Routing Algorithm for Mobile Ad Hoc Networks. OR2 dynamically shortens active paths based on the proximity. Previously proposed routing protocols (e.g., DSR & AODV) were effectively enhanced by OR2. OR2 remarkably reduced the routing packet overhead and data packet latency.

30. Publications M. Saito, H. Aida, Y. Tobe, Y. Tamura, and H. Tokuda "A Dynamic Path Shortening Scheme in Ad Hoc Networks", 情報 処理学会 マルチメディア通信と分散処理ワークショップ (DPS) 、 2001 年１０月、 Winner of the Best Presentation Award and Winner of the Young Researcher’s Award M. Saito, H. Aida, Y. Tobe, Y. Tamura, and H. Tokuda "OR2: A Path Tuning Algorithm for Routing in Ad Hoc Network”, IEEE LCN on Wireless Local Networks (WLN), Tampa, FL, Nov. 2001. DoCoMo 成果発表

31. FIN Masato Saito, Tokuda Lab., Keio Univ. DoCoMo 成果発表

33. Multi Hop Shortening

34. Evaluation: 10 sources Avg. Delay Routing Overhead Packet Delivery Ratio

35. Evaluation: in Escape Mobility Avg. Delay Routing Overhead Packet Delivery Ratio