Overlay Small Group Multicast Mechanism for MANET

  • Uhjin Joung
  • Hong-Jong Jeong
  • Dongkyun Kim
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4217)


In order to provide the multicast service in MANET, a lot of multicast routing protocols have been proposed. Most of them create tree or mesh-based graphs and require network nodes over the tree or mesh to maintain the membership information. In particular, high node mobility causes the tree or mesh to be broken and reconstructed by generating much overhead to manage the membership at network nodes. In accordance with overlay multicast protocols to reduce such overhead, which enables the packet transmission regardless of the movement of intermediate nodes over the paths between group members, we propose an overlay small group multicast mechanism, called SPM (Shortest Path overlay Multicast) for MANET. SPM multicasts packets over the shortest paths from a source to each group member without duplicate packet delivery over common partial paths. When creating a multicast overlay tree, SPM utilizes the route information provided by ad hoc unicast routing protocol without further control messages and any other information. Extensive simulations through NS-2 simulator proved that SPM has better throughput, loss rate and packet transmission delay than MAODV, a typical tree based multicast routing protocol used in MANET.


Short Path Multicast Tree Multicast Group Short Path Tree Partial Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Internet Engineering Task Force, MANET working group charter,
  2. 2.
    Ji, L., Corson, M.: Differential Destination Multicast (DDM) - A MANET Multicast Routing Protocol for Small Groups. IEEE INFOCOM 2001 (April 2001)Google Scholar
  3. 3.
    Chen, K., Nahrstedt, K.: Effective Location-Guided Tree Construction Algorithms for Small Group Multicast in MANET. IEEE INFOCOM 2002 (July 2002)Google Scholar
  4. 4.
    Jeong, H.-J., Joung, U., Kim, D.: Overlay Small Group Multicast Tree Construction Algorithm for MANET. First International Workshop on Network Architecture and Service Models (NASM) 2005, Sanghai (November 2005)Google Scholar
  5. 5.
    Royer, E., Perkins, C.: Multicast Ad hoc On-Demand Distance Vector (MAODV). IETF Internet-Draft, draft-ietf-manet-maodv-00.txt (July 2000)Google Scholar
  6. 6.
    Johnson, D., Maltz, D., Hu, Y.: The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR). IETF Internet Draft, draft-ietf-manet-dsr-10.txt (July 2004)Google Scholar
  7. 7.
    Perkins, C., Belding-Royer, E., Das, S.: Ad hoc On-demand Distance Vector (AODV) routing. RFC 3561, IETF (July 2003)Google Scholar
  8. 8.
    VINT Group, UCB/LBNL/VINT Network Simulator ns (version 2),

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Uhjin Joung
    • 1
  • Hong-Jong Jeong
    • 1
  • Dongkyun Kim
    • 1
  1. 1.Department of Computer EngineeringKyungpook National UniversityDaeguKorea

Personalised recommendations