Multiple QoS Constraints Research Articles

Energy Aware Multiple Constraints Quality of Service Routing Protocol with Dynamic Mobility Prediction for Mobile Ad hoc Networks

Problem statement: This study presents a source based reactive protocol called "Energy Aware Multiple Constraints QoS Routing Protocol with Dynamic Mobility Prediction (EMQRPDM)" for MANET. It is an enhanced version of our previous protocol called "Power aware multiple QoS constraints routing protocol with mobility prediction (PMQRPMP)". It addresses the issues such as routing, mobility and power management in MANET. Approach: EMQRPDM considers quality of service parameters namely delay, jitter, bandwidth and cost of each link on 'n' available paths and selects a stable optimal path between a source and a destination during path discovery. It checks a bandwidth constraint during route request. It also checks the energy level constraints for each node during route reply. EMQRPDM uses our new mobility prediction mechanism to determine the stability of link expiration time for each link of each path during route reply. It executes path maintenance procedure when the link between two nodes cuts off. It also considers a backup path during link failure. Results: EMQRPDM is compared with PMQRPMP. Even though the mobility speed of mobile nodes is increased to 10 m sec−1, the success rate of data transmission in EMQRPDM is 74% which is still higher than PMQRPMP. During link failure using a backup path, the cost of control overhead in EMQRPDM is 0.272 which is lower than PMQRPMP when the number of mobile nodes is increased from 15-40. Conclusion/Recommendations: EMQRPDM selects an optimal path with good battery backup using energy level constraints. It selects a best stable optimal path using our new mobility prediction mechanism. EMQRPDM gives better Packet Delivery Ratio. It reduces the cost of control overhead using the bandwidth constraint and a backup path. It can be further enhanced as a reliable, secure, hybrid and multicast communication protocol for MANET.

Ant-Based Reliable Multi-Constrained Anycast Routing for Sensor Networks

Wireless sensor networks (WSNs) are task-specific where the tasks are specified by the users or applications. Energy and delay constraints have had a great impact on the design and operation of the WSNs. As routing plays an important role in data-centric WSNs, there are numerous energy aware routing protocols proposed for WSNs with single sink, generally using multi-hop paths to use the energy more efficiently. But most of them do not consider the communication delay carefully. As many applications of WSNs require real-time communication, the end-to-end delivery delay is another point to be considered, especially for urgent events. When considering the multiple QoS constraints such as the delivery delay and the minimal energy required, the multi-constrained routing is NP-hard. Moreover, WSNs also suffer from a scalability problem as the total number of nodes can reach hundreds or thousands. Thus, sensors located near the sink consume large amounts of energy. The sink is then isolated once they deplete their batteries, and the network fails to function. To cope with the scalability problem, multi-sink configuration is adopted for large-scale WSNs. How to select the optimum sink for packets with different delay and energy constraints in large-scale WSNs is the main problem to be resolved in this paper, which is called the multi-constrained anycast (MCA) problem. Obviously, it is NP-hard. We investigate the MCA problem in resource-constrained WSNs with multiple sinks and two-tier architecture, where the source cluster-heads send collected data to only one optimum sink. To reduce the energy consumption and shorten the delivery delay, a distributed anycast algorithm ARMCA inspired by swarm intelligence of ants is proposed, which can also achieve reliable data gathering during the deployment period. The scheme takes advantage of beneficial clustering and routing emerging in a self-organized way from the positive interaction of ants. The idea of the ACO-based routing is adopted to achieve the good performance of energy-efficiency and delivery delay. Meanwhile, the ant-based clustering is utilized to ensure the reliability. By the combination of the ant-based routing and clustering models, the ARMCA protocol can solve the MCA problem efficiently and flexibly. The simulation results demonstrated that the proposed algorithm can reliably deliver collected events to the optimum sinks efficiently, and has self-recovery capabilities to deal with failures of sensors including the sinks. Not only is the energy cost reduced, but also the delivery delay is shortened significantly when transmitting packets of the named events to the sinks.

QoS multicast aggregation under multiple additive constraints

IP Multicast has been proposed in order to manage group communications over the Internet in a bandwidth efficient manner. Although such a proposition has been well studied, there are still some inherent problems for its widespread deployment. In this paper, we propose a new algorithm coined mQMA that deals with the two main problems of traditional IP multicast, i.e., multicast forwarding state scalability and multi-constrained QoS routing. The algorithm mQMA is a QoS multicast aggregation algorithm which handles multiple additive QoS constraints. It builds few trees and maintains few forwarding states for the groups thanks to the technique of multicast tree aggregation, which allows several groups to share the same delivery tree. Moreover, the algorithm mQMA builds trees satisfying multiple additive QoS constraints. We show via extensive simulations that mQMA reduces dramatically the number of trees to be maintained and reduces the utilization of the network resources, yet it leverages the same overall QoS performances as Mamcra which is the main known multi-constrained multicast routing algorithm.

