Quality Of Service Multicast Routing Protocol Research Articles

Enhanced QoS Multicast Routing Protocol in MANETs using Trust and Load Balance

Mobile ad-hoc network (MANET) is a wireless networks without fixed infrastructure, where each node can interact with its one hop distance neighbors only. Since the nodes are continuously moving from one location to another location, the network topology is not constant. Provisioning of Quality of Service (QoS) in MANETs is a challenging task because of its unstable nature. In multicast routing protocol, a sender node is sending the data to the group of members (multiple destination nodes), where the intermediate nodes resources are consumed at higher rate. In this paper, utilization of node resources (QoS parameters) is minimized by considering node attitude (trust) and load balancing. Here node energy and link bandwidth are considered as the QoS parameters. The proposed method "Enhanced QoS Multicast Routing Protocol in MANETs Using Trust and Load Balance-QMTL" identifies the intermediate nodes with higher trust values and constructs the multicast tree with optimized load balance. The performance of proposed method is analyzed theoretically (using asymptotic notations) and practically (using simulation tool-ns2)..

A resource‐tuned QoS multicast routing protocol

SummaryThis paper presents a novel framework for quality‐of‐service (QoS) multicast routing with resource allocation that represents QoS parameters, jitter delay, and reliability, as functions of adjustable network resources, bandwidth, and buffer, rather than static metrics. The particular functional form of QoS parameters depends on rate‐based service disciplines used in the routers. This allows intelligent tuning of QoS parameters as functions of allocated resources during the multicast tree search process, rather than decoupling the tree search from resource allocation. The proposed framework minimizes the network resource utilization while keeping jitter delay, reliability, and bandwidth bounded. This definition makes the proposed QoS multicast routing with resource allocation problem more general than the classical minimum Steiner tree problem. As an application of our general framework, we formulate the QoS multicast routing with resource allocation problem for a network consisting of generalized processor sharing nodes as a mixed‐integer quadratic program and find the optimal multicast tree with allocated resources to satisfy the QoS constraints. We then present a polynomial‐time greedy heuristic for the QoS multicast routing with resource allocation problem and compare its performance with the optimal solution of the mixed‐integer quadratic program. The simulation results reveal that the proposed heuristic finds near‐optimal QoS multicast trees along with important insights into the interdependency of QoS parameters and resources.

QMRPRNS: Design of QoS multicast routing protocol using reliable node selection scheme for MANETs

A mobile Ad-Hoc networks (MANETs) is a continuously self-configuring, infrastructure-less network of wireless mobile devices. In which multicast is one of the efficient way of communication. Currently, several research have been conducted to design multicast routing protocols for wireless mobile ad-hoc networks (MANETs). Multicasting is a technique that allow to send the same message to a group of destinations simultaneously. However, it faces several challenges against its implementation in ad-hoc network due to its dynamic nature, lack of bandwidth, short battery lifetime of the mobile devices. The multicast routing protocol MAODV have several constraints as mentioned above. Hence to address these constraints a reliable neighbour nodes selection scheme has been integrated over MAODV. This paper attempt a Quality of Service (QoS) based multicast routing protocol using reliable neighbour nodes selection scheme (QMRPRNS) for same. The simulation has been conducted to compare the performance of the proposed scheme against some existing multicast routing protocols which shows significant improvement over EMAODV and MAODV.

QoS multicast routing protocol oriented to cognitive network using competitive coevolutionary algorithm

The human intervention in the network management and maintenance should be reduced to alleviate the ever-increasing spatial and temporal complexity. By mimicking the cognitive behaviors of human being, the cognitive network improves the scalability, self-adaptation, self-organization, and self-protection in the network. To implement the cognitive network, the cognitive behaviors for the network nodes need to be carefully designed. Quality of service (QoS) multicast is an important network problem. Therefore, it is appealing to develop an effective QoS multicast routing protocol oriented to cognitive network.In this paper, we design the cognitive behaviors summarized in the cognitive science for the network nodes. Based on the cognitive behaviors, we propose a QoS multicast routing protocol oriented to cognitive network, named as CogMRT. It is a distributed protocol where each node only maintains local information. The routing search is in a hop by hop way. Inspired by the small-world phenomenon, the cognitive behaviors help to accumulate the experiential route information. Since the QoS multicast routing is a typical combinatorial optimization problem and it is proved to be NP-Complete, we have applied the competitive coevolutionary algorithm (CCA) for the multicast tree construction. The CCA adopts novel encoding method and genetic operations which leverage the characteristics of the problem. We implement and evaluate CogMRT and other two promising alternative protocols in NS2 platform. The results show that CogMRT has remarkable advantages over the counterpart traditional protocols by exploiting the cognitive favors.

A multi-path QoS multicast routing protocol with slot assignment for mobile ad hoc networks

