1. Page 1 Approximately Maximum Bandwidth Routing for Slotted Wireless Ad Hoc Networks Approximately Maximum Bandwidth Routing for Slotted Wireless Ad Hoc Networks Jianping LI August 29, 2008 WAKAHARA Laboratory Information Technology Center The University of Tokyo E-mail: li@cnl.k.u-tokyo.ac.jp

2. Page 2 2 Routing protocol for Maximum bandwidth Research Objective

3. Page 3 3Outline 1. Introduction 3.1 Difference 1 from DSR ----- RREP(Route REPly) 3.2 Difference 2 from DSR ----- Information of time slots 3.3 Difference 3 from DSR ----- Bandwidth estimation 5. Conclusion and Future Work 3. MB(Maximum Bandwidth)-DSR 2. DSR(Dynamic Source Routing Protocol) 1.1 Ad hoc networks 2.2 TDMA(Time Division Multiple Access)-based ad hoc networks 4. Evaluation by Simulation

4. Page 4 4Outline 1. Introduction 3.1 Difference 1 from DSR ----- RREP(Route REPly) 3.2 Difference 2 from DSR ----- Information of time slots 3.3 Difference 3 from DSR ----- Bandwidth estimation 5. Conclusion and Future Work 3. MB-DSR 2. DSR(Dynamic Source Routing Protocol) 1.1 Ad hoc networks 1.2 TDMA(Time Division Multiple Access)-based ad hoc networks 4. Evaluation by Simulation

5. Page 5 Department of Computer Science, University of Cyprus No base stations Easy and low-cost to establish a network 1. Introduction 1.1 Ad hoc networks

6. Page 6 –Ad hoc networks offer unique benefits and versatility for certain environments and certain applications – One of the most promising terminal networks in future communications 1. Introduction 1.1 Ad hoc networks

7. Page 7 For complex multimedia applications Ad hoc conditions Earthquake War Much bandwidth is necessary. Multihop Mutual interference 1. Introduction 1.1 Ad hoc networks

8. Page 8 Slotted wireless ad hoc networks Contention-based protocols in ad hoc networks 1. Introduction 1.2 TDMA-based ad hoc networks

9. Page 9 For networks with heavy load carrying mixed traffic Deterministic scheduling Collision-free packet transmission 1. Introduction 1.2 TDMA-based ad hoc networks

10. Page 10 10Outline 1. Introduction 3.1 Difference 1 from DSR ----- RREP(Route REPly) 3.2 Difference 2 from DSR ----- Information of time slots 3.3 Difference 3 from DSR ----- Bandwidth estimation 5. Conclusion and Future Work 3. MB-DSR 2. DSR(Dynamic Source Routing Protocol) 1.1 Ad hoc networks 1.2 TDMA(Time Division Multiple Access)-based ad hoc networks 4. Evaluation by Simulation

11. Page 11 2. DSR(Dynamic Source Routing Protocol) DSR : Route Discovery and Route Maintenance A B C D E (A)(A.B) (A.B.C) (A.B.C.D) RREQ

12. Page 12 12Outline 1. Introduction 3.1 Difference 1 from DSR ----- RREP(Route REPly) 3.2 Difference 2 from DSR ----- Information of time slots 3.3 Difference 3 from DSR ----- Bandwidth estimation 5. Conclusion and Future Work 3. MB-DSR 2. DSR(Dynamic Source Routing Protocol) 1.1 Ad hoc networks 1.2 TDMA(Time Division Multiple Access)-based ad hoc networks 4. Evaluation by Simulation

13. Page 13 3. MB-DSR Objective: To select the route of maximum bandwidth from many routes in order to transfer data for the application. To select the route of maximum bandwidth from many routes in order to transfer data for the application. R: the number of total routes between node S and node D

14. Page 14 All the RREQs are forwarded as far as the destination node and all the RREPs are generated by the destination node and returned to the source node. When route request packets are transferred, the information of time slots is gathered to the destination node. Route selecting of maximum bandwidth by destination node 3. MB-DSR --- Characteristics

15. Page 15 3. MB-DSR 3.1 Difference 1 from DSR --- RREP

16. Page 16 3. MB-DSR 3.2 Difference 2 from DSR --- Information of time slots Data structure of RREQ in MB-DSR

17. Page 17 3. MB-DSR 3.2 Difference 2 from DSR --- Information of time slots Data structure of RREQ in DSR

18. Page 18 Step 1: To estimate the bandwidth of every route stored in the destination node. w i = min (t/3,g i ) t: the number of total time slots in every link; g i : the number of free time slots in the bottleneck link of route r i ; bottleneck link: the link with the minimum number of free time slots in a route Step 2: To find the largest estimated bandwidth BE by destination node. If there are U(U>1) routes of largest bandwidth BE, go to Step 3. Step 3: To assign the time slots for U routes in order to get every bandwidth c j (j=1,…,U) of these routes assigned by SAGO-D. 3. MB-DSR 3.3 Difference 3 from DSR --- Bandwidth estimation where Let BA = max c j, j=1,…,U BA: Route Bandwidth by MB-DSR

19. Page 19 19Outline 1. Introduction 3.1 Difference 1 from DSR ----- RREP(Route REPly) 3.2 Difference 2 from DSR ----- Information of time slots 3.3 Difference 3 from DSR ----- Bandwidth estimation 5. Conclusion and Future Work 3. MB-DSR 2. DSR(Dynamic Source Routing Protocol) 1.1 Ad hoc networks 1.2 TDMA(Time Division Multiple Access)-based ad hoc networks 4. Evaluation by Simulation

20. Page 20 4. Evaluation by Simulation Slots: 16 Hops: 8

21. Page 21 Iterative calculation in Zhus routing protocol Chenxi Zhu and M. Scott Corson, Bandwidth Calculation in a TDMA-based Ad Hoc Network, University of Maryland, 2001 4. Evaluation by Simulation

22. Page 22 22Outline 1. Introduction 3.1 Difference 1 from DSR ----- RREP(Route REPly) 3.2 Difference 2 from DSR ----- Information of time slots 3.3 Difference 3 from DSR ----- Bandwidth estimation 5. Conclusion and Future Work 3. MB-DSR 2. DSR(Dynamic Source Routing Protocol) 1.1 Ad hoc networks 1.2 TDMA(Time Division Multiple Access)-based ad hoc networks 4. Evaluation by Simulation

23. Page 23 The route of maximum bandwidth can be found by MB-DSR, which has the following characteristics: All the RREQs are forwarded as far as the destination node and all the RREPs are generated by the destination node and returned to the source node. When route request packets are transferred, the information of time slots is gathered to the destination node. Route selecting of maximum bandwidth by destination node 5. Conclusion and Future Work Future work: Improvement of bandwidth estimation of every route.

24. 24 Thanks for your attention.