World Academy of Science, Engineering and Technology

International Journal of Electronics and Communication Engineering

Vol:5, No:5, 2011

Analysis of Delay & Throughput in MANET for

DSR Protocol
Kumar Manoj, Ramesh Kumar, Kumari Arti

the network as proposed in Figure.2 in which 30 nodes have

Abstract—A wireless Ad-hoc network consists of wireless nodes been taken for the analysis with four mode of operation as
communicating without the need for a centralized administration, in shown in Table1
which all nodes potentially contribute to the routing process.In this
paper, we report the simulation results of four different scenarios for
wireless ad hoc networks having thirty nodes. The performances of
proposed networks are evaluated in terms of number of hops per
International Science Index, Electronics and Communication Engineering Vol:5, No:5, 2011 waset.org/Publication/62

route, delay and throughput with the help of OPNET simulator.

Channel speed 1 Mbps and simulation time 600 sim-seconds were
taken for all scenarios. For the above analysis DSR routing protocols
has been used. The throughput obtained from the above analysis
(four scenario) are compared as shown in Figure 3. The average
media access delay at node_20 for two routes and at node_20 for four
different scenario are compared as shown in Figures 4 and 5. It is
observed that the throughput will degrade when it will follow
different hops for same source to destination (i.e. it has dropped from Fig. 1 Ad hoc networking example
1.55 Mbps to 1.43 Mbps which is around 9.7%, and then dropped to
0.48Mbps which is around 35%). # 
!# "!

Keywords—Throughput, Delay, DSR, OPNET, MANET, DSSS Scenario No. of Route

Hopes
First Three Between node_20 to
I. INTRODUCTION node_1
Second Five Between node_20 to









 node_1











Third Six Between node_20 to



 A collection of autonomous nodes or terminals node_1
that communicate with each other by forming a multihop radio Fourth Seven Between node_20 to
network and maintaining connectivity in a decentralized node_1
manner is called an ad hoc network. There is no static
infrastructure for the network, such as a server or a base "
)&&)1#(!
-2-.'
*,'.,-
,
.%(
),
."
station. The idea of such networking is to support robust and -#'/&.#)(
)
&&
."
)0
-(,#)
.
"((&




efficient operation in mobile wireless networks by








 )'*,.#0 -./#-
incorporating routing functionality into mobile nodes. Figure.1 )
."
-#'/&.#)(
,-/&.-
),
."-
*,'.,-
,
&-)
,*),.
shows an example of an ad hoc network, where there are #
/',
)
")*-
*,
,)/.
numerous combinations of transmission areas for different ##
&2
nodes. From the source node to the -.#(.#)(
()
.",
( ###
",)/!"*/.

#

,(.
*."-
)
)((.#)(
.

!#0(
*)#(.
)
.#'
/.
"
()
/-/&&2
"-

&#'#.
,
)
.,(-'#--#)(
-
-")1(
#( #!/,

2
."
)0& #,&
,)/(
"
()


-)/,
( 
 ),
."#-
*,).))&
)
."
-.
)
)/,
%()1&!
0,2
)(&2
.,(-'#.
.
.)
() B
/. B (
.,(-'#.
.
#.",
.)

),  .
#-

"&&(!#(!
.-%
.)
"))-

,&&2
!))
,)/.
.)
-.&#-"
."
)((.#)(
.1(

-)/,
(

-.#(.#)(
-)
.".
."2
(
,)'
,)/(
(
.,(-'#.
,)/-.
)''/(#.#)(
In this paper, OPNET simulator [3] has been used to simulate
 )&,

&-)
-#'/&.
."#-
*,).))&
/(,

,)/.#(!
*,).))&-
*,)*)-
2  
"-
(
)0
(&2-#-

0&/.
&&
0#&&
'.,#- -/**),.
2
1
**,-
,
,*),.
#(
."
&#.,./,
1"#"
)'*,-
."
-#'/&.#)(
,-/&.-
1#."
# ,(.
-(,#)
,*),.
#(
."#-
**,
"#-
1),%
#-
."
)(
)
."
'$),
)'*,"(-#0
*, ),'(
0&/.#)(
)

")
,)/.#(!
*,).))&-
/-#(!

#

,(.
&)-
(/',
)
()-
#(