Mobile multimedia applications have recently generated much interest in mobile ad hoc networks (MANETs) supporting quality-of-service (QoS) communications. Due to the limited bandwidth of a wireless node, a QoS multicast routing is often blocked if there is not a single multicast tree with the requested bandwidth, even when there is sufficient bandwidth in the network to support the call. In this paper, a multi-path QoS multicast routing (MQMR) protocol for MANETs is proposed. The scheme offers dynamic time slot control using a multi-path tree (or a uni-path tree) to meet the bandwidth requirements of a call. The final multi-path QoS multicast tree meets the QoS requirements, and the aggregate bandwidth of the paths meets the bandwidth requirements of a call. To avoid the hidden terminal problem or insufficient bandwidth in the bandwidth reservation process, each destination uses a decision rule. Moreover, a bandwidth reservation scheme is used for selecting the reserved time slots on each node in the multi-path QoS multicast tree. Simulation results demonstrate the effectiveness of MQMR in reducing network blocking and improving the call success ratio.

Position-Based Multicast Routing in Mobile Ad hoc Networks: An Analytical Study

With the prevalence of multimedia applications and the potential commercial usage of Mobile Ad hoc Networks (MANETs) in group communications, Quality of Service (QoS) support became a key requirement. Recently, some researchers studied QoS multicast issues in MANETs. Most of the existing QoS multicast routing protocols are designed with flat topology and small networks in mind. In this paper, we investigate the scalability problem of these routing protocols. In particular, a Position-Based QoS Multicast Routing Protocol (PBQMRP) has been developed. PBQMRP builds a source multicast tree guided by the geographic information of the mobile nodes, which helps in achieving more efficient multicast delivery. This protocol depends on the location information of the multicast members which is obtained using a location service algorithm. A virtual backbone structure has been proposed to perform this location service with minimum overhead and this structure is utilized to provide efficient packet transmissions in a dynamic mobile Ad hoc network environment. The performance of PBQMRP is evaluated by performing both quantitative analysis and extensive simulations. The results show that the used virtual clustering is very useful in improving scalability and outperforms other clustering schemes. Compared to On-Demand Multicast Routing Protocol (ODMRP), PBQMRP achieves competing packet delivery ratio and significantly lower control overhead.

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.

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 GA-based QoS multicast routing algorithm for large-scale networks

For multimedia applications, the routing algorithms should consider many Quality of Service (QoS) parameters. However, to find routes with two or more QoS parameters is an NP-hard problem. Therefore, recently many researchers are trying to use heuristic methods such as Genetic Algorithm (GA). In a previous work, a QoS multicast routing based on GA was proposed. However, in this algorithm, the multicast routing falls in the local minimum and cannot satisfy the application requirements. In this paper, we propose a new QoS multicast routing protocol, which has better genetic operations than the conventional algorithm, resulting in a better performance.

SoMR: A scalable distributed QoS multicast routing protocol

Many Internet multicast applications such as teleconferencing and remote diagnosis have Quality-of-Service (QoS) requirements. The requirements can be additive (end-to-end delay), multiplicative (loss rate), or of a bottleneck nature (bandwidth). Given such diverse requirements, it is a challenging task to build QoS-constrained multicast trees in a large network where no global network state is available. This paper proposes a scalable QoS multicast routing protocol (SoMR) that supports all three QoS requirement types. SoMR is scalable due to small communication overhead. It achieves favorable tradeoff between routing performance and routing overhead by carefully selecting the network sub-graph in which it searches for a path that can support the QoS requirements. The scope of search is automatically tuned based on the current network conditions. An early-warning mechanism helps detect and route around the long-delay paths in the network. The operations of SoMR are completely decentralized. They rely only on the local state stored at each router.

A hexagonal-tree TDMA-based QoS multicasting protocol for wireless mobile ad hoc networks

The mobile multimedia applications have recently generated much interest in wireless ad hoc networks with supporting the quality-of-service (QoS) communications. The QoS metric considered in this work is the reserved bandwidth, i.e., the time slot reservation. We approach this problem by assuming a common channel shared by all hosts under a TDMA (Time Division Multiple Access) channel model. In this paper, we propose a new TDMA-based QoS multicast routing protocol, namely hexagonal-tree QoS multicast protocol, for a wireless mobile ad hoc network. Existing QoS routing solutions have addressed this problem by assuming a stronger multi-antenna model or a less-strong CDMA-over-TDMA channel model. While more practical and less costly, using a TDMA model needs to face the challenge of radio interference problems. The simpler TDMA model offers the power-saving nature. In this paper, we propose a new multicast tree structure, namely a hexagonal-tree, to serve as the QoS multicasting tree, where the MAC sub-layer adopts the TDMA channel model. In this work, both the hidden-terminal and exposed-terminal problems are taken into consideration to possibly exploit the time-slot reuse capability. The hexagonal-based scheme offers a higher success rate for constructing the QoS multicast tree due to the use of the hexagonal-tree. A hexagonal-tree is a tree whose sub-path is a hexagonal-path. A hexagonal-path is a special two-path structure. This greatly improves the success rate by means of multi-path routing. Performance analysis results are discussed to demonstrate the achievement of efficient QoS multicasting.

