QoS Routing Research Articles

On Designing Thermal-Aware Localized QoS Routing Protocol for in-vivo Sensor Nodes in Wireless Body Area Networks.

In this paper, we address the thermal rise and Quality-of-Service (QoS) provisioning issue for an intra-body Wireless Body Area Network (WBAN) having in-vivo sensor nodes. We propose a thermal-aware QoS routing protocol, called TLQoS, that facilitates the system in achieving desired QoS in terms of delay and reliability for diverse traffic types, as well as avoids the formation of highly heated nodes known as hotspot(s), and keeps the temperature rise along the network to an acceptable level. TLQoS exploits modular architecture wherein different modules perform integrated operations in providing multiple QoS service with lower temperature rise. To address the challenges of highly dynamic wireless environment inside the human body. TLQoS implements potential-based localized routing that requires only local neighborhood information. TLQoS avoids routing loop formation as well as reduces the number of hop traversal exploiting hybrid potential, and tuning a configurable parameter. We perform extensive simulations of TLQoS, and the results show that TLQoS has significant performance improvements over state-of-the-art approaches.

A Distributed Adaptive Admission Control Scheme for Multimedia Wireless Mesh Networks <xref ref-type="fn" rid="fn1"/>

Due to recent advances in wireless technologies, wireless mesh networks (WMNs) are expected in the near future to fully handle content-rich multimedia services with various quality of services (QoS) guarantee. Unlike traditional data applications, multimedia applications require QoS support in order to satisfy the user's service requirements. Admission control has been advocated as a promising approach to tackle this challenging issue since it is a key management function for which a new flow is admitted based on the condition that the QoS requirements of all flows in the network can still be met after the new flow begins. In this paper, a Rate Adaptive Routing on Cliques Admission Control protocol (so-called RA-RCAC) for WMNs is proposed, which is able to provide feedbacks to the application layer whenever congestion occurs in the network. The RA-RCAC scheme merges the design features of two chosen benchmarking schemes, namely, an Interference-Aware Admission Control and QoS routing protocol in WMN (so-called IAAC) and a distributed admission control protocol for WMNs (so-called RCAC) to produce a protocol design that satisfies the QoS guarantee. Our proposed RA-RCAC protocol is evaluated using simulation analysis. The performance evaluation results demonstrate its superiority over the aforementioned benchmark schemes in terms of throughput, end-to-end delay, packet delivery ratio, and loss ratio performance evaluation metrics.

A Quality-of-Service Routing Protocol with Supplementary Cooperation for Wireless Ad Hoc Networks

End-to-end quality-of-service (QoS) in wireless multihop ad hoc networks is a challenging issue, especially when the wireless channels suffer from time-varying fading. In this paper, we develop a spatial-reuse time-division multiple access (STDMA)-based QoS routing protocol, named supplementary-cooperation routing (SC-routing). SC-routing can provide the service guarantee of target data rate and maximum end-to-end outage probabilities for data flows in the multihop ad hoc networks. For each arriving data flow, SC-routing determines a route, and schedules STDMA slot and transmit power to each link of this route. To effectively combat the fading channels, SC-routing employs supplementary cooperation, which utilizes cross-hop overhear to gain transmit diversity, and thus saves the relay transmission in usual cooperative communication. Simulation results show the network capacity can be improved by incorporating transmit diversity into end-to-end transmission.

QoS Routing Protocol with Multiple Node-Disjoint Paths in Ad Hoc Networks

Quality-of-service (QoS) routing in dynamic, wireless multi-hop ad hoc networks is a critical research issue, and various QoS protocols are proposed. However, those QoS routing protocols rarely provide multiple routes. Once links break, it takes time and brings large control overhead to establish new routes. This paper proposes a new QoS routing protocol, containing efficient bandwidth estimations, admission control and node-disjoint multi-path establishment. While detecting link breaks, we use back-up routes to avoid making wasteful route discovery. If a single route with sufficient bandwidth cannot be discovered, we propose to combine multiple routes to support QoS transmission. Simulation results show that the proposed QoS routing protocol increases throughput while provides satisfactory QoS.

An Intersection-based QoS Routing in Vehicular Ad Hoc Networks

