1. Project Overview
Comparing the performance of selected different Routing protocols for mobile ad-hoc networks

2. The Project
Comparing the performance of selected different Routing protocols for mobile ad-hoc networks By
Yahal Goldberg
Yaniv Amiel

3. Project Overview
Background and Motivation
The Problem

4. Project Overview Project Aim
Building three deferent Algorithms of Routing Protocols for Mobile Ad-Hoc Networks in order to compare their performance

5. Routing Protocols For Ad Hoc Networks
List location r contact for specification (or other related documents) here

6. Table-Driven Routing Protocols
Attempt to maintain consistent, up-to-date routing information from each node to every other node in the network.
require each node to maintain one or more tables to store routing information, and they respond to changes in network topology by propagating updates throughout the network in order to maintain a consistent network view.

7. Source-Initiated On-Demand Routing Protocols
This type of routing creates routes only when desired by the source node.
When a node requires a route to a destination, it initiates a route discovery process within the network. This process is completed once a route is found or all possible route permutations have been examined.

8. The chosen algorithms
The minimal spanning tree algorithm

9. The chosen algorithms
The Clustering algorithm

10. The chosen algorithms
The K Distance algorithm

11. The GUI

12. Comparing the 3 algorithms
Comparing the 3 algorithms

13. Comparing the 3 algorithms
Comparing the 3 algorithms

14. The End