(.1),%
(
-")1
Dr. Kumar Manoj is with the Graphic Era University, Dehradun INDIA
(phone: 9634258502; e-mail: manoj2555@gmail.com).
Dr. Ramesh Kumar, is with NIT Patna, Patna INDIA. He is now with the
Department of Electrical Engg., INDIA (e-mail: rknitpatna@yahoo.com).
Kumari Arti is with the Electrical Engineering Department, NIT Patna,

6
<12;
8*8.:
<1.
;25=4*<276
:.;=4<;

INDIA, INDIA (e-mail: er.arti22@gmail.com)
International Scholarly and Scientific Research & Innovation 5(5) 2011
."#,
),,-*)(#(!
*, ),'(
#

,(-6
".,<276
*
;=55*:A
7/
<1.
-
17,
:7=<260
8:7<7,74;
1*>.
+..6
:.87:<.-
#1.
;25=4*<276
;7/<?*:.
*6-
<1.
6.<?7:3
;25=4*<276
;.<=8
*:.
-.;,:2+.-
26
;.,<276
,76,4=;276
1*;
+..6
:.87:<.-
26
;.,<276 
 
:.;8.,<2>.4A
681 scholar.waset.org/1307-6892/62
 World Academy of Science, Engineering and Technology
International Journal of Electronics and Communication Engineering
Vol:5, No:5, 2011

To insert images in Word, position the cursor at the
insertion point and either use Insert | Picture | From File or
copy the image to the Windows clipboard and then Edit | Paste
Special | Picture (with “Float over text” unchecked).
II. ADHOC ROUTING PROTOCOL
)-.
1#&2
/-
,)/.#(!
*,).))&-
),
1#,&--

")
(.1),%-
/-
#(


-#'/&.),
0#&&
.#&&
.)2
,
Although the DSR protocol supports unidirectional routes,
IEEE 802.11 requires an RTS/CTS/Data/ACK exchange for
all unicast packets, limiting the routing protocol to using only
bidirectional links in delivering data packets. We implemented
DSR to discover only routes composed of bidirectional links
by requiring that a node return all ROUTE REPLY messages
to the requestor by reversing the path over which the ROUTE
REQUEST packet came. If the path taken by a ROUTE
REQUEST contained unidirectional links, then the
 


-.#(.#)(
-+/(
#-.(
0.),
corresponding ROUTE REPLY will not reach the requestor,

(



")
,)/.#(!
*,).))&-

&&
."-
preventing it from learning the unidirectional link route. In
*,).))&-
,
)(-.(.&2
#(!
#'*,)0
2


#(
Route Discovery, a node first sends a ROUTE REQUEST with
."-
*,).))&-
"0
#

,(.
",.,#-.#-
."
)'*,#-)(
the maximum propagation limit (hop limit) set to zero,
)
&&
*, ),'(
#

