Quality-of-service multicast overlay spanning tree algorithms for wireless ad hoc networks

Georgios Rodolakis 1 Cédric Adjih 1 Anis Laouiti 2 Saadi Boudjit 3
1 HIPERCOM - High performance communication
Inria Paris-Rocquencourt, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR
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.
Document type :
Book sections
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00441930
Contributor : Médiathèque Télécom Sudparis & Institut Mines-Télécom Business School <>
Submitted on : Thursday, December 17, 2009 - 4:16:18 PM
Last modification on : Wednesday, February 6, 2019 - 1:22:07 AM

Links full text

Identifiers

Citation

Georgios Rodolakis, Cédric Adjih, Anis Laouiti, Saadi Boudjit. Quality-of-service multicast overlay spanning tree algorithms for wireless ad hoc networks. Sustainable internet : Third Asian Internet Engineering Conference, AINTEC 2007, Phuket, Thailand, November 27-29, 2007, Springer, pp.226-241, 2007, Lecture Notes in Computer Science, ⟨10.1007/978-3-540-76809-8_20⟩. ⟨hal-00441930⟩

Share

Metrics

Record views

318