QoS Multicast Routing Research Articles

A Cluster-based QoS Multicast Routing Protocol for Scalable MANETs

Recently, multicast routing protocols become increasingly important aspect in Mobile Ad hoc Networks (MANETs), as they effectively manage group communications. Meanwhile, multimedia and real-time applications are becoming essential need for users of MANET. Thus it is necessary to design efficient and effective Quality of Service (QoS) multicast routing strategies. In this paper, we address the scalability problem of multicast routing protocols to support QoS over MANETs. In particular, we introduce a Position-Based QoS Multicast Routing Protocol (PBQMRP). Basically, the protocol based on dividing the network area into virtual hexagonal cells. Then, the location information is exploited to perform efficient and scalable route discovery. In comparison with other existing QoS multicast routing protocols, PBQMRP incurs less control packets by eliminating network flooding behavior. Through simulation, the efficiency and scalability of PBQMRP are evaluated and compared with the well-known On-Demand Multicast Routing Protocol (ODMRP). Simulation results justify that our protocol has better performance, less control overhead and higher scalability.

Based on AFSA-Tabu search algorithm combined QoS Multicast Routing Algorithm

Based on AFSA-Tabu search algorithm combined QoS Multicast Routing Algorithm

Performance Analysis of QoS Multicast Routing in Mobile Ad Hoc Networks Using Directional Antennas

in this paper, a quality of service (QoS) multicast routing protocol in mobile ad hoc networks (MANETs) by using directional antennas has been presented. Many important applications, such as audio/video conferencing, require the quality of service guarantee. Directional antenna technology provides the capability for considerable increase in spatial reuse, which increases the efficiency of communication. This paper studies TDMA-based timeslot allocation and directional antennas, and presents an effective algorithm for calculating bandwidth of a multicast tree. We also propose a novel on-demand QoS multicasting routing algorithm in TDMA-based mobile ad hoc networks using directional antennas. The simulation result shows the performance of this QoS multicast routing algorithm in TDMA-based mobile ad hoc networks using directional antennas.

Flooding-limited and multi-constrained QoS multicast routing based on the genetic algorithm for MANETs

A wireless MANET is a collection of wireless mobile hosts that dynamically create a temporary network without a fixed infrastructure. The topology of the network may change unpredictably and frequently. Therefore, multicast routing in ad hoc networks is a very challenging problem. This paper proposes a multi-constrained QoS multicast routing method using the genetic algorithm. The proposal will be flooding-limited using the available resources and minimum computation time in a dynamic environment. By selecting the appropriate values for parameters such as crossover, mutation, and population size, the genetic algorithm improves and tries to optimize the routes. Simulation results indicate its better performances compared to other methods.

Unicast and multicast QoS routing with soft-constraint logic programming

We present a formal model to represent and solve the unicast/multicast routing problem in networks with quality-of-service (QoS) requirements. To attain this, first we translate the network adapting it to a weighted graph (unicast) or and-or graph (multicast), where the weight on a connector corresponds to the multidimensional cost of sending a packet on the related network link: each component of the weights vector represents a different QoS metric value (e.g., bandwidth). The second step consists in writing this graph as a program in soft-constraint logic programming (SCLP): the engine of this framework is then able to find the best paths/trees by optimizing their costs and solving the constraints imposed on them (e.g. delay ≤ 40 ms), thus finding a solution to QoS routing problems. C-semiring structures are a convenient tool to model QoS metrics. At last, we provide an implementation of the framework over scale-free networks and we suggest how the performance can be improved. The article highlights the expressivity of SCLP.

Adaptive QoS Multicast Routing with Mobility Prediction in MANETs

Adaptive QoS Multicast Routing with Mobility Prediction in MANETs

QoS multicast routing using a quantum-behaved particle swarm optimization algorithm

