1 / 30

Simulation of Ant Routing Protocol for Ad-hoc networks in NS-2

MSc thesis presentation. Simulation of Ant Routing Protocol for Ad-hoc networks in NS-2. FJ Arbona Bernat E-mail: <f.j.arbonabernat@student.tudelft.nl>. Supervisor: prof.dr.ir. P.F.A. Van Mieghem Mentor: ir. S.S. Dhillon Advisor: dr.ir. F.A. Kuipers. November 22, 2006.

halle
Télécharger la présentation

Simulation of Ant Routing Protocol for Ad-hoc networks in NS-2

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. MSc thesis presentation Simulation of Ant Routing Protocol for Ad-hoc networks in NS-2 FJ Arbona Bernat E-mail: <f.j.arbonabernat@student.tudelft.nl> Supervisor: prof.dr.ir. P.F.A. Van Mieghem Mentor: ir. S.S. Dhillon Advisor: dr.ir. F.A. Kuipers November 22, 2006 Faculty of Electrical Engineering, Mathematics and Computer Science Network Architectures and Services Group

  2. Table of Contents Introduction W_AntNet Implementation details Algorithm basic description Simulation results Static scenario Mobile scenario Larger scenario Conclusions and Future Work

  3. Introduction: MANETs (1) Mobile ad-hoc networks (MANETs) are increasing in popularity. Possible applications: Networks amongst defense and civil security staff and their communication devices. Traffic and mobility applications. Domotica and residential networks. Robotics and sensor networks.

  4. Introduction: MANETs (2) Routing protocols should resolve: Lack of fixed infrastructure. Dynamic topologies. Multi-hop. Bandwidth-constrained. Energy-constrained operation. Security issues. Need for scalabability.

  5. Introduction: ant routing (1) Ant routing is a scheme for routing inspired by the behavior of real ants: Ants (control packets) collect information about the network conditions and are used to update and maintain routing tables. Based on swarm intelligence, used to solve complex optimization problems.

  6. Introduction: ant routing (2) How it works: 2 5 1 Src 3 6 2 4 Dst

  7. Introduction: ant routing (3) How it works: 2 5 1 Src 3 6 2 4 Dst

  8. Introduction: ant routing (4) How it works: 2 5 1 Src 3 6 2 4 Dst

  9. Introduction: ant routing (5) How it works: 2 5 1 Src 3 6 2 4 Dst

  10. Table of Contents Introduction W_AntNet Implementation details Algorithm basic description Simulation results Static scenario Mobile scenario Larger scenario Conclusions and Future Work

  11. W_AntNetImplementation details This project involves simulating ant routing protocol for MANETs and comparing its performance with other protocols, like AODV or DSR. Protocol implemented: W_AntNet Derived from AntNet. Neighbor management added. Simulation environment: NS-2

  12. W_AntNetAlgorithm basic description FAs are generated regularly at every node. Each FA: Stores address and arrival time of visited nodes. Chooses next hop. Cycle detection. Once at destination, generates BA. Each BA: Travels same path in opposite direction. Updates routing table and local traffic model. Neighbor management.

  13. Table of Contents Introduction W_AntNet Implementation details Algorithm basic description Simulation results Static scenario Mobile scenario Larger scenario Conclusions and Future Work

  14. Simulation results:Static scenario 10 nodes manually placed. Traffic: 9 connections later increased to 15. Packet size: 64, 128, 512 and 1024 bytes

  15. Simulation results: static scenarioAverage End-to-End Delay

  16. Simulation results: static scenarioPacket Delivery Ratio

  17. Simulation results: static scenarioFA sent only during Training Period

  18. Simulation results: static scenarioFA sent only during Training Period

  19. Simulation results: static scenarioIntroducing random loss

  20. Simulation resultsMobile environment 50 mobile nodes in a 1500x300m2 area. Mobility: Speed: 1 ~ 20 m/s 10 pseudorandom scenarios with 7 pausetimes. Traffic: 10, 20 or 30 CBR sources Rate: 4 pkts/s Packet size: 64bytes Bandwidth radio channel: 2Mbps

  21. Simulation results: mobile scenarioAverage End-to-End Delay

  22. Simulation results: mobile scenarioPacket Delivery Ratio

  23. Simulation results: mobile scenarioHop-count optimality

  24. Simulation results: mobile scenarioRouting overhead

  25. Simulation results: larger scenarioAverage End-to-End Delay

  26. Simulation results: larger scenarioPacket Delivery Ratio

  27. Table of Contents Introduction W_AntNet Implementation details Algorithm basic description Simulation results Static scenario Mobile scenario Larger scenario Conclusions and Future Work

  28. Conclusions High overhead due to route maintenance: Node queues congested. Packets dropped. W_AntNet performance is poor compared to AODV or DSR. FA generation rate is a key parameter. Ant routing well suited for fixed networks with high capacity channels.

  29. Future work Further simulations using another simulator. Try a reactive approach. Do some real benchmarks. Study energy related issues.

  30. Any question? Thank you very much for your attention!

More Related