Multicast overlay spanning tree protocol for ad hoc networks

Georgios Rodolakis*, Amina Meraihi Naimi, Anis Laouiti

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

5 Citations (Scopus)


In this paper we present an extension to the OLSR unicast routing protocol to support multicast routing in mobile ad hoc networks. The proposed protocol is based on Multicast Overlay Spanning Trees (MOST). The main benefits of this approach are twofold. Firstly, it implies that only nodes interested in taking part in the multicast communication need to participate in the protocol operation, which is transparent to other OLSR nodes. In addition, the MOST approach scaling properties achieve the theoretical performance bounds concerning the capacity of multicast communication in massive ad hoc networks. We perform simulations of the MOST protocol under the ns-2 simulator to compare with the theoretical results, and we present a fully working implementation for real network environments.

Original languageEnglish
Title of host publicationWired/Wireless Internet Communications - 5th International Conference, WWIC 2007, Proceedings
Number of pages12
Volume4517 LNCS
Publication statusPublished - 2007
Event5th International Conference on Wired/Wireles Internet Communications, WWIC 2007 - Coimbra, Portugal
Duration: 23 May 200725 May 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4517 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349


Other5th International Conference on Wired/Wireles Internet Communications, WWIC 2007

Fingerprint Dive into the research topics of 'Multicast overlay spanning tree protocol for ad hoc networks'. Together they form a unique fingerprint.

Cite this