,(.#&-
#-
().
&12-
*)--#& 
,)/.#(!
*,).))&-
"-
(
/-
),
."
*,-(.
(&2-#-
International Science Index, Electronics and Communication Engineering Vol:5, No:5, 2011 waset.org/Publication/62
A. Dynamic Source Routing (DSR)
DSR [4,5,6] uses source routing rather than hop-by-hop
routing, with each packet to be routed carrying in its header
the complete, ordered list of nodes through which the packet
must pass. The key advantage of source routing is that
intermediate nodes do not need to maintain up-to-date routing
information in order to route the packets they forward, since
the packets themselves already contain all the routing
decisions. This fact, coupled with the on-demand nature of the
protocol, eliminates the need for the periodic route
advertisement and neighbor detection packets present in other
protocols.
B. Basic Mechanisms
The DSR protocol consists of two mechanisms: Route
Discovery and Route Maintenance. Route Discovery is the
mechanism by which a node S wishing to send a packet to a
destination D obtains a source route to D. To perform a Route
Discovery, the source node S broadcasts a ROUTE REQUEST
packet that is flooded through the network in a controlled
manner and is answered by a ROUTE REPLY packet from
either the destination node or another node that knows a route
to the destination. To reduce the cost of Route Discovery,
each node maintains a cache of source routes it has learned or
overheard, which it aggressively uses to limit the frequency
and propagation of ROUTE REQUESTs. Route Maintenance
is the mechanism by which a packet’s sender S detects if the
network topology has changed such that it can no longer use
its route to the destination D because two nodes listed in the
route have moved out of range of each other. When Route
Maintenance indicates a source route is broken, S is notified
with Table 2 Constants used in the DSR simulation. Time
between retransmitted ROUTE REQUESTs (exponentially
backed off) 500 ms Size of source route header carrying n
addresses 4n + 4 bytes Timeout for nonpropagating search 30
ms Time to hold packets awaiting routes 30 s Max rate for
sending gratuitous REPLYs for a route 1/s a ROUTE ERROR
packet. The sender S can then attempt to use any other route to
D already in its cache or can invoke Route Discovery again to
prohibiting its neighbors from rebroadcast it. At the cost of a
single broadcast packet, this mechanism allows a node to
query the route caches of all its neighbors for a route and also
optimizes the case in which the destination node is adjacent to
the source. If this no propagating search times out, a
propagating ROUTE REQUEST is sent. Nodes operate their
network interfaces in promiscuous mode, disabling the
interface’s address filtering and causing the network protocol
to receive all packets that the interface overhears. These
packets are scanned for useful source routes or ROUTE
ERROR messages and then discarded. This optimization
allows nodes to learn potentially useful information, while
causing no additional overhead on the limited network
bandwidth. Furthermore, when a node overhears a packet not
addressed to itself, it checks the unprocessed portion of the
source route in the packet’s header. If the node’s own address
is present, it knows that this source route could bypass the
unprocessed hops preceding it in the route. The node then
sends a gratuitous ROUTE REPLY message to the packet’s
source, giving it the shorter route without these hops. Finally,
when an intermediate node forwarding a packet discovers that
the next hop in the source route is unreachable, it examines its
route cache for another route to the destination. If a route
exists, the node replaces the broken source route on the packet
with the route from its cache and retransmits the packet. If a
route does not exist in its cache, the node drops the packet and
does not begin a new Route Discovery of its own. Table 2 lists
the constants used in our DSR simulation.
TABLE II
CONSTANTS USED IN THE DSR SIMULATION
Time between retransmitted ROUTE 500m
REQUESTs (Exponentially backed off)
Size of source route header carrying n 4n+4Bytes
addresses
Timeout for nonpropagating search 30ms
Time to hold packets awaiting routes 30s
Max rate for sending gratuitous REPLYs for a 1/s
route
III. SIMULATION SETUP
 #
;25=4*<7:
2;
=;.-
<7
,76;<:=,<
57-.4;
/7:
<?7
-2//.:.6<
8=:87;.;
<7
;<=-A
;A;<.5
+.1*>27:
*6-
8.:/7:5*6,.

6.<?7:3
57-.4
5*A
,76<*26
*6A
6=5+.:
7/
,755=62,*<260
find a new route. Implementation Decision Using the .6<2<2.;
,*44.-
67-.;
*;
;17?6
26 20=:. 
7-.
57-.4;
suggestions from the published description of DSR [4,5,6] we ,76;2;<
7/
57-=4.;
*6-
,766.,<276;
 #
;=887:<;
have optimized our implementation in a number of ways.

International Scholarly and Scientific Research & Innovation 5(5) 2011 682 scholar.waset.org/1307-6892/62
 World Academy of Science, Engineering and Technology
International Journal of Electronics and Communication Engineering
Vol:5, No:5, 2011

8:.-./26.-
;<*<2;<2,;
<1*<
*:.
<A82,*44A
7/
26<.:.;<
26
;25=4*<276
;<=-2.;
'(
A. Network Model Overview
6
<1.
8:.;.6<
?7:3
<1.
6.<?7:3
57-.4

*;
8:787;.-
26
20=:.
,76;2;<; 7/
<12:<A
67-.;
?12,1
26,4=-.;
*6
8842,*<276
*6-
*
:7/24.
./262<276

#1.
8:787;.-
6.<?7:3
57-.4
*6-
"!
8:7<7,74
2;
<*3.6
/7:
>*42-*<276
*6-
,758*:2;76
7/ <1:7=018=<
*6-
-.4*A#1.
,1*66.4
;8..-
7/
<1.
&
2;
;.<
<7

+8;
*6-
;25=4*<276
<25.
2;
<*3.6


;25
;.,
#1.
8842,*<276
*6-
:7/24.
./262<276
*:.
=;.-
<7
-./26.
<1.
<A8.
7/
<:*//2,
;.6<
+.<?..6
<1.
67-.;
6
<12;
?7:3
<1.;.
*:.
,76/20=:.-
<7
;.6-
#
<:*//2,
#1.
<1:7=018=<
+.<?..6
<?7
67-.;
2;
5.*;=:.-
+A
0.6.:*<260
#
8*,3.<;
/:75
<1.
76. 67-.
*6-
;.6-260
<1.5
<7
<1.
*67<1.:
67-.
#1. 20
 "25=4*<276
;.<=8 /7:
<1.
8:787;.-
6.<?7:3
TABLE IV
<1:7=018=<
2;
,*4,=4*<.-
+*;.-
76
<1.
<25.
;25;.,
*6-
-.4*A TCP PARAMETER
International Science Index, Electronics and Communication Engineering Vol:5, No:5, 2011 waset.org/Publication/62

2;
,*4,=4*<.-
+*;.-
76
<1.
-2;<*6,.
#1.
;25=4*<276
;<=-A Maxm ACK Delay(sec) 0.200
,76;2;<;
7/
/7=:
;,.6*:27;
*;
;17?6
26
#*+4.
 Slow start initial count (MSS) 4
Duplicate ACK Threshold 3
B. Network Environment Fast Recovery Reno







 Physical RTT Gain 0.125
Characteristics, Packet Reception Power Threshold etc. are Deviation gain 0.25
RTT Deviation Coefficient 4.0
given in Table 3 The TCP parameter like Maxm ACK
Delay(sec), Slow start initial count (MSS), Duplicate ACK #1.
;25=4*<276
:.;=4<;
*:.
7+<*26.-
/7:
<1.
/7=:
;,.6*:27
Threshold etc. are given in Table 4. 5.6<276.-
26
#*+4.
 20=:.

;17?;
*
,758*:2;76
7/
<1.
*>.:*0.
7/
<1.
<1:7=018=<
<1.
;25=4*<276
<25.
/7:
,758*:2;76
IV. SIMULATION RESULT AND ANALYSIS 7/

/7=:
-2//.:.6<
;,.6*:27;
*;
:.87:<.-
26
#*+4.

#1.
<78
#1.
;25=4*<276;
*:.
,*::2.-
7=<
/7:

<1:7=018=<
*6-
-.4*A ,=:>.
,7::.;876-;
<7
<1.
/2:;<
;,.6*:27
?1.:.
<1:..
178;
.@2;<
/7:
*44
<1.
;,.6*:27
*;
:.87:<.-
*+7>.
26
<1.
#*+4.

*+7>. +.<?..6 67-.)

*6-
67-.)
#1.
;.,76-
,=:>.
:.4*<.;
<7
<1.
#1.
>*:2*<276
26
<1:7=018=<
26
*44
<1.
;,.6*:27
*:.
;17?6
26 ;.,76-
;,.6*:27
6
<12;
;,.6*:27
/2>.
178; .@2;<
+.<?..6
20=:.
 44
