QoS Routing Research Articles

Traffic Type Influence on Performance of OSPF QoS Routing

Traffic Type Influence on Performance of OSPF QoS Routing

PERFORMANCE COMPARISON OF QOS BASED ROUTING PROTOCOLS MBRR, REAR AND SPEED FOR WIRELESS SENSOR NETWORKS

A wireless sensor network (WSN) is a collection of small randomly dispersed micro sensor nodes that ha ve capability to sense, establish wireless communication between each other and do computations and process operations. A netw ork especially wireless network strongly depends on the routing protocols t o route the sensed data to the Base Station (BS) vi a some intermediate nodes. Due to fast emergence of the wireless sensing, a lot of work has been done on the various categories of ro uting protocols of WSN like location-based, data-centric, hierarchal routing pr otocols etc. to measure the network performance. Bu t recent studies are provided with the evidence that Quality-of-Service (QoS) rou ting can enhance the network performance by increas ing the network utilization, compared to routing that is not sensitive to QoS re quirements of traffic. So in this paper, the focus is on evaluation and comparison of the network performance in the WSN having QoS routi ng. The comparison of the three QoS routing protoco ls MBRR (Majority Based Re-Routing), REAR (Reliable Energy Aware Routing) a(Stateless Protocol for End-to-End Delay) on the basis of various performance metrics such as Bit Error Rate (BER) vs . Signal-to-Noise Ratio (SNR), Average End-to-End D elay vs. BER, Packet Delivery Ratio vs. BER, Energy Consumed vs. BER, Ne twork Lifetime vs. Energy Consumption, Throughput vand Throughput vs. SNR has been done in this research paper. On th e basis of observed simulation results, it is concluded that the performance of MBRR is better than the performance of other two co mparing protocols i.e. REAR and SPEED.

Boundary Level Based Stable Node-disjoint Multipath QoS Routing Protocol for Mobile Ad hoc Networks

Boundary Level Based Stable Node-disjoint Multipath QoS Routing Protocol for Mobile Ad hoc Networks

PSO-Based Trust QoS Routing Algorithm for Wireless Sensor Networks

The existing routing algorithm of Wireless Sensor Networks (WSNs) pays more attention to the energy efficient. However, Quality of Service (QoS) supported and the validity of packet transmission unveil additional challenges. Based on the Particle Swarm Optimization (PSO), this paper presents a trust QoS routing algorithm for WSNs. Hierarchical structure is adopted and the trust value of the node is constructed with the direct trust value and the indirect trust value. In addition, delivery delay and packet loss are considered as main QoS metrics. Finally, under the optimization ability of PSO, the proposed algorithm tries to find the route with maximum residual energy and reliability in order to maximize network utilization as well as meets QoS constraints. Compared to typical routing algorithms in sensor networks, this new algorithm has better performance.

One QoS Routing Algorithm for Load Balancing in IP Backbone Networks: Design and Simulation

Quality of Service (QoS) routing is intent to find feasible routes according to QoS constraints and optimize utilization of whole network resources. In order to solve bandwidth-guaranteed QoS routing problem, a simple but effective routing algorithm based on precomputation scheme with load balancing consideration, is proposed. The algorithm is implemented and simulated using Network Simulator (NS2). Research results showed that the proposal can keep some links free from becoming bottlenecks earlier, avoid congestion caused by unbalanced traffic load distribution, and improve performance of IP backbone networks.

Elitist Distance Based Pareto Genetic Unicast Routing Scheme with Always Best Connected Support

In this paper, an ABC (Always Best Connected) supported QoS (Quality of Service) unicast routing scheme is proposed. In the proposed scheme, in order to overcome difficulties on accurately measuring network link parameter values and exactly expressing user QoS requirements, the knowledge of the fuzzy mathematics and probability theory is introduced, and the range is used to describe these parameters; both of the users utility and the network providers utility are computed, and gaming analysis is taken to deal with profits of both the user and the network provider; EDPGA (Elitist Distance-based Pareto Genetic Algorithm) is used to find the specific QoS unicast path with Pareto optimum under Nash Equilibrium among all parties utilities achieved or approached. While comparing with unicast routing scheme based on Dijkstra and the game theory based fuzzy unicast QoS routing scheme, simulation results show that this proposed scheme is both feasible and effective.

Population Adaptive Immune Algorithm Based Trustworthy QoS Routing Algorithm

The trustworthiness of data transmission is a very important parameter in the future network. In this paper, considering the optimal ability of population adaptive immune and the trustworthiness demand of the network, a trustworthy QoS routing algorithm is proposed. The interval is used to describe the user requirement in order to adapt to the fuzziness of the user QoS and trust demand, and the sliding window is adopted to implement the trust evaluation and control mechanism. With satisfaction degree function introduced, it tries to find the optimal path which satisfies the user requirement based on population adaptive immune algorithm. The simulation results show that the proposed algorithm is both feasible and effective.

Energy efficient and QoS aware routing protocol for Clustered Wireless Sensor Network

