1 / 42

Simple Ant Routing Algorithm Strategies for MANET

Simple Ant Routing Algorithm Strategies for MANET. Fernando Correia and Teresa Vazão Portuguese Naval Academy, 葡萄牙海軍學院. Ad Hoc Networks 2010. Outline. Introduction and Goals. Simple Ant Routing Algorithm (SARA). Performance Evaluation. Conclusions. Outline. Introduction and Goals.

wirt
Download Presentation

Simple Ant Routing Algorithm Strategies for MANET

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Simple Ant Routing Algorithm Strategies for MANET Fernando Correia and Teresa Vazão Portuguese Naval Academy,葡萄牙海軍學院 Ad Hoc Networks 2010

  2. Outline Introduction and Goals Simple Ant Routing Algorithm (SARA) Performance Evaluation Conclusions

  3. Outline Introduction and Goals Simple Ant Routing Algorithm (SARA) Performance Evaluation Conclusions

  4. Introduction • The growth of mobile devices and wireless networking • Made MANETs a popular research topic • Providing ubiquitous access to information • Enabled a wide variety of applications and services

  5. Introduction • A generalized dissemination is constrained imposed by • Limited bandwidth • The nodes can move randomly • Highly variable quality of the transmission path

  6. Introduction • Routing in MANETs is a major research issue • Allow the network to offer a good service • Robust, reliable and efficient • Low cost • As simple as possible

  7. Introduction • Many routing proposals have appeared • Broadcast • Table-driven • Demand-driven • Hybrid strategy • Opportunistic Routing

  8. Introduction • Many routing proposals have appeared • Broadcast • Increase the overhead and the congestion and will cause extra power consumption • Table-driven • Demand-driven • Hybrid strategy • Opportunistic Routing

  9. Introduction • Many routing proposals have appeared • Broadcast • Table-driven • Worse network performance to keep the network topology up-to-date. • Makes them particularly less adequate for use in MATs • Demand-driven • Hybrid strategy • Opportunistic Routing

  10. Introduction • Many routing proposals have appeared • Broadcast • Table-driven • Demand-driven • Require the use of a significant amount of control information during the route discovery process. • Hybrid strategy • Opportunistic Routing

  11. Introduction • Many routing proposals have appeared • Broadcast • Table-driven • Demand-driven • Hybrid strategy • The overhead associated with the path discovery is high. • Opportunistic Routing

  12. Introduction • Many routing proposals have appeared • Broadcast • Table-driven • Demand-driven • Hybrid strategy • Opportunistic Routing • Topology knowledge is required • The overhead of this process increases significantly when nodes’ mobility increases.

  13. Goals • Proposed a Routing Algorithm for MANETs • Reducing the overhead • Does not use any sort of extra information • Optimal performance • Dynamically adapted according to the traffic conditions

  14. Outline Introduction and Goals Simple Ant Routing Algorithm (SARA) Performance Evaluation Conclusions

  15. Simple Ant Routing Algorithm (SARA) SARA Route Selection Route Repair Route Discovery Route Maintenance Route Discovery Route Maintenance Route Selection Route Repair

  16. Simple Ant Routing Algorithm (SARA) SARA Route Selection Route Repair Route Discovery Route Maintenance

  17. Controlled Neighbor Broadcast (CNB) The number of times previously selected The cost of link u→ji The probability to choose node ji as the next hop. u A J1 FANT Route Discovery Route Maintenance Route Selection Route Repair J2 S J0 d J3 B J4

  18. Controlled Neighbor Broadcast (CNB) u A J1 FANT Route Discovery Route Maintenance Route Selection Route Repair J2 S J0 d J3 B J4

  19. Controlled Neighbor Broadcast (CNB) u A J1 FANT Route Discovery Route Maintenance Route Selection Route Repair J2 S J0 d J3 B J4

  20. Controlled Neighbor Broadcast (CNB) u A J1 BANT Route Discovery Route Maintenance Route Selection Route Repair J2 S J0 d J3 B J4

  21. Controlled Neighbor Broadcast (CNB) S j2 j0 B A u d FANT_1 FANT_1 Time FANT_1 C_FANT_1 C_FANT_1 T1 FANT_1(2) T0 FANT_1(2) C_FANT_1(2) FANT_2 BANT_1 FANT_2 BANT_1 C_FANT_2 C_FANT_2 BANT_1 BANT_1 u A J1 Route Discovery Route Maintenance Route Selection Route Repair J2 S J0 d J3 B J4

  22. Controlled Neighbor Broadcast (CNB) u A J1 Route Discovery Route Maintenance Route Selection Route Repair J2 S J0 d J3 B J4

  23. Controlled Neighbor Broadcast (CNB) 3 1 2 u A J1 0 4 4 2 J2 S J0 d J3 B J4 3 1 2 Route Discovery Route Maintenance Route Selection Route Repair

  24. Simple Ant Routing Algorithm (SARA) SARA Route Selection Route Repair Route Discovery Route Maintenance

  25. u A J1 Route Discovery Route Maintenance Route Selection Route Repair J2 S J0 d J3 B J4

  26. Increase Pheromone intensity (α) Decrease Pheromone intensity (γ) u A J1 Route Discovery Route Maintenance Route Selection Route Repair J2 S J0 d J3 B J4

  27. Increase Pheromone intensity (α) Decrease Pheromone intensity (γ) Pheromone level γ α Route Discovery Route Maintenance Route Selection Route Repair τ1 τ2 τ3 τ4 Time T1 T1 T1 T1 T1 T1 T1 T1

  28. Simple Ant Routing Algorithm (SARA) SARA Route Selection Route Repair Route Discovery Route Maintenance

  29. The number of hops from ji to destination The pheromone level between node u and node ji The link cost The probability to choose node ji as the next hop. 2 4 3 u A J1 5 1 Route Selection Route Discovery Route Maintenance Route Repair 3 J2 S J0 d J3 B J4 2 4 3

  30. Simple Ant Routing Algorithm (SARA) SARA Route Selection Route Repair Route Discovery Route Maintenance

  31. TTL=2 u A J1 R_FANT Route Repair Route Discovery Route Maintenance Route Selection J2 S J0 d J3 B J4

  32. S j2 j0 A u d j1 DATA DATA Time DATA R_FANT R_FANT R_BANT R_BANT DATA DATA DATA DATA u A J1 Route Repair Route Discovery Route Maintenance Route Selection J2 S J0 d J3 B J4

  33. S j2 j0 A u d j1 DATA DATA Time DATA R_FANT R_FANT RRT R_ERROR R_ERROR u A J1 Route Repair Route Discovery Route Maintenance Route Selection J2 S J0 d J3 B J4

  34. Outline Introduction and Goals Simple Ant Routing Algorithm (SARA) Performance Evaluation Conclusions

  35. Performance Evaluation

  36. Performance Evaluation

  37. Performance Evaluation

  38. Performance Evaluation

  39. Performance Evaluation

  40. Outline Introduction and Goals Simple Ant Routing Algorithm (SARA) Performance Evaluation Conclusions

  41. Conclusions • Proposed a Routing Algorithm (SARA) for MANETs • Reducing the overhead • Does not use any sort of extra information • Optimal performance • Dynamically adapted according to the traffic conditions

  42. Wireless & Mobile Network Laboratory (WMNL.) Department of Computer Science and Information Engineering, Tamkang University T h a n k s ~ ~ ~ T T h h a a n n k k s s ~ ~ ~ ~ ~ ~

More Related