c
 
c c

c
 cc
  c
 
!
  
  
 
   
Y
 



 Y
  Y
 


Y Y YY !

"#$%
! !#$&##
'(
)**Y +#$#,",-

!' *Y
Y*..*
 




c
 
c    c

 
    
  
 c 
   
  


   !" !#
 


w To review the multicast extension of AODV.
w To obtain background knowledge on wireless
network.
w To enhance and improve knowledge regarding
data communication.
 m 


Ad-hoc network
routing
protocols

Table driven/ On demand/

Hybrid
proactive reactive

ABR DSR TORA

DSDV WRP
AODV MAODV ZRP
CGSR STAR
CBRP
 m 
Multicast routing is more challenging in ad hoc
networks compared to wired networks due to
the dynamic topology changes in the network
[12]. This is due to several reasons and some
which are:
w ‘ode motion and wireless propagation
variability
w Wireless network bandwidth limitation
w Limited node energy resources available.
 m 

3Multicast Ad Hoc On Demand Distance Vector protocol)
w  is a single transmission of a message to a specific group of destination
computers simultaneously from the source creating copies automatically in other
network elements. Differ with broadcast.

w    is a collection of nodes that communicate with each other without
fixed infrastructure [7] Ad hoc is Latin meaning "for this purpose." Ad hoc networks
therefore refer to networks created for a particular purpose.

w !" according to [4], is defined as reacting to changes in the environment

`
 when necessary. An on-demand protocol or reactive protocol establishes routes
between nodes only when they are required to route data packets.

w !   # uses the Bellman-Ford algorithm to calculate paths.
It requires that a router informs its neighbors of topology changes periodically.
 MAODV Advantages
w Discovers Multicast routes on demand and purposely
used by mobile nodes in an ad hoc network.
w It offers quick adaptation to dynamic link conditions,
low processing and memory overhead and low
network utilization [10].
w Moreover, MAODV creates bi-directional shared
multicast trees connecting multicast sources and
receivers.
Can move forward or backward or duplex communication
system where a system composed of two connected
parties or devices that can communicate with one another
in both directions.
  m



Êxploits four types of messages.

w The Route Requests 3RRÊ s)
w Route Replies 3RRÊPs)
w Multicast Activation 3MACTs)
w Group Hellos 3GRPHs)
 Sending a RRÊ

` Consult its Group Leader Table, based on entry

` Set ͚J͛ if node wishes to join the multicast group
` If nodes not know leader, Dest. address = Address of
Multicast Group & broadcast RRÊ without MGLÊx
` If nodes knows leader, place group leaders address in
MGLÊx & unicast to next hop to the destination

MGLÊx = Multicast Group Leader Êxtension

= ‘ode issuing request to join

 Receiving a RRÊ

` ‘ode checks ͞J͟ flag, if set

` ‘ode can only respond if it is a member of Multicast
tree of MG or node͛s MGS‘ > MGS‘ in RRÊ

` If ͞J͟ flag not set

` ‘ode can only respond if it has unexpired route to MG
and node͛s MGS‘ > MGS‘ in RRÊ
MGL = Multicast Group Leader
‘ode issuing request to join
 Waiting for a RRÊP

` ‘ode waits for RRÊP

` May resend RRÊ up to RRÊ
RÊTRIÊS additional times
` If no RRÊP within RRÊP
WAIT
TIMÊ of unicast RRÊ to
leader, node broadcast subsequent RRÊ s for MG.
` If RRÊP not received after RRÊ
RÊTRIÊS, assume no
other members in group , so it then becomes MGL 3if
wanting to join group) or drop packet and abort
session. MGL = Multicast Group Leader
‘ode issuing request to join
 Control Route Request Broadcast
w Prevent unnecessary boadcast of RRÊ s
Source node use expanding ring search technique
w After RRÊP received, Hop Count to group leader in RRÊP
packet is remembered as the Last Hop Count, LHC in
that nodes routing table
w When require new route to this Multicast Group, RRÊ
IP header͛s TTL = initially set to LHC + TTL
I‘CRÊMʑT
w Thus, TTL incremented by TTL
I‘CRÊMʑT until
TTL
THRÊSHOLD reached.
  

  
m 



 
!"m  

!

w The core of the MAODV protocol is about how to

form the tree, repair the tree when a link is
broken, and how to merge two previously
disconnected tree into a new tree.
w All members of a multicast group are formed into
a tree
w The root of the tree is the group leader.
w Multicast data packets are propagated among the
tree.
w There are four types of packets in MAODV: RRÊ ,
RRÊP, MACT and GRPH.
` A node broadcasts a RRÊ when
` it is a member node and want to join the tree
` it is a non-member node and has a data packet targeted to the
group.
` When a node in the tree received RRÊ , it responses with RRÊP using
unicast.
` Since RRÊ is broadcasted, there may be multiple RRÊPs received by
the originating node.
` The originating node should select one RRÊP that has the shortest
distance to the tree and unicast a MCAT along the path to set up a new
branch to the tree.
` GRPH is the group hello packet, it is periodically broadcasted by group
leader to let the nodes in the tree to update its distance to the group
leader.
  