;25=4*<276;
:=6
/7:


;25;.,76-;
#1. 67-.)

*6-
67-.)
#1.
<12:-
,=:>.
;17?;
<1.
:.;=4<;
/7:
<1.
<1:7=018=<
7+<*26.-
/:75
<1.
*+7>.
*6*4A;2;
/7=:
;,.6*:27 <12:-
;,.6*:27
?1.:.
;2@
178;
.@2;<
+.<?..6 67-.)

*6-
*:.
,758*:.-
*;
;17?6
26 20=:.
 67-.)
#1.
+7<<75
,=:>.
,7::.;876-;
<7
<1.
/7=:<1
;,.6*:27
#
 ?1.:.
;.>.6
178;
.@2;<
+.<?..6 67-.)

*6-
67-.)
#1.
"$#
%!# 0:*81
26 20=:.

;17?;
<1.
*>.:*0.
<1:7=018=<
*<
67-.)

Area 300m * 300m

/7:
<1.
<?7
:7=<.;
<
2;
,4.*:
/:75
<1.
0:*81
26 20=:.

<1*<
Physical Characteristics DSSS
.>.6
<17=01
<1.
6=5+.:
7/
178;
26
<1.
;.,76-
:7=<.
/2>.
Packet Reception Power Threshold 7.33 E-14
178;
2;
4.;;
<1.6
<1.
6=5+.:
7/
178;
26
<1.
/2:;<
:7=<.
;2@
178;
<1.
*>.:*0.
<1:7=018=<
2;
;5*44.:#1.
;.,76-
;.<
7/
Buffer Size 25600
;,.6*:27;
-.*4;
?2<1
26,:.*;260
<1.
6=5+.:
7/
67-.;
<:A260
<7
Fragmentation Threshold 1024
,755=62,*<.
;25=4<*6.7=;4A
?2<1
76.
67-.
#1.
0:*81
26
Data Rate 2 Mbps
20=:.

