Quality-of-Service Multicast Overlay Spanning Tree Algorithms for Wireless Ad Hoc Networks

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.

• Type: Conference
• Year: 2007
• Where: AINTEC
• Authors: Georgios Rodolakis, Cedric Adjih, Anis Laouiti, Saadi Boudjit
• Keywords: AINTEC 2007, Algorithms, Computer Networks, Spanning Trees, Wireless Ad Hoc Networks