Vehicular Ad hoc Networks (VANET) face many challenging issues because of the rapid topology changes, frequent network partitions, and complicated urban environments. These special VANET characteri...

A multi-objective routing algorithm for Wireless Multimedia Sensor Networks

In this paper, a new multi-objective approach for the routing problem in Wireless Multimedia Sensor Networks (WMSNs) is proposed. It takes into account Quality of Service (QoS) requirements such as delay and the Expected Transmission Count (ETX). Classical approximations optimize a single objective or QoS parameter, not taking into account the conflicting nature of these parameters which leads to sub-optimal solutions. The case studies applying the proposed approach show clear improvements on the QoS routing solutions. For example, in terms of delay, the approximate mean improvement ratios obtained for scenarios 1 and 2 were of 15 and 28 times, respectively.

AQTR: The Ant Based Qos Aware Improved Temporally Ordered Routing Algorithm for MANETs

Mobile ad hoc network is an autonomous system of mobile nodes connected by wireless links. Here the node acts as both router and host. The node moves unpredictably and randomly. Due to this nodal mobility routing in MANET is a very challenging issue. Routing is the act of moving information across the network from source to destination. In case of MANET it is very difficult due to dynamic topology, limited resources, limited energy of nodes, different QoS requirements. Providing QoS routing in MANET is an important task an also it is a challenging task to find paths which satisfies user's QoS requirements. In this paper we have developed AQTR, a new energy efficient ant colony optimization QoS aware on-demand multipath routing algorithm for MANETs. It is a modification of classical temporally ordered routing which reduces the control overhead and it has better route failure management technique.

Network Coding Aware QoS Routing for Wireless Sensor Network

This paper proposes a network coding aware QoS (quality of service) routing (NCQR) for wireless sensor network, which exploits network coding technology to improve the QoS routing of wireless sensor network. Network coding condition with QoS constraint is proposed, which provides proof for coding opportunity detection. To facilitate the evaluation of discovered routes, a novel routing metric, called CQRM (coding aware QoS routing metric), is presented, which jointly considers link quality, node congestion and coding opportunity. Simulation results demonstrate that NCQR decreases the blocking ratio of QoS requests significantly and prolongs network lifetime. Index Terms—Wireless sensor network; QoS; routing algorithm; network coding aware

Quality of Service Routing in Manet Using a Hybrid Intelligent Algorithm Inspired by Cuckoo Search.

A hybrid computational intelligent algorithm is proposed by integrating the salient features of two different heuristic techniques to solve a multiconstrained Quality of Service Routing (QoSR) problem in Mobile Ad Hoc Networks (MANETs) is presented. The QoSR is always a tricky problem to determine an optimum route that satisfies variety of necessary constraints in a MANET. The problem is also declared as NP-hard due to the nature of constant topology variation of the MANETs. Thus a solution technique that embarks upon the challenges of the QoSR problem is needed to be underpinned. This paper proposes a hybrid algorithm by modifying the Cuckoo Search Algorithm (CSA) with the new position updating mechanism. This updating mechanism is derived from the differential evolution (DE) algorithm, where the candidates learn from diversified search regions. Thus the CSA will act as the main search procedure guided by the updating mechanism derived from DE, called tuned CSA (TCSA). Numerical simulations on MANETs are performed to demonstrate the effectiveness of the proposed TCSA method by determining an optimum route that satisfies various Quality of Service (QoS) constraints. The results are compared with some of the existing techniques in the literature; therefore the superiority of the proposed method is established.

Emergent Intelligence Based QoS Routing in MANET

Mobile Ad hoc Networks (MANETs) are self-organized, infrastructureless, decentralized wireless networks consist of a group of heterogeneous mobile devices. Due to the inherent characteristics of MANETs, such as frequent change of topology, nodes mobility, resource scarcity, lack of central control, etc., makes QoS routing is the hardest task. QoS routing is the task of routing data packets from source to destination depending upon the QoS resource constraints, such as bandwidth, delay, packet loss rate, cost, etc. In this paper, we proposed a novel scheme of providing QoS routing in MANETs by using Emergent Intelligence (EI). The EI is a group intelligence, which is derived from the periodical interaction among a group of agents and nodes. We logically divide MANET into clusters by centrally located static agent, and in each cluster a mobile agent is deployed. The mobile agent interacts with the nodes, neighboring mobile agents and static agent for collection of QoS resource information, negotiations, finding secure and reliable nodes and finding an optimal QoS path from source to destination. Simulation and analytical results show that the effectiveness of the scheme.

