Approximately Maximum Bandwidth Routing for Slotted Wireless Ad Hoc Networks

1. 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. Research Objective Routing protocol for Maximum bandwidth

3. Outline 1. Introduction 1.1 Ad hoc networks 2.2 TDMA(Time Division Multiple Access)-based ad hoc networks 2. DSR(Dynamic Source Routing Protocol) 3. MB(Maximum Bandwidth)-DSR 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 4. Evaluation by Simulation 5. Conclusion and Future Work

4. Outline 1. Introduction 1.1 Ad hoc networks 1.2 TDMA(Time Division Multiple Access)-based ad hoc networks 2. DSR(Dynamic Source Routing Protocol) 3. MB-DSR 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 4. Evaluation by Simulation 5. Conclusion and Future Work

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

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

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

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

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

10. Outline 1. Introduction 1.1 Ad hoc networks 1.2 TDMA(Time Division Multiple Access)-based ad hoc networks 2. DSR(Dynamic Source Routing Protocol) 3. MB-DSR 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 4. Evaluation by Simulation 5. Conclusion and Future Work

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

12. Outline 1. Introduction 1.1 Ad hoc networks 1.2 TDMA(Time Division Multiple Access)-based ad hoc networks 2. DSR(Dynamic Source Routing Protocol) 3. MB-DSR 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 4. Evaluation by Simulation 5. Conclusion and Future Work

13. 3.MB-DSR • Objective: • 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. 3.MB-DSR --- 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

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

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

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

18. 3.MB-DSR 3.3 Difference 3 from DSR --- Bandwidth estimation Step 1: To estimate the bandwidth of every route stored in the destination node. wi = min (t/3,gi) t: the number of total time slots in every link; gi: the number of free time slots in the bottleneck link of route ri; bottleneck link: the link with the minimum number of free time slots in a route where 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 cj (j=1,…,U) of these routes assigned by SAGO-D. Let BA = max cj , j=1,…,UBA: Route Bandwidth by MB-DSR

19. Outline 1. Introduction 1.1 Ad hoc networks 1.2 TDMA(Time Division Multiple Access)-based ad hoc networks 2. DSR(Dynamic Source Routing Protocol) 3. MB-DSR 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 4. Evaluation by Simulation 5. Conclusion and Future Work

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

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

22. Outline 1. Introduction 1.1 Ad hoc networks 1.2 TDMA(Time Division Multiple Access)-based ad hoc networks 2. DSR(Dynamic Source Routing Protocol) 3. MB-DSR 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 4. Evaluation by Simulation 5. Conclusion and Future Work

23. 5. Conclusion and Future Work • 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 Future work: Improvement of bandwidth estimation of every route.

24. Thanks for your attention. Questions and advices?