In this paper, a protocol called Energy Efficient and QoS aware Routing (EEQR) protocol for Clustered Wireless Sensor Network is proposed. To ensure QoS for different traffic types, prioritization of data is done based on message type and content. To address energy efficiency (hotspot problem) and high end-to-end delay problem, a combination of mobile and static sink is used for data gathering. Delay sensitive message are sent through the static sink and delay tolerant message are send through the mobile sink. Consequently, EEQR incurs less end-to-end delay, is energy efficient as well as able to ensure QoS. To evaluate the performance of the proposed strategy, intensive simulations are carried out. Performance of the proposed strategy is compared with the static sink and mobile sinks strategies. The results demonstrated that EEQR has prolonged the network and coverage lifetime, as well as has improved the other QoS routing parameters, such as delay, packet loss ratio, and throughput.

A QoS Routing Protocol with Bandwidth Allocation in Multichannel Ad Hoc Networks

Mobile multimedia applications have recently generated much interest in mobile ad hoc networks (MANETs) supporting quality-of-service (QoS) communications. Multiple non-interfering channels are available in 802.11 and 802.15 based wireless networks. Capacity of such channels can be combined to achieve higher QoS performance than for single channel networks. The capacity of MANETs can be substantially increased by equipping each network node with multiple interfaces that can operate on multiple non-overlapping channels. However, new scheduling, channel assignment, and routing protocols are required to utilize the increased bandwidth in multichannel MANETs. In this paper, we propose an on-demand routing protocol M-QoS-AODV in multichannel MANETs that incorporates a distributed channel assignment scheme and routing discovery process to support multimedia communication and to satisfy QoS bandwidth requirement. The proposed channel assignment scheme can efficiently express the channel usage and interference information within a certain range, which reduces interference and enhances channel reuse rate. This cross-layer design approach can significantly improve the performance of multichannel MANETs over existing routing algorithms. Simulation results show that the proposed M-QoS-AODV protocol can effectively increase throughput and reduce delay, as compared to AODV and M-AODV-R protocols.

Multiple Constrained QoS Routing Algorithm Based on Genetic Algorithm in Overlay Network

How to depend on different services provide different guarantee of QoS, and to ensure the effective use of network resources will become an important task in overlay network. In this paper, we consider constraints of network bandwidth, delay, loss rate, cost ,and base on the resources of current global network, as well as user-specific QoS metric needs to choose the best QoS route based on genetic algorithm. Experiments show that the algorithm is feasible in overlay network routing,and it has the better global load balancing capabilities.

A Multiple Constrained QoS Routing Algorithm for the Wireless Sensor Networks

Routing problem is one of the most important issues to a wireless sensor network (WSN). It is the key problem to find an efficient energy strategy for prolonging network's lifetime because power supply might be impossible. This paper discusses the multicast routing problem of WSN with multiple QoS constraints, which may deal with the delay, bandwidth, hop count and packet reception rat and surplus energy metrics, and finds a minimum resource consumption path while satisfying multiple constraints optimization conditions, and describes a network model for researching the multicast routing problem. It presents a dynamic multicast routing algorithm with multiple QoS constraints (MCQoSRA). The MCQoSRA successfully solves the QoS routing problems when multicast nodes change dynamically in the networks. The MCQoSRA only requires the local state information of the link (or node), but does not require any global network sate to be maintained. In MCQoSRA, a multicast group member can join or leave the multicast session dynamically. The MCQoSRA can effectively decrease the overhead for constructing a multicast tree and the delay of the nodes, and improve the success ratio of seeking links. Simulation results show that the MCQoSRA provides an available means to implement multicast routing, and adapt to all kinds of the topology networks, and have better expansibility.

A Hierarchical QoS Routing Protocol for the Wireless Sensor Networks

The large wireless sensor networks are often structured hierarchically by grouping nodes into different domains in order to deal with the scaling problem. This paper proposes a new protocol called hierarchical QoS routing protocol (HQRP) that achieves scalability by organizing the network as a hierarchy of domains using the full-mesh aggregation technique. In HQRP, each local node just only needs to maintain local routing and summary information of other domains, but does not requires any global states maintained. The HQRP uses a Reverse Best Metric Path Forwarding approach with hierarchical, topological and QoS forwarding conditions to construct the multicast tree while minimizing message overhead and satisfying delay-bandwidth and minimum energy consumption. The paper presents proof of correctness and complexity analysis of the HQRP. Simulation results show very good performance in terms of success ratio and message overhead.

A Energy-Aware QoS Routing Protocol for Wireless Sensor Networks

As the different QoS requirements of different businesses in wireless sensor networks, we proposed a QoS routing algorithm-EAQoS. The algorithm built multiple paths to sink node by recording the minimum hops of neighbors to sink. Then data was sent by the path that satisfied its QoS requirements and had enough residual energy. According to the comparisons with the SAR routing algorithm, this algorithm has obvious advantages in providing different services and prolonging the lifetime of network.