QoS multicast routing in networks is a very important research issue in networks and distributed systems. It is also a challenging and hard problem for high-performance networks of the next generation. Due to its NP-completeness, many heuristic methods have been employed to solve the problem. This paper proposes the modified quantum-behaved particle swarm optimization (QPSO) method for QoS multicast routing. In the proposed method, QoS multicast routing is converted into an integer programming problem with QoS constraints and is solved by the QPSO algorithm combined with loop deletion operation. The QPSO-based routing method, along with the routing algorithms based on particle swarm optimization (PSO) and genetic algorithm (GA), is tested on randomly generated network topologies for the purpose of performance evaluation. The simulation results show the efficiency of the proposed method on QoS the routing problem and its superiority to the methods based on PSO and GA.

A hybrid QoS multicast framework-based protocol for wireless mesh networks

In recent years wireless mesh networks have been deployed and grown in popularity in many metropolitan areas. The deployment of such networks has allowed clients to gain access to publicly available broadband networks. The lack of standards and support for multicasting over wireless mesh networks makes this area very challenging as well as providing much scope for improvement. For first time in this paper, we use CMAC neural network model to predict route or node disconnection probability and to control congestion and losses specifically in the gateways. This prediction leads to recover the network before fault occurrence. In this paper, we propose a new QoS multicast routing framework for WMNs to solve the problem of load balancing and to enhance the QoS in multicast communication among Internet hosts and Mesh hosts dynamically. We also present an optimized hybrid multicast protocol based on this framework called HMFPM provisioning problems in the Next-Generation IEEE 802.11 s. The proposed protocol combines Proactive and Reactive multicast routing to eliminate unnecessary delays and also minimize control overhead in setting up routes amongst the backbone mesh routers. It also supports multiple gateways for the gateway balancing and routing based on CMAC prediction in each node to have the routes with least miss ratio.

Joint QoS multicast routing and channel assignment in multiradio multichannel wireless mesh networks using intelligent computational methods

In this paper, the quality of service multicast routing and channel assignment (QoS-MRCA) problem is investigated. It is proved to be a NP-hard problem. Previous work separates the multicast tree construction from the channel assignment. Therefore they bear severe drawback, that is, channel assignment cannot work well with the determined multicast tree. In this paper, we integrate them together and solve it by intelligent computational methods. First, we develop a unified framework which consists of the problem formulation, the solution representation, the fitness function, and the channel assignment algorithm. Then, we propose three separate algorithms based on three representative intelligent computational methods (i.e., genetic algorithm, simulated annealing, and tabu search). These three algorithms aim to search minimum-interference multicast trees which also satisfy the end-to-end delay constraint and optimize the usage of the scarce radio network resource in wireless mesh networks. To achieve this goal, the optimization techniques based on state of the art genetic algorithm and the techniques to control the annealing process and the tabu search procedure are well developed separately. Simulation results show that the proposed three intelligent computational methods based multicast algorithms all achieve better performance in terms of both the total channel conflict and the tree cost than those comparative references.

A tree-based particle swarm optimization for multicast routing

QoS multicast routing is a non-linear combinatorial optimization problem. It tries to find a multicast routing tree with minimal cost that can satisfy constraints such as bandwidth, delay, and delay jitter. This problem is NP-complete. The solution to such problems is often to search first for paths from the source node to each destination node and then integrate these paths into a multicast tree. Such a method, however, is slow and complex. To overcome these shortcomings, we propose a new method for tree-based optimization. Our algorithm optimizes the multicast tree directly, unlike the conventional solutions to finding paths and integrating them to generate a multicast tree. Our algorithm also applies particle swarm optimization to the solution to control the optimization orientation of the tree shape. Simulation results show that our algorithm performs well in searching, converging speed and adaptability scale.

Energy Reduction Aware Multicast Routing for Mobile Ad Hoc Networks

QoS Multicast routing is difficult in Mobile Ad hoc Network (MANET) due to limited resources. Each node in MANET is constrained by their limited battery power for their energy. The energy is reduced as the time goes off due to the packet transmission and reception. Energy management techniques are necessary to minimize the total power consumption of all the nodes in the network in order to maximize its life span. Our proposed protocol Energy Reduction Aware Multicast (ERAM) aimed to find a path which utilizes the minimum energy to transmit the packets between the source and the destination. The required energy for the transmission and reception of data is evaluated at the MAC layer. The network layer makes use of it to find the minimum energy path. ERAM is implemented on Multicast Ad hoc On Demand Distance Vector Routing Protocol (MAODV) to manage the energy consumption in the transmission and reception of data. Simulation results of ERAM show the energy consumption has been reduced.