A QoS multicast routing protocol for clustering mobile ad hoc networks

The provision of Quality-of-service (QoS) guarantees is of utmost importance for the development of the multicast services. These multicast services have been used by various continuous media applications. For example, the multicast backbone (Mbone) of the Internet has been used to transport real time audio/video for news, video conferencing and distance learning. This paper presents a QoS multicast routing protocol for clustering mobile ad hoc networks (QMRPCAH). It can provide QoS-sensitive routes in a scalable and flexible way, in the network environment with mobility. In the proposed QMRPCAH scheme, each local node only needs to maintain local multicast routing information and/or summary information of other clusters (or domains) but does not require any global ad hoc network states to be maintained. The QMRPCAH also allows any ad hoc group member can join/leave the multicast group dynamically, and supports multiple QoS constraints. This paper presents formal description and main procedures for realizing routing decision process of the QMRPCAH, and the proof of correctness and complexity analysis of the protocol. It also presents a theoretical analysis of the mobility in the mobile ad hoc network environment. The performance measures of QMRPCAH are evaluated using simulation. The studies show that QMRPCAH can provide an available approach to QoS multicast routing for mobile ad hoc networks.

Distributed QoS multicast routing protocol in ad hoc networks

Quality of service (QoS) routing and multicasting protocols in ad hoc networks are face with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. The multicast routing problem with multiple QoS constraints is discussed, which may deal with the delay, bandwidth and cost metrics, and describes a network model for researching the ad hoc networks QoS multicast routing problem. It presents a distributed QoS multicast routing protocol (DQMRP). The proof of correctness and complexity analysis of the DQMRP are also given. Simulation results show that the multicast tree optimized by DQMRP is better than other protocols and is fitter for the network situations with frequently changed status and the realtime multimedia application. It is an available approach to multicast routing decision with multiple QoS constraints.

QoS-aware multicast routing protocol for Ad hoc networks

Ad hoc wireless networks consist of mobile nodes interconnected by multihop communication paths. Unlike conventional wireless networks, ad hoc networks have no fixed network infrastructure or administrative support. Due to bandwidth constraint and dynamic topology of mobile ad hoc networks, supporting Quality of Service (QoS) is an inherently complex, difficult issue and very important research issue. MAODV (Multicast Ad hoc On-demand Distance Vector) routing protocol provides fast and efficient route establishment between mobile nodes that need to communicate with each other. MAODV has minimal control overhead and route acquisition latency. In addition to unicast routing, MAODV supports multicast and broadcast as well. The multicast routing problem with multiple QoS constraints, which may deal with the delay, bandwidth and packet loss measurements is discussed, and a network model for researching the ad hoc network QoS multicast routing problem is described. It presents a complete solution for QoS multicast routing based on an extension of the MAODV routing protocol that deals with delay, bandwidth and packet loss measurements. The solution is based on lower layer specifics. Simulation results show that, with the proposed QoS multicast routing protocol, end-to-end delay, bandwidth and packet loss on a route can be improved in most of cases. It is an available approach to multicast routing decision with multiple QoS constraints.

Ad hoc qualiy of service multicast routing with objection queries for admission control

AbstractToday's handheld computing devices equipped with novel wireless network technologies can provide their users with features such as mobility, multimedia support and group communication. On the other hand, the administrative effort required to enable all these features increases beyond the level that an ordinary user can manage. Ad hoc networks, being able to quickly organise themselves without user intervention, can overcome this problem. They are also suitable for group‐oriented mobile multimedia communication. However, it is imperative for ad hoc networks to combine quality of service (QoS) and multicast routing strategies in order to utilise the wireless medium efficiently. This article defines the components of an ad hoc QoS multicast routing (AQM) protocol, which addresses this issue. AQM achieves multicast routing efficiency by tracking the availability of resources for each node within its neighbourhood. Computation of free bandwidth is based on reservations made for ongoing sessions and the allocations reported by neighbours. Current QoS status is announced at the initiation of a new session and updated periodically in the network to the extent of QoS provision. Thus, nodes are prevented from applying for membership if there is no QoS path for the session. When nodes wish to join a session with certain service requirements, a three‐phase process consisting of request, reply and reserve steps ensures that the QoS information is updated and used to select the most appropriate routes. The allowed maximum hop count of the session is taken into account in order to satisfy the delay requirements of the multimedia applications. To cope with the continuous nature of streaming multimedia, AQM nodes check the availability of bandwidth within their neighbourhood not only for themselves but within a virtual tunnel of nodes. Objection queries are issued prior to reservation to avoid excessive resource usage due to allocations made by nodes which cannot detect each other directly. New performance metrics are introduced to evaluate the efficiency of AQM regarding the satisfaction level of individual members as well as the success rate of sessions. Simulation results show that, by applying novel QoS management techniques, AQM significantly improves multicast efficiency for members as well as for sessions. Copyright © 2005 AEIT.