1. Designing Routing Protocol For Mobile Ad Hoc Networks Navid NIKAEIN Christian BONNET EURECOM Institute Sophia-Antipolis France

2. Introduction, Routing Design Issues, DDR Basic Idea, Impact of DDR on RP, Conclusion Contents  Introduction  Routing Design Issues Through a Classification  DDR - Distributed Dynamic Routing Algorithm  Impact of DDR on Routing Protocols  Conclusion & Future Work

3. Introduction Def. : Mobile ad hoc network is a set of wireless mobile nodes forming dynamic autonomous networks. Limits: No infrastructure, mobility, bandwidth,.... Introduction, Routing Design Issues, DDR Basic Idea, Impact of DDR on RP, Conclusion

4. Routing  Routing: finding an optimal path from src to dest.  I. Routing core functionality:  Assembling and distributing network and user traffic state information,  Generating and selecting feasible and even optimal routes based on user and network state information,  Forwarding user traffic along the selected route,  Maintaining of the selected route.  II. Routing characteristics:  Main: Desirable: Introduction, Routing Design Issues, DDR Basic Idea, Impact of DDR on RP, Conclusion Convergent, Loop-free, Dynamic, Distributed, Scalable. Fast route establishment, Multiple routes selection, Efficient bandwidth/energy utilization, Fast adaptability to link changes.

5. Routing  III. Routing State: Static Quasi-Static Dynamic  IX. Routing System: Centralized Decentralized Distributed  X. Circuit-Switching vs. packet-Switching Introduction, Routing Design Issues, DDR Basic Idea, Impact of DDR on RP, Conclusion

6. Classification Introduction, Routing Design Issues, DDR Basic Idea, Impact of DDR on RP, Conclusion

7. Routing Philosophy Introduction, Routing Design Issues, DDR Basic Idea, Impact of DDR on RP, Conclusion  Flooding: + Simple + Multiple Paths to destination -- High Overhead -- Lower reliability of data delivery : --Because of broadcast behavior of flooding  Network properties : + Rate of topology changes  -- # of nodes in the network  -- # of communication   Table-driven: + Delay  -- Communication overhead  -- Storage requirements  -- Complexity   Network properties : -- Rate of topology changes  + # of communication  -- # of nodes in the network 

8. Routing Philosophy Introduction, Routing Design Issues, DDR Basic Idea, Impact of DDR on RP, Conclusion  On-demand: + Communication overhead  + Simple -- Not optimal bandwidth utilization -- Delay   Network properties : + Rate of topology changes  -- # of node in the network  -- # of communication   Hybrid: Better trade-off ! + Simplex: Simple + Complex + Better trade-off between communication overhead and Delay  Network properties : + Rate of topology changes  + # of communication 

9. Routing Architecture Introduction, Routing Design Issues, DDR Basic Idea, Impact of DDR on RP, Conclusion  Flat : Simple Flexible  Scalability   Optimal bandwidth utilization  Network properties : Rate of topology changes   # of nodes in the network   # of communication   Hierarchical : Physical or logical Communication overhead   Localization Scalability  Storage requirements   Single point of failure  Complexity   Network properties :  Rate of topology changes  # of nodes in the network  # of communication 

10. Routing Architecture Introduction, Routing Design Issues, DDR Basic Idea, Impact of DDR on RP, Conclusion  Aggregate or 2-level hier.: Better trade-off !  Simplex: Simple + Complex  Flexible  Scalable  Network properties :  Rate of topology changes   # of nodes in the network   # of communication 

11. Routing Physical Information Introduction, Routing Design Issues, DDR Basic Idea, Impact of DDR on RP, Conclusion  GP : Routing performance  Useful for certain situation  Indoor problem  Cost / energy   Complexity  Reliability is subject to GPS  GPL : Strong Infrastructure-less Cost / energy Simple   Useful for certain situation  rescue group after a disaster 

12. Synthesis  Complexity  Simplexity  Simplicity Multimode routing protocol via a tunable hybridization degree Introduction, Routing Design Issues, DDR Basic Idea, Impact of DDR on RP, Conclusion

13. Basic Idea Network Topology Forest TREE TREE …. TREE ZONE ZONE …. ZONE DDR Introduction, Routing Design Issues, DDR Basic Idea, Impact of DDR on RP, Conclusion

