Presented by:-

Reda Farhan

Outline
Introduction.
Mobile ad-hoc network
E-DSDV
Experimental
Conclusion & Future development

Introduction
The goals :
Understanding of ad-hoc networks.
Study existing routing protocols.
Develop a mechanism that offers advantages
for routing in wireless ad-hoc networks.
Implement the proposal routing protocol.
Compare the proposal protocol with the (
AODV &OLSR) protocols

Introduction
Problem statement
Congestion
Handle mobility
Improve performance
increase throughput.
Decrease delay.
Control overhead traffic.

Mobile ad-hoc network

Collection of wireless mobile Nodes
forming a temporary network without

infrastructure

Routing protocol
The requirement on a routing protocol in
ad hoc network:
Minimum route delay
Quick route configuration
Loop-free routing
Minimum control overhead
Scalability

Routing protocols for Mobile Ad Hoc

Networks
Routing protocols for Mobile Ad
Hoc networks

Table-Driven
(proactive )

OLSR

WRP

On-Demand
(Reactive )

DSDV

CGSR

ZHLS

GSR
FSR

AODV

DSR

TORA

ABR

SSR

Proactive Protocols
Maintain routing information independently of
need for communication.
Update messages send (periodically , network
topology changes).
Low latency.
suitable for real-time traffic.
Bandwidth might get wasted due to periodic
updates.

Reactive Routing

Discover route only when you need it

Saves energy and bandwidth during inactivity
Can be bursty -> congestion during high activity
Significant delay might occur as a result of route
discovery
Good for light loads

AODV

Ad hoc On-Demand Distance Vector

Reactive: Ad-Hoc On-demand
Broadcasts a Route Request Packet (RREQ).
Route table management
AODV maintains routes as long as they are active.

When route fails

Local recovery
Sender repeats a Route Discovery

Path discovery procedure using RREQ/RREP query

cycles.

10

AODV - Route Discovery

F
A
G

RouteRequest

AODV - Route Discovery

F
A
G
Reverse Path Setup
RouteRequest

AODV - Route Discovery

F
A
G
RouteRequest Dropped
Reverse Path Setup
RouteRequest

AODV - Route Discovery

F
A
G
RouteReply
Reverse Path Setup
RouteRequest

AODV - Route Discovery

F
A
G
Forward Route Setup
RouteReply

Reverse Path Setup

AODV - Route Discovery

F
A
G
Forward Route Setup
RouteReply

Reverse Path Setup

AODV - Route Discovery

F
A
G
Forward Route Setup
RouteReply

Reverse Path Setup

OLSR
Optimized Link State Routing Protocol
Proactive
Inherits Stability of Link-state protocol
Selective Flooding
Only MPR (Multipoint Relays) retransmit
control messages:
Minimize flooding

Suitable for large and dense networks

18

24 retransmissions to diffuse
a message up to 3 hops
Retransmission node

11 retransmission to diffuse a
message up to 3 hops
Retransmission node

E-DSDV
The Enhance Destination-Sequenced
Distance-Vector Routing (E-DSDV)
Proactive
Development of DSDV routing
mechanism.
Periodic update
Building a secondary routing table
Presents a solution for congestion

Control & management attributes :

Discovery packet:
size of one word .
Destination

Source

Out-of-range packet:
This packet has size of one word
0

Source

Control & management attributes :

Route Table:
Table format:
#
Node

Node

Next

Com
intermedi

name

number

Node

ltime

tr_factor

Tr_time

port

ate Nodes

Any node has a route table to sending the

packets according to the information in this
table, the route table contains of seven fields.

Control & management attributes :

Identification packet:
o

Node name

Node number

Replay Identification packet:

Neighbors Neighbors
name

number

Node

Node

name

number

Identification scenario

Node (2)

Node (3)

Node
(1)s Route table
Node (1)
Node
number

Node
name

Next Node

Number of
hop

Node
(4)s Route
table
3
Node(3)
Node(3)
1
Node
Number
Next
Number
4
Node(4) Node(4)
1
Node (4)
Node (5)
number
Node
of hop
5
Node(5) Node(5)
1
1
2

Node(1)
Node(2)

Node(1)
Node(2)

11

Identification scenario

Node
(3)
Node (8)

Node Node
Node
Next
(4)s Route
table Number
number
name
Node
of hop
Node
Node
Next
Number
4
Node(4)
Node(8) Node 1
number
name
Node (2) of hop
1
1
3
3
2
2
5
5
Node
8

(1)

Node (4)