Energy reduction aware multicast routing for mobile ad hoc networks

QoS Multicast routing is difficult in Mobile Ad hoc Network (MANET) due to limited resources. Each node in MANET is constrained by their limited battery power for their energy. The energy is reduced as the time goes off due to the packet transmission and reception. Energy management techniques are necessary to minimize the total power consumption of all the nodes in the network in order to maximize its life span. Our proposed protocol Energy Reduction Aware Multicast (ERAM) aimed to find a path which utilizes the minimum energy to transmit the packets between the source and the destination. The required energy for the transmission and reception of data is evaluated at the MAC layer. The network layer makes use of it to find the minimum energy path. ERAM is implemented on Multicast Ad hoc On Demand Distance Vector Routing Protocol (MAODV) to manage the energy consumption in the transmission and reception of data. Simulation results of ERAM show the energy consumption has been reduced.

Self-Organized QoS Aware Multicast Routing Scheme for Ad Hoc Networks

Mobile ad hoc networks (MANETs) are formed by an autonomous collection of mobile nodes making dynamic networks. Mobile ad hoc networks multimedia applications require an efficient and effective quality of service aware multicast routing scheme. Supporting quality-of-service in an ad hoc environment is a major challenge due to the unpredictable and potentially changing topology. Further the shared wireless medium and strict resource constraints impose additional challenges in providing quality of service support to MANET. In this paper, the issues in providing quality of service support to multicast routing schemes are analyzed and a new cluster-based scheme that provides QoS guarantees to multicast routing in MANETs is presented. The performance of the proposed scheme is evaluated via simulations and is compared with hierarchical QoS multicast routing protocol (HQMRP). Analysis shows that the control overhead of the proposed protocol is less than that of the existing protocols. The simulation results show that the packet delivery ratio in the proposed scheme is better than HQMRP under high mobility scenarios and this scheme is adaptable to the frequent topology changes.

A Novel Fast Multi-objective Evolutionary Algorithm for QoS Multicast Routing in MANET

Multicast routing is regarded as a critical component in networks especially the real-time applications become increasingly popular in recent years. Existing multicast routing under certain QoS Constraints tend to use conventional IP QoS architecture based on GA. In this paper, we propose a novel fast multi-objective evolutionary algorithm called QMOEA for solving multicast routing problem (MRP) in MANET. The steps are that, through the analysis of the strengths and limitations of the well-known multicast architecture, we firstly give an improved Core Based Tree model to simplify the MRP. Based on this model, we then propose the QMOEA which integrates the “Greedy”and “family competition”approaches to speed up the convergence and to maintain the diversity of population. After that, we present the theoretical validations for the proposed method to show its efficiency, and finally, the performance of MANET scaled from 20 to 200 nodes with different types of service is evaluated by OPNET, our experimental res...

Performance evaluation of a mesh-evolving quality-of-service-aware multicast routing protocol for mobile ad hoc networks

The tremendous amount of multimedia applications running across the wireless communication medium makes quality of service (QoS) a fundamental requirement for mobile ad hoc networks. However, it is not easy to incorporate QoS into these networks. Moreover, the growing number of group-oriented applications also necessitates the efficient utilisation of network resources. The multicast model is a promising technique which can achieve this efficiency by facilitating the inherent broadcast capability of the wireless medium. The mesh-evolving ad hoc QoS multicast (MAQM) routing protocol is developed to address the resource efficiency and QoS problems with one, integrated solution. MAQM achieves multicast efficiency by tracking the availability of resources for each node within its neighbourhood. The QoS status is monitored continuously and announced periodically to the extent of QoS provision. Using these features, MAQM nodes can make their decisions on joining a new multicast session based on the sustainability of their perceived QoS. MAQM also evolves the initial multicast tree into a mesh during the course of an ongoing session to achieve a more robust network topology. Thus, MAQM integrates the concept of QoS-awareness into multicast routing in mobile ad hoc networks. Since ad hoc networks require the protocol control overhead to be as small as possible, we analyse the multicast session establishment process of MAQM to see its impact on the protocol performance in terms of system control overhead. We also evaluate the performance of MAQM through computer simulations using various qualitative and quantitative criteria. The simulation results validate our mathematical analysis of the control overhead and show that MAQM significantly improves multicast efficiency through its QoS-aware admission and routing decisions with an acceptably small overhead. Thus, MAQM shows that QoS is not only essential for, but also applicable to mobile ad hoc networks.