Multiconstrained QoS Routing Using a Differentially Guided Krill Herd Algorithm in Mobile Ad Hoc Networks

This paper presents a multiconstrained quality-of-service routing (QoSR) based on a differentially guided krill herd (DGKH) algorithm in mobile ad hoc networks (MANETs). QoSR is a NP-complete and significant problem with immense challenges in determining an optimum path that simultaneously satisfies various constraints in MANETs, where the topology varies constantly. Various heuristic algorithms are widely used to solve this problem with compromise on excessive computational complexities and/or low performance. This paper proposes a krill herd based algorithm called DGKH, where the krill individuals do not update the position in comparison with one-to-one (as usual), but instead it uses the information from various krill individuals and then searches to determine a feasible path. Experiment results on MANETs with different number nodes (routes) are considered with three constraints which are maximum allowed delay, maximum allowed jitter, and minimum requested bandwidth. It is demonstrated that the proposed DGKH algorithm is an effective approximation algorithm exhibiting satisfactory performance than the KHA and existing algorithms in the literature by determining an optimum path that satisfies more than one QoS constraint in MANETs.

Survey of QoS Routing Protocols in Wireless Multimedia Sensor Networks

The emergence of Wireless Multimedia Sensor Networks (WMSNs) has stimulated the refocusing of research from conventional scalar Wireless Sensor Networks (WSNs) to WMSNs. Currently, because of their prevalence WMSNs are used in different applications. Due to the unique features of WMSNs, fulfilling Quality of Service (QoS) requirements for a variety of applications is the challenge. QoS routing is a backbone of WMSNs and plays a vital role in satisfying QoS requirements. The performance of QoS routing depends upon the selection of an optimal path or paths. Path selection is based on evaluation of a cost function using various routing metrics. A careful blend of such metrics in a routing cost function guarantees a committed level of QoS. This survey uses number of routing metrics as criteria for categorizing state-of-the-art QoS WMSNs routing techniques. In addition, open issues and future research directions to further develop efficient routing protocols to guarantee QoS are discussed.

Innovating Multicast Tree and Artificial Algorithms for Service Based Routing

In advance network we may use service Based Routing (SBR), so data is transmitted from a source node to destination nodes are not depended on destination addresses. So, it may be comfortable with new advanced technology as cloud computing and also flexible and reliable. Multicast routing is advanced technique to deliver data simultaneously from one source node to multiple destination nodes with QOS (quality of service). In this paper, we introduce a technique that is extended from multicast technique with multiple multicast trees that are conformed quality of service routing and multiple path routing. It also guarantees QOS of routes such as bandwidth. This technique is based on Greedy, Ant Colony Optimization, artificial neural network and fuzzy logic to get optimal routes to transmit data from one source to multiple destination node very effectively. The usage of the ANT Colony optimization, Greedy, fuzzy logic algorithms to find cyclic or multiple paths routes on each trunk by multiple criterions to transmit data effectively.

Apply R<sup>+</sup> Tree to Make Hierarchical Cluster Routing with QOS Guarranteed by Multiple Paths and Multicast Routing

In the new era of communication and network technologies, a routing protocol not only operates on some lower levels of a network protocol. It also operates on the application layer the highest-level layer in network protocol stack. So we call this is upper layer routing protocol. But it must be based on lower layers to make routing decisions. But normal routing protocols are used for most static network or rather small wireless networks or not high mobility networks. In mobile ad-hoc networks, nodes move very often and fast, so bandwidth of connection between them can be reduced. Therefore the transmission delay may be increased. The paper aims at purpose to increate QOS routing by hierarchical clustering routing by using R⁺ tree in addition with some advanced techniques multicast routing, multiple paths, use GEN/ BEE/ ANT to optimize routes to transmit data.

Multipath QoS Routing for Traffic Splitting in MANETs

