Implementation Of Ad Hoc Network Routing Algorithm

1
Implementation Of Ad Hoc Network Routing Algorithm
Computer Networks LaboratoryElectrical
Engineering DepartmentTechnion, Haifa, Israel

• Izhar Kadishai
• Adi Raichel
• Instructor Gil Zusman

2
Project description

• Goal
• Implement ad-hoc routing protocol on 802.11b
• peer to peer network
• Environment
• Working in the network layer
• Programming in Java
• Using UDP datagram

3
IEEE 802.11 Protocol

• IEEE standard protocol for Mac and physical
  layers
• enables wireless connectivity for mobile users
• 2 main modes
• 1.Infrastructure networks using a fixed AP
• 2.Ad-hoc networks using peer to peer
  connection.
• Most working systems are in the 1st mode
• We implement the 2nd

4
Ad Hoc Network
5
Mobile Ad Hoc Networks

• A peer-to-peer connection ( Direct connection
  between units in a common zone)
• Dynamic set of stations and links
• Each node operates also as a router in order to
  create connection between distinct units

6
The Routing Problem

• Find the best path from source to destination
• What is best
• How to find it
• Response to changes
• What is the overhead

7
DSDV Algorithm

• In the first part we have implemented the DSDV
  routing algorithm which is a proactive table
  driven algorithm.
• Table driven
• Each node maintains it own routing table and
  routs the packets according to it. The packets
  contain only the destination address. (oppose to
  source routing.)
• Proactive
• The tables are continuously updated, even when
  there is no traffic in the network

8
AODV Algorithm

• In the 2nd part we have implemented the AODV
  algorithm which is a reactive table driven
  algorithm.
• Reactive
• operates only on-demand
• The source node initiates discover protocol
  before
• sending first packet.
• more battery efficient
• less network traffic congestion

9
Project Design
10
Project Design
Sorting Packets The Receiver thread receives all
packets designated to the node and transmit it to
the correct thread according to its
type. Handling Data When a node sends a data
packet, it deliver it to the Data thread that
sends it according to the routing table. The
packets source could be either the node itself or
someone else ( node functions as a router ). If
the final destination is the current node, the
thread handles the data.
11
Project Design
Finding Neighbors By sending hello messages
every node monitors the links with its
neighbors. Handling Topology Table maintains the
routing tables. According to the algorithm (AODV
or DSDV)
12
Project Design
Applications
Network
13
Project Design

• Applications
• Any java application can use the ad-hoc network
  using a simple API.
• For demonstration and testing we wrote two
  different applications
• Instant messages low traffic, multiple nodes
  communication.
• Ftp heavier traffic, with one partner every
  time.

14
Instant messages
15
FTP
Properties
Main Window
Log File