Node(1)
Node(1)
Node(3)
Node(3)
Node(2)
Node(2)
Node(5)
Node(5)
Node(8)

Node(4)
Node(4)
Node(4)
Node(4)
Node(4)
Node(4)
Node(4)
Node(4)
Node(4)

2
2
3
3
3
3
3
3
1

Node (5)

Discovery packet

Forward Discovery packet

Befor sendSend
data packet
failed Packet
Send Discovery packet

Second Table
When use
Failure occurs in the interface which
makes the path unusable.
A failure of one of the Nodes used
as an intermediary to transmit data.
A jam in the next Node .

Second Table
Data

If
found

Compare
If best

Save to table

If equal
metric

Update time
End

Congestion
B

Header

Data

80

70

A
102

Node (B) s Route table

111

Node

Node

Next

# int.

Com

name

number

Node

Nodes

port

90

10

Tr_

Tr_

factor

time

***

***
***

ltime

***G

***

***

105

F1

***

3
***

1:20:3.35633

70

***

10
***

1:20:3.35632
1:20:3.35632

DF

90

105

***

***

***

10

70

***

***

***

102

111

D
105

***
***

Congestion
B

80

70

A
102
10

Node (B) s Route table

Com
Tr_ Route
Tr_table
Node (B) s Second
ltime90
Nodes
Com
Node portNode
Next factor
# int. time
1
name 6number ***Node ***
Nodes ***port

Node

Node

Next

name

number

Node

102

C 111

111

105 1

105

70

D1

90

105

***

***

***

10

70

***

***

***

# int.

E
F
G

7
9

70

***105F ***

90

*** 70

10

***105

10

***

G
ltime
***

1:20:3.35633

***

1:20:3.35632

***

8
9

Experimental
Experimental Environments
Visual Basic V6 .
The max number of Nodes used (7).
Experimental time 91 milliseconds .
Packet size 4096bits .
Data rate 560000 bits per Sec.
Pause time is 7 msec.
The routing protocol (AODV, OLSR, EDSDV).

Experimental Environments
The network topology is represented in figure
below
B

80

70

A
102
10
90

111

105

Experimental Results
The effect of congestion
The effect of Node and link Failure
The effect of Mobility

The effect of congestion

B

80

70

Node (E) has

congestion

A
102
10
90

111

105

Using AODV

The effect of congestion

B

80

70

Node (E) has

congestion

A
102
10
90

111

105

Using OLSR

The effect of congestion

B

80

70

Node (E) has

congestion

Node (B) s Second Route table

102

111

105

Node

Node

Next

# int.

Com

name

number

Node

Nodes

10port

70

105

***

90
90

70

***

10

105

***

ltime

Using E-DSDV

The effect of congestion

The effect of congestion

Normalized Routing Load

The effect of Node and link Failure

RERR

80

70

Node (E) has

problem

A
102
10

RREQ
90

111

105

F
RREQ

Using AODV

The effect of Node and link Failure

B

80

70

Node (E) has

problem

A
102
10
90

111

105

Using OLSR

The effect of Node and link Failure

B

80

70

Node (E) has

problem

A
102
10
90 (B) s Second Route table
Node

111

Using E-DSDV

105

Next

# int.

Com

number

Node

Nodes

port

70

105

***

90

70

***

10

105

***

Node

Node

name

ltime

The effect of Node and link Failure

The effect of Node and link Failure

The effect of Mobility

B

80

70

Using AODV

A
102
10
90

111

105

The effect of Mobility

B

80

70

Using OLSR

A
102
10
90

111

105

The effect of Mobility

B

80

70

Using E-DSDV

A
102
10
Node (B) s Second Route table
Node

Node

Next

# int.

Com

name

number

Node

Nodes

port

105

90
111

111

90

102

10

90
ltime

***

***

C90

***

90

***

105

The effect of Mobility

The effect of Mobility

Conclusion
This thesis provides a solution to extended
of Mobile Ad-hoc Network.
The E-DSDV protocol has been designed
& implement to support Multi-hop Ad-hoc
Network.
E-DSDV is using an additional factor to
minimize the end to end delay that caused
by congestion.

Features developments
Enhancement of E-DSDV to support a real
time and multimedia traffic.
Jjjkh

Paper (ICCSN 2013-N025)

2013 the 5th International Conference on
Communication Software and
Networks(ICCSN 2013)
8-9 June, 2013 in Kuala Lumpur, Malaysia
Organized by IACSIT, Journal of
Advances in Computer Networks(JACN).
International Association of Computer
Science and Information Technology.