14. Preliminary Definitions Beacon Intra-zone table Inter-zone table ZID NID NID_DEG MY_PN PN NID Learned_PN GNID NZID Z_Stability Introduction, Routing Design Issues, DDR Basic Idea, Impact of DDR on RP, Conclusion

15. Different Phases of DDR Network topology Preferred neighbor election Beacon Forest construction Intra-tree clustering Inter-tree clustering Zone naming Beacon Zone partitioning Introduction, Routing Design Issues, DDR Basic Idea, Impact of DDR on RP, Conclusion Time

16. DDR-Infrastructure Introduction, Routing Design Issues, DDR Basic Idea, Impact of DDR on RP, Conclusion NID Learned_PN f a, b, q, y, t, x c - d - NID Learned_PN y x, t k c, d b, a, q - INTRA-ZONE TABLE OF NODES k AND f NID NZID Z_Stability r z4 ++ g z5 ++ INTER-ZONE TABLE OF NODE d DDR

17. DDR Goal Introduction, Routing Design Issues, DDR Basic Idea, Impact of DDR on RP, Conclusion Offer a multimode routing infrastructure to the routing protocols regarding application requirements and network properties.

18. Performance Analysis  Packet delivery ratio  Average E2E delay  Routing overhead (bytes) Introduction, Routing Design Issues, DDR Basic Idea, Impact of DDR on RP, Conclusion AADDR: AODV + ABR + DDR –Hybrid, aggregate, GPL DSDV: –Proactive, flat, GPL DSR: –Reactive, flat, GPL  ? Among these protocols:  Under three metrics:

19. simulation Model Traffic model –CBR –512byte/packet –4packet/s –Sources = 10, 20, 30 Movement model –50 nodes –1500m*300m –0-20m/s –900 simulated second –Pause time = 0, 30, 60, 120, 300, 600, 900 –10 scenarios for each pause time Introduction, Routing Design Issues, DDR Basic Idea, Impact of DDR on RP, Conclusion

20. simulation Model Wireless environment in ns- 2 –MAC: IEEE 802.11 (Distributed Coordination Function) –Radio model r = 250 m 2Mb/sec –Interface Queue (IFq) FIFO priority queue Routing packets have higher priority than traffic packets Link failure detection –feedback from MAC Introduction, Routing Design Issues, DDR Basic Idea, Impact of DDR on RP, Conclusion

21. Packet Delivery Ratio Introduction, Routing Design Issues, DDR Basic Idea, Impact of DDR on RP, Conclusion  Better than DSDV: Source can initial route discovery Lower arm node can run partial route discovery  Worse than DSR:  Partial route discovery  Upper arm node can’t run partial route discovery

22. Average E2E Delay  Low Load case: DDR has the shortest E2E Proactive  Less delay for route discovery Reactive  Less waiting time in queue for a new route  High load case: No great difference  Congestion  Tree Structure Introduction, Routing Design Issues, DDR Basic Idea, Impact of DDR on RP, Conclusion

23. Routing Overhead  Low Mobility Case: Significantly lower RO than DSDV and DSR Beacon for tree construction and maintenance Aggregate Architecture  High mobility case: Increase RO toward DSR  # of beacon increase for tree maintenance  Zone stability decrease  DDR acts as reactive approach Introduction, Routing Design Issues, DDR Basic Idea, Impact of DDR on RP, Conclusion

24. Conclusion and Future Work Introduction, Routing Design Issues, DDR Basic Idea, Impact of DDR on RP, Conclusion  We present a synthesis of ad hoc routing protocol through two classifications.  We derive the notion of hybridization degree which should be tuned to satisfy both application requirements and network properties.  DDR is presented as a way to provide a multimode routing infrastructure for mobile ad hoc networks.  In future, we address the mapping between hybridization degree and application requirements.

25. Metrics vs. network properties Introduction, Routing Design Issues, DDR Basic Idea, Impact of DDR on RP, Conclusion  Three main Network Properties :  # of communication  # of nodes in the networks  Rate of topology changes  Evaluation of each class under four metrics regarding network properties:  Delay  Communication overhead  Scalability  Simplicity vs. complexity Appropriate  Good trade-off  Not recommended Legend of grade