;17?;
<1.
*>.:*0.
<1:7=018=<
*< 67-.)

/7:
/7=:
Node Speed 10m/s
-2//.:.6<
;,.6*:27;
#1.
<78
,=:>.
,7::.;876-;
<7
<1.
;,.6*:27
?1.:.
764A 67-.)

2;
,755=62,*<260
?2<1
67-.)
<1.
#1.
*>.:*0.
5.-2*
*,,.;;
-.4*A
*<
67-.)

/7:
<?7
:7=<.; *>.:*0.
>*4=.
2;
*+7=< +8;
#1.
;.,76-
,=:>.
*6-
*< 67-.)

/7:
/7=:
-2//.:.6<
;,.6*:27
*:.
,758*:.-
*; ,7::.;876-;
<7
<1.
;,.6*:27
?1.:.
/7=:
67-.;
*:.
<:A260
<7
;17?6
26 20=:.:; 
*6-

#1.
;,*4.
=8
6.<?7:3
57-.4 ,755=62,*<.
;25=4<*6.7=;4A
?2<1 67-.)

<1.
*>.:*0.
>*4=.
,76;2;<;
7/
<12:<A
67-.;
-2;<:2+=<.-
:*6-754A
26
*
;8*,.
7/ 2;
*:7=6-
 +8;
#1.
<12:-
,=:>.
:.8:.;.6<;
<1.
*>.:*0.

5
@

5
#1.
,1*66.4
;8..-
7/
<1.
?2:.4.;;

2;
*4;7 <1:7=018=<
/7:
<1. ;,.6*:27
?1.:.
/2>.
67-.;
*:.
;.6-260
;.<
<7

+8;
6
<12;
6.<?7:3
;75.
7/
<1.
67-.;
*:.
/2@.-
*6- <:*//2,
;25=4<*6.7=;4A
<7 67-.)

<1.
>*4=.
1.:.
2;
*:7=6-
;75.
*:.
57>260
?2<1
<1.
;8..-
7/

5 ; 20=:.

2;
*
+8;
#1.
+7<<75
,=:>.
,7::.;876-;
<7
<1.
;,.6*:27
;6*8;17<
7/
<1.
8:787;.-
6.<?7:3
57-.4
,76;2-.:
/7: ?1.:.
;.>.6
67-.;
*:.
,755=62,*<260
;25=4<*6.7=;4A
?2<1
;25=4*<276
#1.
/2:;<
;.<
7/
;,.6*:27;
-.*4;
?2<1
*--260
57:. 67-.)

<1.
*>.:*0.
>*4=.
1.:.
2;
*:7=6-

 +8;
<
2;
:.4*A
67-.;
+.<?..6
;7=:,.
*6-
-.;<26*<276 ,4.*:
/:75
<1.
0:*81
26 20=:.
<1*<
<1.
57:.
67-.;
*:.
<:A260
<7
,755=62,*<. ;25=4<*6.7=;4A
?2<1
<1.
;*5.
67-.
<1.
4.;;
<1.
<1:7=018=<
?244
+.
4;7
2<
2;
67<2,.*+4.
<1*<
<1.
-:78
2;
426.*:
2.
2<
1*;
-:788.-
/:75
+8;
<7

+8;
?12,1
2;
*:7=6- 
*6-
<1.6
-:788.-
<7

+8;
?12,1
2;
*:7=6-

International Scholarly and Scientific Research & Innovation 5(5) 2011 683 scholar.waset.org/1307-6892/62
 World Academy of Science, Engineering and Technology
International Journal of Electronics and Communication Engineering
Vol:5, No:5, 2011

#1.
0:*81
26 20=:.

;17?;
<1.
*>.:*0.
-.4*A
*< Seven Hops
Six Hops
67-.)