m
 
Ô
 
            
     
     


 
 
         
    

  !
 

      
         
 


" #$$#             

                

% 
 
  

 
 # 

CLICK MÊ
My Compilation
 MAODV: Comparison with ROMA‘T
w c
        
w 
           
  %
w           

   %        &'   

%           
 
 
%       
    

(%     &'  )     

% 
     %        &'  

    *+

Figure 12: Packet Delivery Ratio Vs Mobility

 MAODV: Comparison Graphs
w ROMA‘T is hardly affected by the number of senders. The
performance of MAODV is very similar to ROMA‘T's, and is not
affected by the number of senders, given that it is a shared-tree
approach. *+

Figure 13: Control Packet Overhead Vs Mobility

 MAODV: Comparison Graphs
MAODV shows a very good performance but for 40 members, the
multicast tree becomes too susceptible to perceived link breakages
caused by either mobility or packets not being received due to
contention in the channel. The effects of high mobility are high control
packet overhead due to repeated Repair RRÊ floods, and low packet
delivery ratio due to a broken multicast tree.
*+

]$%&' !( ")*

 MAODV: Comparison Graphs
w At higher traffic loads, more hello packets are lost, which leads routers
to assume that more links break, even though no link breakages
actually occur since there is no mobility in the scenario. This activates
the MAODV repair mechanism, and most of the Repair RRÊ 's in
MAODV end up being flooded throughout the network. In turn, this
aggravates the congestion, which results in more apparent link breaks
and more Repair RRÊ floodings. As a result, control packet overhead
shoots up, and packet delivery ratio plummets. *+

Figure 15: Packet Delivery Ratio Vs Traffic Load.

 MAODV: Problem [22]
w Through the analysis, it leads to the belief that
MAODV's #+)   is its
greatest limitation. The fact that nodes believe
that links are being broken indicates that the
network is operating in stress mode and
MAODV responds with RRÊ , RRÊP and MACT
packets. As a result,
w many RRÊ packets may be flooded if a RRÊP
packet is not received soon enough.
MAODV: Performance continued͙
w The injection of these packets may in fact lead to
more apparent link breaks due to the loss of
more hello packets in collisions, which in turn
leads to the injection of more RRÊ , RRÊP and
MACT packets, in an attempt to fix these new link
breaks.
w As a result of this cyclic nature of congestion,
there is sharp decrease in packet delivery ratio
and a sharp increase in control overhead as the
network crosses a certain ͞stress threshold͟.
  


*"# ,*,*-!!(, "Robust Tree-based Multicasting in
Ad hoc ‘etworks,"  ` 
 
` 
`   `  `
 
`

 `

 
` ` pp. 647-652 2004.

In ROMA‘T 3Robust Multicasting in Ad hoc ‘etworks

using Trees), nodes receiving core announcements
from two cores simply disregard the messages from
the core with the lower address. Êventually, the core
with a lower address receives the core announcement
from the core with a higher address and stops core
announcements. This kind of merging is called ͞passive
merging͟ as opposed to the ͞active merging͟ of
MAODV.
 #

w The objectives are achieved which are:
w To review the multicast extension of
AODV.
w To obtain background knowledge on
wireless network.
w To enhance and improve knowledge
regarding data communication.
 Hands On Simulation on ‘S2
w !" !.
w http://kunz-pc.sce.carleton.ca/Thesis/maodv-code.zip
w http://kunz-pc.sce.carleton.ca/Thesis/maodv-scripts.zip
w http://kunz-pc.sce.carleton.ca/Thesis/maodv-ns-2.26.pdf
w Getting the write Tool : ‘s-allinone
 References
w [1] S. Sethi and S. K. Udgata, "An Êfficient Multicast Hybrid Routing Protocol for MA‘ÊTs," in  `

`  `   

. vol. 70, V. V. Das

, Êds., ed:
Springer Berlin Heidelberg, 2010, pp. 22-27.
w [2] 32010, ‘`