A QoS Routing Protocol Based on ACO in Wireless Multimedia Sensor Network

In view of the complexity, higher power consumption and other shortcomings of current wireless multimedia sensor networks (WMSN)QoS routing protocol algorithm, this paper proposes the Ant Colony Optimization (ACO) to improve the WMSN routing protocol. First of all, a routing model for multimedia sensor networks QoS was presented and then a routing algorithm (WMSN-ANT) was brought forward, which uses the network restrict condition to update the pheromone concentration. The forward ants (Fant) collects the link bandwidth, delay, packet loss rate and other parameters, along with the elite strategy for the ant system to update the local node of the network state model and the pheromone of each visited node in order to find the best routing under the conditions of multiconstrained QoS. The simulation results show that the algorithm is characterized by the distributed network routing optimization and has better convergence than the traditional QoS routing protocol and can significantly improve the network lifetime.

Joint Power Allocation and Routing in Full-Duplex Relay Network: An Outage Probability Approach

In this paper a power optimal routing is investigated in fading wireless channels. The fading distribution of the channel is modeled by Nakagami-m, and the outage capacity of full-duplex decode-and-forward (FD-DF) relaying is taken as QoS constraint. In this QoS routing algorithm, the weighted power sum of relay nodes is minimized while the end-to-end link outage probability is kept below a threshold. Firstly, the weighted power sum minimization problem for a static multi-hop route is formulated and solved in closed form for low outage probability. Then a routing metric is extracted from the minimized power sum of a static route which results in optimal routing method, implemented by dynamic programming algorithms like Bellman Ford. The proposed power optimal routing is evaluated by comparing its performance to other strategies with Monte Carlo simulations.

Study on Qos Routing Algorithm of Wmsns Based upon Data Fusion

Study on Qos Routing Algorithm of Wmsns Based upon Data Fusion

Research on the QoS Routing Protocol Based on ACO Algorithm

Wireless multimedia sensor network routing protocols based on ant colony optimization algorithm (ACOQoS) is proposed. Based on the existing routing protocol design concept, and the actual needs of QoS from each network layer of wireless multimedia sensor networks, the protocols use the Agent collection method to select cluster head node, from the perspective of the balance network load. And maximize the network lifetime by balanced use of energy of the whole network.

Multi-path Stable QoS Routing for Real-time Traffic Applications in MANET

mobile ad hoc networks (MANET), the existing routing protocols consider the routing metrics such as bandwidth, delay and link stability in partial manner. Also the real time and non- real time traffic flows are not distinguished based on delay and bandwidth requirements. In order to overcome these issues, in this paper multipath stable QoS routing for real time traffic in MANET is proposed. In this technique, multiple paths are discovered among source and destination. Among the discovered routes, the optimal paths are selected based on bandwidth constraints, delay constraints and path stability. When any flow request is received, it is initially categorized as real time and non-real time flows where real time flows are given higher priority. For real time flows, bandwidth and delay constrained paths are chosen. For non-real time flows, the stable paths are chosen. By simulation results, the proposed approach is validated and the approach minimizes delay and overhead.

A light-weight trust-based QoS routing algorithm for ad hoc networks

In a mobile ad hoc network (MANET), the lack of a trusted infrastructure makes secure and reliable packet forwarding very challenging, especially for providing QoS guarantee for multimedia applications. In this paper, we firstly introduce the concept of trust and QoS metric estimation into establishing a trust-based QoS model. In this model, we estimate the trust degree between nodes from direct trust computation of direct observation and indirect trust computation by neighbors’ recommendations. On the other hand, due to the NP-completeness of the multi-QoS constraints problem, we only take into account link delay as the QoS constraint requirement. Then, we design a trust-based QoS routing algorithm (called TQR) from the trade-off between trust degree and link delay. At last, by using NS2 we implement this algorithm based on AODV (Ad hoc On-demand Distance Vector). We compare its performance with AODV, Watchdog-DSR and QAODV. The simulation results show that TQR scheme can prevent attacks from malicious nodes and improve the security performance of the whole network, especially in terms of packet delivery ratio, average end-to-end delay, routing packet overhead and detection ratio of malicious nodes.

A link-state QoS routing protocol based on link stability for Mobile Ad hoc Networks

In this paper, we propose a new mechanism to establish stable and sustainable paths between all pairs of nodes in a Mobile Ad hoc Network. In this mechanism, we use a stability function as the main path selection criterion based on the calculation of the mobility degree of a node relative to its neighbor. We applied this mechanism on the OLSR protocol (Optimized Link State Routing Protocol) to elect stable and sustainable MPR (Multipoint relays) nodes and topology. This mechanism significantly minimizes the recalculation of MPR and the routing tables recalculation process. Moreover, it guarantees other QoS (Quality of Service) metrics such as the packet loss and the response time. The simulation results show the effectiveness of our mechanism and encourage further investigations to extend it in order to guarantee other QoS requirements.