Abstract Mobile ad hoc networks (MANETs) are characterized by its dynamic topology which has limited channel bandwidth and limited power at the nodes. Because of these characteristics in the MANETs the paths connecting source nodes with destinations may be very unstable and go down at any time, making communication over mobile ad hoc networks difficult. To overcome these issues, in this paper, we propose a Multipath QoS Routing protocol for traffic splitting in MANET. In this protocol, initially multiple disjoint paths are discovered and the data packets are transmitted through the path which satisfies the routing constraints based on bandwidth, delay and path stability. If the path does not satisfy the routing constraints, then the traffic can be distributed along the multiple disjoint paths, using the Traffic Splitting algorithm. By simulation results, we show that the proposed protocol reduces the packet drop and delay with improved throughput.

QoS Route Optimization Algorithm for the Dynamic Traffic and Network Service

Transforming the convolution to the (+,-) in legend domain is proposed in this paper. Based on the transformation, the Legend Transformation of service curve and arrive curve is given in the case of independent cross traffic, and the closed expression of stochastic delay and stochastic backlog is obtained. In the paper, we analyze influence of the dynamic of traffic and network to QoS parameter. Based on the analysis result, the QoS analysis in Legend domain is given, and the upper bound of delay and backlog in Legend domain. For the case of non-independent cross traffic, the relationship expression of different traffic is got. And simulation proves that the route optimization algorithm is correct.

Research on Cloud Computing QoS Routing based on Improved Ant Colony Algorithm

Multicast routing issue under the condition of cloud computing is an NP problem, mainly involving task delay, actual bandwidth, network packet loss rate and other factors with constraint problems. Ant colony algorithm is an intelligent algorithm to solve NP problem, but it is featured by long search time and vulnerability to fall into local optimum. Therefore, this paper modifies the pheromone and introduces fitness function, so that the improved algorithm is superior to ant colony algorithm in performance. Further simulation experiments show that the presented algorithm has good performance and good results in route scheduling under the cloud computing.

Application and Network Layers Design for Wireless Sensor Network to Supervise Chemical Active Product Warehouse

Wireless sensor networks have profound effects on many application fields like security management which need an immediate and fast system reaction. Indeed, the monitoring of a dangerous product warehouse is a major issue in chemical industry field. This paper describes the design of chemical warehouse security system using the concept of active products and wireless sensor networks. A security application layer is developed to supervise and exchange messages between nodes and the control center to prevent industrial accident. Different security rules are proposed on this layer to monitor the internal state and incompatible products distance. If a critical event is detected, the application generates alert message which need a short end to end delay and low packet loss rate constraints by network layer. Thus, a QoS routing protocol is also developed in the network layer. The proposed solution is implemented in Castalia/OMNeT++ simulator. Simulation results show that the system reacts perfectly for critical event and can meet the QoS constraints of alert message.

QOS by Priority Routing in Internet of Things

The aim of this study is to present a system which uses a new layered network architecture approach for IOT. Sudden and unpredictable large-scale changes are commonly prevalent in Internet of Things (IoT). The images or video data captured from the remote places have to be routed without delay. This is a tumultuous task in large scale. By using an Agents in various wireless networks and the packets are routed depends on the priority. The scope of this study is to avoid delay, interference during transfer of data from various wireless networks. This study deals with (i) congestion free data transfer under many cramped networks (ii) low processing overhead (iii) handling realistic failure scenarios, prioritized traffic in a flexible manner (iv) robust to both topology failures and traffic variations. This study presents a QoS routing method, by setting a priority to the networks to differentiate eclectic sensing vicinities in the smart space between sender and receiver.

QoS Routing Algorithm of WSN for Smart Distribution Grid

Recently, Wireless Sensor Network has drawn wide attention on collecting and communicating data for Smart Distribution Grid (SDG). In order to establish a routing system satisfying the latency and reliability requirements of smart distribution grid, a novel routing algorithm with layered cooperative processing and QoS Guarantee Control function is presented in this study. By researching link reliability and path delay estimation method, optimized latency and link quality routing decision method, and on-demand and priority-based buffer queue execution method, the end-to-end data transmission performance of WSN for SDG communication are optimized. The simulation results indicate that our routing protocol can provide QoS for SDG according to their requirements.