Quality-of-service Multicast Overlay Spanning Tree Algorithms for wireless ad hoc networks

Georgios Rodolakis*, Cédric Adjih, Anis Laouiti, Saadi Boudjit

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

1 Citation (Scopus)

Abstract

In this article, we explore modified versions of Multicast Overlay Spanning Tree algorithms (MOST) to support quality of service for wireless ad hoc networks. These algorithms (Q-MOST) take into account the interferences due to radio transmissions and the residual capacity of the nodes in the network. Different algorithms are compared to the basic MOST algorithm. We show by simulations the ability and superiority of these algorithms to find spanning trees that connect all multicast group members with respect to the bandwidth requirements.

Original languageEnglish
Title of host publicationSustainable Internet - Third Asian Internet Engineenng Conference, AINTEC 2007, Proceedings
Pages226-241
Number of pages16
Volume4866 LNCS
Publication statusPublished - 2007
Event3rd Asian Internet Engineering Conference, AINTEC 2007 - Phuket, Thailand
Duration: 27 Nov 200729 Nov 2007

Publication series

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

Other

Other3rd Asian Internet Engineering Conference, AINTEC 2007
CountryThailand
CityPhuket
Period27/11/0729/11/07

Fingerprint Dive into the research topics of 'Quality-of-service Multicast Overlay Spanning Tree Algorithms for wireless ad hoc networks'. Together they form a unique fingerprint.

Cite this