A new multicast routing protocol with QoS constraints

A QoS multicast routing algorithm for DiffServ networks called PQMRD(Per-class QoS Multicast Routing in DiffServ networks) was proposed.It used different routing strategy to select route in terms of different QoS requirement;in addition,admission control and resource reservation were performed while selecting route.It is proved by the simulation result that inter-class unfairness problem is alleviated.

An adaptive-evolution-based quantum-inspired evolutionary algorithm for QoS multicasting in IP/DWDM networks

This paper investigates least-cost QoS multicast routing problem in IP/DWDM optical networks, and proposes an improved evolutionary algorithm (AEQEA). Based on quantum-inspired evolutionary algorithm (QEA) with quantum rotation gate strategy, AEQEA introduces adaptive evolution mechanism (AEM), which allows each chromosome in a population to update itself to a fitter position according to its own situation. In term of this mechanism, AEQEA can significantly improve its capability of exploration and exploitation, since every chromosome is able to be allocated with suitable evolutionary parameters before each update. A repair method is applied to eliminate illegal graphs as many as possible hence more excellent solutions will appear in each evolutionary generation. Simulations are carried out over a number of network topologies. And the results show that, for the QoS multicasting problem, AEQEA outperforms other existing heuristic algorithms and is characterized by robustness, high success ratio, fast convergence and excellent capability on global searching.

A Novel Fast Multi -objective Evolutionary Algorithm for QoS Multicast Routing in MANET

A Novel Fast Multi -objective Evolutionary Algorithm for QoS Multicast Routing in MANET

QoS multicast routing scheme using QGA in IP/DWDM networks

This article studies multi-constraints least-cost multicast routing problem in internet protocol over dense wavelength division multiplexing (IP/DWDM) networks. To address this problem, an individual-difference-based quantum genetic algorithm (IDQGA) is proposed. This algorithm considers individual differences among chromosomes by introducing an adaptive rotation angle step determination scheme and a grouping-based quantum mutation operation. Simulations are conducted over network topologies. The results indicate that compared with other heuristic algorithms, IDQGA has better optimal performance on solving quality of service (QoS) multicast routing problem in IP/DWDM networks and is characterized by strong robustness, high success ratio and excellent capability on global searching.

A multi-granularity evolution based Quantum Genetic Algorithm for QoS multicast routing problem in WDM networks

QoS multicast routing problem in WDM networks is investigated, and an improved algorithm Multi-granularity Evolution based Quantum Genetic Algorithm (MEQGA) is proposed to address it. Based on Quantum Genetic Algorithm (QGA) with quantum rotation gate strategy, MEQGA introduces multi-granularity evolution mechanism, which allows different chromosomes of one generation to have different rotation angle step values to update. In term of this mechanism, MEQGA can significantly improve its capability of exploration and exploitation, since its optimization performance does not over-depend on the single rotation angle step scheme shared by all chromosomes any longer. MEQGA also presents an adaptive quantum mutation operation which is able to avoid local search efficiently. A repair method is applied to eliminate illegal graphs as many as possible hence more excellent solutions will appear in each evolutionary generation. Simulation results show that, for the QoS multicast routing problem, MEQGA outperforms other heuristic algorithms and is characterized by robustness, high success ratio, fast convergence and excellent capability on global searching.