QoS multicast routing protocol in hierarchical wireless MANET

A wireless MANET is a self-configurable network in which mobile, battery-powered devices dynamically create and change the network topology without relying on any intrastructure or administrative support. It offers unique benefits for certain environments, but there are still several open issues to be resolved before realizing these benefits, including QoS routing, multicasting, and mobility management. Specifically, an efficient QoS multicast routing protocol is needed. This paper presents a hierarchical QoS multicast routing protocol (QMRP) for mobile ad hoc networks. It can provide QoS-sensitive routes in a scalable and flexible way, in the network environment with mobility. In the proposed QMRP 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 QMRP also allows any ad hoc group member to 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 QMRP and the proof of correctness and complexity analysis of the protocol. The performance measures of QMRP are evaluated using simulation. The simulation results verify the efficiency and availability of QMRP.

A genetic algorithm for energy-efficient based multicast routing on MANETs

In ad hoc networks, mobile node battery energy is finite and represents one of the greatest constraints for designing multicast routing protocols. In regards to the battery lifetime limitation in supporting multicast routing, some studies have investigated a power saving network layer. These proposed methods have always considered several techniques such as a route load for relaying, battery lifetime in route selection, decreasing the frequency of sending control messages, optimizing the size of control headers, and efficient route re-configuration techniques. This paper discusses the multicast routing problem with multiple QoS constraints in MANETs. It is also an NP-Complete problem that deals with the various constraints. We propose an energy-efficient genetic algorithm mechanism to resolve these problems. Furthermore, we design a source-tree-based routing algorithm and build the shortest-path multicast tree to minimize delay time by using a small population size in the genetic algorithm. Only a few nodes are involved in the route computation. We also improve the genetic sequence and topology encoding and prolong the lifetime of mobile nodes that calculate the residual battery energy of all nodes in a multicast tree. The simulation results show that our proposal method is an efficient and robust algorithm for multicast route selection.

Multicast routing algorithm of multiple QoS based on widest-bandwidth

A multicast routing algorithm of multiple QoS constraints based on widest-bandwidth (MRQW) which takes available bandwidth as the prime metric, considering the constraints of the surplus energy of the node, delay and delay jitter, is presented. The process of routing based on MRQW is provided for as well. Correctness proof and the complexity analysis of the MRQW are also given in the paper. Simulation results show that the MRQW has a good performance in creating multicast trees. It not only satisfys multiple QoS constraints but also makes multicast links have larger available bandwidth

An iterative distributed algorithm for multi-constraint multicast routing

In this paper, we propose a group computation based distributed algorithm for solving the problem of multi-constraint multicast routing. This algorithm is fully distributed and can generate within acceptable time and message complexities a multicast routing tree, which not only satisfies the required multiple QoS constraints but also has a sub-optimal network cost. The results of the simulations show that the multicast routing tree generated by our algorithm has better performance than the previous well-known results.

M_CSPF: A Scalable CSPF Routing Scheme with Multiple QoS Constraints for MPLS Traffic Engineering

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

Adaptive QoS Routing by Cross-Layer Cooperation in Ad Hoc Networks

QoS provisioning is a complex and challenging issue in mobile ad hoc networks, especially when there are multiple QoS constraints. In this paper, we propose an adaptive QoS routing scheme supported by cross-layer cooperation in ad hoc networks. The cross-layer mechanism provides up-to-date local QoS information for the adaptive routing algorithm, by considering the impacts of node mobility and lower-layer link performance. The multiple QoS requirements are satisfied by adaptively using forward error correction and multipath routing mechanisms, based on the current network status. The complete routing mechanism includes three parts: (1) a modified dynamic source routing algorithm that handles route discovery and the collection of QoS-related parameters; (2) a local statistical computation and link monitoring function located in each node; and (3) an integrated decision-making system to calculate the number of routing paths, coding parity length, and traffic distribution rates. Simulation results are presented to illustrate the overall performance of our scheme. Our results indicate that our adaptive routing scheme provides suitable QoS performance that is less sensitive to network conditions (i.e., node mobility, transmission power, channel characteristics, and the traffic pattern) than a nonadaptive routing strategy.