/7:
<1.
<?7
:7=<.;
#1.
<78
,=:>.
26-2,*<.
<1*<
*>.:*0. Five Hops
5 Three Hops
-.4*A
+.<?..6
;7=:,.
<7
-.;<26*<276
,7::.;876-;
<7
<1.
/2>.
4
178;
:7=<.
<1.
+7<<75
,=:>.
,7::.;876-;
/7:
<1.
/7=:
178;
:7=<.
#7
,1.,3
<1.
.//.,<
7/
<1.
;206*4
;<:.60<1
76
<1.

Time (Sec
3
<1:7=018=<
67-.)

2;
07260
<7
57>.
*?*A
/:75
67-.)
*6-
2
<:A
<7
,766.,<
<7
67-.) <1:7=01
67-.)
1

Three Hops 0
Five Hops 0 96 0 8 8 7 8 5 7 0
250000 S ix Hops 18 37 49 53 56 57 58 60
S even Hops Simulation Time
200000
Average Throughu

20
 >.:*0.
-.4*A
*<
67-.)

/7:
/7=:
-2//.:.6<
;,.6*:27;
150000

100000 V.CONCLUSION
50000 6
<12;
8*8.:
<1.
8.:/7:5*6,.
7/
?2:.4.;;
-17,
6.<?7:3;
International Science Index, Electronics and Communication Engineering Vol:5, No:5, 2011 waset.org/Publication/62

0
1*;
+..6
;<=-2.-
<1:7=01
 #
;25=4*<7:
*6-
<1.
:.;=4<;
*:.
0 60 12
0
18
0
24
0
30
0
36
0
42
0
48
0
54
0 ,758*:.-
#1.
:.;=4<;
:.87:<.-
26
<12;
8*8.:
;=00.;<;
*
426.*:
T im e (s im -s e c) -:78
26
<1.
<1:7=018=<
*< 67-.)

?124.
57>260
<7?*:-;
67-.)
?2<1
:.0*:-
<7
<1.
6=5+.:
7/
67-.;
<1*<
*:.
<:A260
<7
20
>.:*0.
<1:7=018=<
,758*:2;76
+.<?..6
<1.
/7=:
;,.6*:27; ;25=4<*6.7=;4A
,766.,<
<7
<1.
;*5.
-.;<26*<276
#12;
;<=-A
1*;
*4;7
;17?6
<1*<
?1.6
<1.
;206*4
;<:.60<1
+.<?..6
;7=:,.
*6-
-.;<26*<276
2;
67<
;<:760
.67=01
:7=<260
<1.
<:*//2,
<1:7=01
*6
26<.:5.-2*:A
67-.
,*6
4.*-
<7
1201.:
>*4=.;
7/
<1:7=018=<
6
;=,1
*
;2<=*<276
<1.
26,:.*;.-
4*<.6,A
26<:7-=,.-
+A
*6
26<.:5.-2*:A
67-.
6..-;
<7
+.
67<.-<
1*;
+..6
7+;.:>.-
<1*<
*/<.:
<1.
;25=4*<276

<1:7=018=<
-.,:.*;.;
*;
<1.
67
7/
178.;
26,:.*;.;
*;
;17?6
26 20=:.

755=62,*<276
+.<?..6
;7=:,.
<7
-.;<26*<276
<1:7=01

178;
?244
-.,:.*;.
<1.
<1:7=018=<
+A
 
755=62,*<276
+.<?..6
;7=:,.
<7
-.;<26*<276
<1:7=01

178;
?244
-.,:.*;.
<1.
<1:7=018=<
+A


755=62,*<276
+.<?..6
;7=:,.
<7
-.;<26*<276
<1:7=01

178;
?244
-.,:.*;.
<1.
<1:7=018=<
+A
 
&1.:.*;
-.4*A
26,:.*;.;
?1.6
<1.
67
7/
178;
26,:.*;.;
*;
20
 >.:*0.
.-2*
,,.;;
.4*A
*<
67-.)

/7:
<1.
<?7
:7=<.; ;17?6
26 20=:.

755=62,*<276
+.<?..6
;7=:,.
<7
-.;<26*<276
<1:7=01

178;
?244
26,:.*;.;
<1.
-.4*A
+A

<
2;
,4.*:
/:75
<1.
0:*81
26 20=:.

<1*<
<1.
6=5+.:
7/ 755=62,*<276
+.<?..6
;7=:,.
<7
-.;<26*<276
<1:7=01

