A QoS-aware multicast routing protocol for multimedia applications in mobile ad hoc networks

Many real-time applications, such as video conferencing, require the transmission of flows from a sender to multiple receivers subject to Quality of Service (QoS) delivery constraints (e.g., bounded delay). Traditional multicast routing algorithms used for solving the Steiner tree problem cannot be used in this scenario, because QoS constraints on links are not considered. Moreover, with QoS metrics consideration, the problem of computing optimal constrained multicast tree is known as NP-complete. In this paper, we propose a new QoS-aware Multicast Overlay Spanning Tree (QMOST) protocol to support multiple-metric routing criteria in mobile ad hoc networks. It computes low cost trees under various QoS constraints in polynomial time using an efficient source-based optimization heuristic. Unlike common multicast protocols where data packets are transmitted in a broadcast mode, in QMOST data packets are encapsulated in unicast packets before being forwarded to the overlay tunnels. QMOST must be used in conjunction with a unicast QoS link state protocol (like QOLSR) and can be integrated in a QoS model. This later offers the needed service guarantee using distributed admission control to check if the multicast QoS flows are admissible, resource reservation mechanism and congestion control. Simulation results show that our QMOST protocol achieves better performance than the QOLSR protocol.

[1]  V. J. Rayward-Smith,et al.  The computation of nearly minimal Steiner trees in graphs , 1983 .

[2]  Khaldoun Al Agha,et al.  Quality of Service for the Ad hoc Optimized Link State Routing Protocol (QOLSR) , 2006 .

[3]  Philippe Jacquet,et al.  Multicast Scaling Properties in Massively Dense Ad Hoc Networks , 2005, 11th International Conference on Parallel and Distributed Systems (ICPADS'05).

[4]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[5]  Khaldoun Al Agha,et al.  A Distributed Algorithm for Multiple-Metric Link State QoS Routing Problem , 2003, MWCN.

[6]  K. Bharath-Kumar,et al.  Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..

[7]  C. Edward Chow,et al.  On multicast path finding algorithms , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[10]  Khaldoun Al Agha,et al.  QOLSR, QoS routing for ad hoc wireless networks using OLSR , 2005, Eur. Trans. Telecommun..

[11]  David S. Johnson,et al.  Computers and Inrracrobiliry: A Guide ro the Theory of NP-Completeness , 1979 .

[12]  Khaldoun Al Agha,et al.  CEQMM: a complete and efficient quality of service model for MANETs , 2006, PE-WASUN '06.

[13]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[14]  S. Louis Hakimi,et al.  Steiner's problem in graphs and its implications , 1971, Networks.