Opportunistic Scheduling: Generalizations to Include Multiple Constraints, Multiple Interfaces, and Short Term Fairness

We consider several scheduling problems for packet based systems with time-varying channel conditions. Designing scheduling mechanisms that take advantage of time-varying channel conditions, which are different for different users, is necessary to improve system performance; however this has to be done in a way that provides some level of fairness among the users. Such scheduling mechanisms are termed opportunistic. We generalize the opportunistic scheduling mechanisms in the literature on three fronts. First, we formulate and solve an opportunistic scheduling problem with multiple general long term QoS constraints and a general system objective function. The solution of this opportunistic scheduling problem is an index policy. Then, we generalize this problem to include multiple interface systems in which several users can be served simultaneously. Apart from the long term QoS constraints specified by each user, multiple interface systems are constrained with other physical limitations imposed by the system. We show that the structure of the optimal opportunistic scheduling policy is carried over to the problem with general constraints and multiple interfaces. We also study the stability of the multiple interface systems and propose a throughput optimal scheduling rule for such systems. We then formulate an opportunistic scheduling problem with short term processor sharing fairness constraints as an optimization problem where fairness is guaranteed over a finite time window. In its most general form, this problem cannot be solved analytically. Hence observing the form of the optimal policies for special cases, we propose a heuristic scheduling policy. We illustrate the effectiveness of the policies via simulation.

Path selection under multiple QoS constraints - a practical approach

Path selection under multiple additive QoS constraints in high-speed networks is an NP-complete problem. Most of the algorithms proposed for QoS routing suffer from either excessive computational c...

A QoS multicast routing protocol for dynamic group topology

Multicast routing is establishing a tree which is rooted from the source node and contains all the multicast destinations. A multicast routing tree with multiple QoS constraints may be the tree in which the delay, delay-jitter, packet-loss and bandwidth should satisfy the pre-specified bounds. This paper discusses the multicast routing problem with multiple QoS constraints, which may deal with the delay, delay-jitter, bandwidth and packet-loss metrics, and describes a network model for researching the routing problem. It presents a QoS multicast routing protocol with dynamic group topology (QMRPD). The QMRPD attempts to significantly reduce the overhead of constructing a multicast tree with multiple QoS constraints. In MPRMQ, a multicast group member can join or leave a multicast session dynamically, which should not disrupt the multicast tree. It also attempts to minimize overall cost of the tree, and satisfy the multiple QoS constraints and least cost's (or lower cost) requirements. In this paper, the proof of correctness and complexity analysis of the QMRPD are also given. Simulation results show that QMRPD is an available approach to multicast routing decision with dynamic group topology.

A dynamic multicast routing satisfying multiple QoS constraints

AbstractIn this paper we propose a QoS‐based routing algorithm for dynamic multicasting. The complexity of the problem can be reduced to a simple shortest path problem by applying a Weighted Fair Queuing (WFQ) service discipline. Using a modified Bellman–Ford algorithm, the proposed routing builds a multicast tree, where a node is added to the existing multicast tree without re‐routing and satisfying QoS constraints. With user defined life‐time of connection this heuristic algorthm builds multicast tree which is near optimum over the whole duration of session. Simulation results show that tree costs are nearly as good as other dynamic multicast routings that does not consider QoS. Copyright © 2003 John Wiley & Sons, Ltd.

QROUTE: an QoS-guaranteed multicast routing

In this paper, we propose QROUTE, an integrated framework for QoS-guaranteed multicast routing, in which a feasible multicast tree meeting multiple QoS constraints can be constructed in a distributed fashion using local states at routers. Compared with existing QoS-based multicast routing protocols, QROUTE is much simpler to design and implement; and its simplicity and feasibility is demonstrated through the construction of a prototype router testbed. In addition, it is more effective as it avoids flooding the network blindly, while searching all the available feasible paths in parallel so as to ensure a better chance of successful routing and a more efficient use of network resources. We also evaluate the performance of QROUTE by comparing it with other related protocols through simulations, and find that QROUTE has lower blocking probability, lower routing overhead, lower connection set-up latency, and the resulting multicast trees of QROUTE also generally require fewer links than those of the related protocols. In addition it is fairly scalable with the network sizes.

Core selection algorithm for multicast routing under multiple QoS constraints

To guarantee the construction of QoS-based multicast trees, the authors propose a QoS-based core selection algorithm which can accomodate multiple QoS constraints. From simulation results, the proposed algorithm is found to outperform conventional schemes by ~10%.