‘
`  
 ‘
` ``
` . Available: http://www.novell.com/info/primer/prim08.html
w [3] ljinsong. 32007,  ! `
``
  . Available: http://code.google.com/p/typecast-routing/wiki/MAODVOverView
w [4] D. A. Maltz, "On-Demand Routing in Multi-hop Wireless Mobile Ad Hoc ‘etworks,"
w p. 180, 2001.
w [5] K. Higgins

 "`‘
` . Available: http://ntrg.cs.tcd.ie/undergrad/4ba2.05/group11/index.html#10
w [6] Z. SURYADY, "PÊRFORMA‘CÊ STUDY OF MULTICAST ROUTI‘G PROTOCOL OVÊR MA‘ÊT," degree of Master of Science in Computer and Information Êngineering,
International Islamic University Malaysia, 2008.
w [7] Ê. M. Belding-Royer

, "IFIP/IÊÊÊ Sixth Conference on Mobile and Wireless Communications," in `#
  
`

 
`  
` , ed, 2005.
w [8] j. r. ram ramanathan 32002) a brief overview of ad hoc networks: challenges and direction.  `

 
`   [50th Anniversary Commemorative Issue]. 20.
w [9] C. Perkins

, "Ad hoc on demand distance vector 3AODV) routing," 
 
 
2000.
w [10] Ê. Royer and C. Perkins, "Multicast Ad hoc On- Demand Distance Vector 3MAODV) Routing," 2000.
w [11] Ê. M. Royer and C. Ê. Perkins, "Multicast Ad hoc On-Demand Distance Vector 3MAODV) Routing," 2000.
w [12] J. G. Jetcheva and D. B. Johnson, "A Performance Comparison of On-Demand Multicast Routing Protocols for Ad Hoc ‘etworks,"  
$`
%%%&'(2004.
w [13] C. Perkins and Ê. Royer. 32000, 
 
 
`
.
w [14] L. Klein-Berndt, "A uick Guide to AODV Routing.," ed. ‘ational Institute of Standards and Technology. US Department of Commerce.
w [15] S. Roy

, "Securing MAODV: attacks and countermeasures," in  `  "``

 
`  ‘
` )  ‘))`  
 
`

 
` ` 
`   ` , 2005, pp. 521-532.
w [16] Y. Zhu and T. Kunz, "MAODV Implementation for ‘S-2.26 " Systems and Computing Êngineering, Carleton University, Technical Report SCÊ-04-01,2004.
w [17] S. Fekry. 32008,  !




` `  %**. Available: http://mailman.isi.edu/pipermail/ns-users/2008-July/063355.html
w [18] V. Luthra. 32007,  !`` ‘+. Available: http://mailman.isi.edu/pipermail/ns-users/2007-October/061473.html
w [19] J. Broch

, "A performance comparison of multi-hop wireless ad hoc network routing protocols,"  ` `
,`
 
- 
 
` 
`   
` `#
`

 ‘
`  1998.
w [20] Ê. M. Royer and C. Ê. Perkins, "Multicast Operation of the Ad-hoc On-Demand Distance Vector Routing Protocol,"  ` `
)
 
- 
 
` 

`   ` `#
`

 ‘
`  ./0++1pp. 207 - 218, August 1999.
w [21] R. Manoharan and Ê. Ilavarasan, "Impact of Mobility on the performance of multicast routing protocol in MA‘ÊT," 
 
` 
2` 
`3 
4`#
‘
` vol.
2, 2010.
w [22] R. Vaishampayan and J. J. Garcia-Luna-Aceves, "Robust Tree-based Multicasting in Ad hoc ‘etworks,"  ` 
 
` 
`   `  `
 `


 `

 
` ` pp. 647-652 2004.
w [23] R. Vaishampayan, "ÊFFICIʑT A‘D ROBUST MULTICAST ROUTI‘G I‘ MOBILÊ AD HOC ‘ÊTWORKS," PHD, University Of California, Santa Cruz
w 2006.
w [24] W. A. Mobaideen

 32007, Performance evaluation of multicast ad hoc on-demand distance vector protocol. Available: www.elsevier.com/locate/comcom
w [25] T. Kunz and Ê. Cheng, "Multicasting in Ad-Hoc ‘etworks: Comparing MAODV and ODMRP,"  ` `
3` `` ``

 
` 2001.
w [26] M. B. Krishna and M. ‘. Doja, "Performance of Structure Based Multicast Routing Protocols in Wireless Ad hoc ‘etworks," &&
 
 
` 
`   ` 
`

   `

`  `
`2010.
w [27] A. Anttila, "Multicast routing with AODV Routing protocol, Cygate ‘etworks."