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

Georgios Rodolakis; Cédric Adjih; Anis Laouiti; Saadi Boudjit

doi:10.1007/978-3-540-76809-8_20

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

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

INRIA Rocquencourt
Université d'Evry Val d'Essonne
University Paris 13

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

1 Citation (Scopus)

Résumé

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.

langue originale	Anglais
titre	Sustainable Internet - Third Asian Internet Engineenng Conference, AINTEC 2007, Proceedings
Editeur	Springer Verlag
Pages	226-241
Nombre de pages	16
ISBN (imprimé)	9783540768081
Les DOIs	https://doi.org/10.1007/978-3-540-76809-8_20
état	Publié - 1 janv. 2007
Modification externe	Oui
Evénement	3rd Asian Internet Engineering Conference, AINTEC 2007 - Phuket, Thadlande Durée: 27 nov. 2007 → 29 nov. 2007

Série de publications

Nom	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4866 LNCS
ISSN (imprimé)	0302-9743
ISSN (Electronique)	1611-3349

Une conférence

Une conférence	3rd Asian Internet Engineering Conference, AINTEC 2007
Pays/Territoire	Thadlande
La ville	Phuket
période	27/11/07 → 29/11/07

Accès au document

10.1007/978-3-540-76809-8_20

Contient cette citation

Rodolakis, G., Adjih, C., Laouiti, A., & Boudjit, S. (2007). Quality-of-service Multicast Overlay Spanning Tree Algorithms for wireless ad hoc networks. Dans Sustainable Internet - Third Asian Internet Engineenng Conference, AINTEC 2007, Proceedings (p. 226-241). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol 4866 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-76809-8_20

Rodolakis, Georgios ; Adjih, Cédric ; Laouiti, Anis et al. / Quality-of-service Multicast Overlay Spanning Tree Algorithms for wireless ad hoc networks. Sustainable Internet - Third Asian Internet Engineenng Conference, AINTEC 2007, Proceedings. Springer Verlag, 2007. p. 226-241 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{2b94779a27514c23b4e4f587b1b07f95,

title = "Quality-of-service Multicast Overlay Spanning Tree Algorithms for wireless ad hoc networks",

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.",

author = "Georgios Rodolakis and C{\'e}dric Adjih and Anis Laouiti and Saadi Boudjit",

year = "2007",

month = jan,

day = "1",

doi = "10.1007/978-3-540-76809-8\_20",

language = "English",

isbn = "9783540768081",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "226--241",

booktitle = "Sustainable Internet - Third Asian Internet Engineenng Conference, AINTEC 2007, Proceedings",

note = "3rd Asian Internet Engineering Conference, AINTEC 2007 ; Conference date: 27-11-2007 Through 29-11-2007",

}

Rodolakis, G, Adjih, C, Laouiti, A & Boudjit, S 2007, Quality-of-service Multicast Overlay Spanning Tree Algorithms for wireless ad hoc networks. Dans Sustainable Internet - Third Asian Internet Engineenng Conference, AINTEC 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOL. 4866 LNCS, Springer Verlag, p. 226-241, 3rd Asian Internet Engineering Conference, AINTEC 2007, Phuket, Thadlande, 27/11/07. https://doi.org/10.1007/978-3-540-76809-8_20

Quality-of-service Multicast Overlay Spanning Tree Algorithms for wireless ad hoc networks. / Rodolakis, Georgios; Adjih, Cédric; Laouiti, Anis et al.
Sustainable Internet - Third Asian Internet Engineenng Conference, AINTEC 2007, Proceedings. Springer Verlag, 2007. p. 226-241 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol 4866 LNCS).

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

TY - GEN

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

AU - Rodolakis, Georgios

AU - Adjih, Cédric

AU - Laouiti, Anis

AU - Boudjit, Saadi

PY - 2007/1/1

Y1 - 2007/1/1

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-540-76809-8_20

DO - 10.1007/978-3-540-76809-8_20

M3 - Conference contribution

AN - SCOPUS:38349031163

SN - 9783540768081

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 226

EP - 241

BT - Sustainable Internet - Third Asian Internet Engineenng Conference, AINTEC 2007, Proceedings

PB - Springer Verlag

T2 - 3rd Asian Internet Engineering Conference, AINTEC 2007

Y2 - 27 November 2007 through 29 November 2007

ER -

Rodolakis G, Adjih C, Laouiti A, Boudjit S. Quality-of-service Multicast Overlay Spanning Tree Algorithms for wireless ad hoc networks. Dans Sustainable Internet - Third Asian Internet Engineenng Conference, AINTEC 2007, Proceedings. Springer Verlag. 2007. p. 226-241. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-76809-8_20

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

Résumé

Série de publications

Une conférence

Accès au document

Empreinte digitale

Contient cette citation