Paper Info
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 ($\mathcal{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.
Year
DOI
Venue
2007
10.1007/978-3-540-76809-8_20
AINTEC
Keywords
Field
DocType
quality-of-service multicast overlay spanning,radio transmission,different algorithm,multicast overlay spanning tree,tree algorithms,wireless ad hoc networks,multicast group member,residual capacity,bandwidth requirement,quality of service,spanning tree,wireless ad hoc network
Mobile ad hoc network,Computer science,Computer network,Quality of service,Algorithm,Ad hoc wireless distribution service,Bandwidth (signal processing),Spanning tree,Wireless ad hoc network,Multicast,Vehicular ad hoc network,Distributed computing
Conference
Volume
ISSN
Citations 
4866
0302-9743
0
PageRank 
References 
Authors
0.34
15
4
Name
Order
Citations
PageRank
Georgios Rodolakis122114.99
Cédric Adjih210110.96
Anis Laouiti331527.36
Saadi Boudjit46613.08