178;
178;
26
<1.
;.,76-
:7=<.
/7=:
178;
2;
4.;;
<1.6
<1.
6=5+.:
7/ ?244 26,:.*;.;
<1.
-.4*A
+A
755=62,*<276
+.<?..6
178;
26
<1.
/2:;<
:7=<.
/2>.
178;
<1.
*>.:*0.
-.4*A
2;
;5*44.: ;7=:,.
<7
-.;<26*<276
<1:7=01

178;
?244
26,:.*;.;
<1.
-.4*A
#12;
2;
-=.
<7
<1.
/*,<
<1*<
<1.
;206*4
9=*42<A
+.<?..6
67-.)
+A

*6-
67-.)
2;
;<:760.:
<1*6
<1.
76.
+.<?..6
67-.)

*6- REFERENCES
67-.)
#1.
;.,76-
;.<
20=:.
7/
;,.6*:27;
-.*4;
?2<1 [1] E. Celebi, “Performance evaluation of wireless multi-hop adhoc network
26,:.*;260
<1.
6=5+.:
7/
67-.;
<:A260
<7
,755=62,*<. routing protocols,” http://cis.poly.edu/~ecelebi/esim.pdf.
;25=4<*6.7=;4A
?2<1
76.
67-.#1.
0:*81
26 20=:.

;17?; [2] Kumar Manoj, S.C. Sharma, Sandip Vijay and Amit Dixit
“Performances Analysis of Wireless Ad-hoc Network Using OPNET
<1.
*>.:*0.
-.4*A
*< 67-.)

/7:
/7=:
-2//.:.6<
;,.6*:27; #1. Simulator “ International Conference on “Intelligent Systems and
<78
,=:>.
,7::.;876-;
<7
<1.
;,.6*:27
?1.:.
764A 67-.)

2; Networks” ISN-2008 ISTK Haryana, 22-24th 2008, 267-270 Feb. 2008.
,755=62,*<260
?2<1
67-.)
<1.
>*4=.
1.:.
2;
*:7=6-
; [3] OPNET Modeler, http://www.opnet.com
#1.
;.,76-
,=:>.
,7::.;876-;
<7
<1.
;,.6*:27
?1.:.
/7=: [4] David B. Johnson. Routing in ad hoc networksof mobile hosts. In
Proceedings of the IEEE Workshop on Mobile Computing Systems
67-.;
*:.
<:A260
<7
,755=62,*<.
;25=4<*6.7=;4A
?2<1
67-.)
andApplications, pages 158–163, December 1994.
<1.
>*4=.
1.:.
2;
*:7=6-
;
#1.
<12:-
,=:>.
:.8:.;.6<;
<1. [5] David B. Johnson and David A. Maltz. Dynamic source routing inad
*>.:*0.
<1:7=018=< /7:
<1.
;,.6*:27
?1.:.
/2>.
178.; *:. hoc wireless networks. In Mobile Computing, edited by Tomasz
;.6-260
<:*//2,
;25=4<*6.7=;4A
<7
67-.)
<1.
>*4=.
1.:.
2; Imielinski and Hank Korth, chapter 5, pages 153–181. Kluwer
*:7=6-
;
#1.
+7<<75
,=:>.
,7::.;876-;
<7
<1.
;,.6*:27 Academic Publishers, 1996.
[6] Josh Broch, David B. Johnson, and David A. Maltz. The Dynamic
?1.:.
;.>.6
178.; *:.
,755=62,*<260
;25=4<*6.7=;4A
?2<1 Source Routing Protocol for Mobile Ad Hoc Networks. Internet-Draft,
67-.)
<1.
*>.:*0.
>*4=.
1.:.
2;
*:7=6-
;
<
2;
,4.*:
/:75 draft-ietf-manet-dsr-00.txt, March 1998. Work in progress.
<1.
0:*81
26 20=:.

<1*<
<1.
57:.
67-.;
*:.
<:A260
<7 [7] A.K. Jain, S.C. Sharma, Kumar Manoj, R. Jha “Effect of Congestion on
,755=62,*<.
;25=4<*6.7=;4A
?2<1
<1.
;*5.
67-.
?12,1
:.;=4<; the Global Performance of IEEE 802.11 Network” International
Conference on “Intelligent Systems and Networks” ISN-2008 ISTK
4.;;
<1.
-.4*A Haryana, 22-24th 2008, 231-235 Feb. 2008.

International Scholarly and Scientific Research & Innovation 5(5) 2011 684 scholar.waset.org/1307-6892/62