QoS Routing Protocol Research Articles

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.

A Novel QoS Routing Algorithm in Wireless Mesh Networks

With the rapid development of information technology, people’s daily life becomes more and more dependent on wireless technologies. Wireless mesh network consists of a number of characteristics associated with the return path, with a strong fault tolerance, stability, widely used by the light to the city network construction, military applications, and key service providers and other fields. Compared with traditional wired communication technologies, how to provide qualified QoS routing service is a primary problem for wireless mesh networks waiting for effective solution. Regarding this problem, this paper applys the theory of Evolutionary Game to QoS routing algorithm for wireless mesh networks and proposed a novel algorithm called EGWRA which can not only improve the performance of traditional QoS routing protocols but also be able to reduce the cost of the routing algorithm. DOI: http://dx.doi.org/10.11591/telkomnika.v11i3.2321

Study on QoS Routing Protocol for New Wireless Mesh Networks

A QoS aware routing protocol for Wireless Mesh Networks is studied in this paper, the QoS metrics taken into account are bandwidth in our studies, end to end delay and stability of the routes. The routing metric reflects the maximal available bandwidth of a routing path, which is calculated based on the available bandwidth of mesh nodes with the consideration of the interference caused by the hidden terminals in WMNs. With the help of admission control decision, QRBC uses the routing metric in the route discovery process to find a QoS guarantee route for the real-time applications. The simulation results demonstrate that the QRBC protocol can find a less interfering and bandwidth guaranteed routing path for real-time flows.

QoS and Energy Aware Cooperative Routing Protocol for Wildfire Monitoring Wireless Sensor Networks

Wireless sensor networks (WSN) are presented as proper solution for wildfire monitoring. However, this application requires a design of WSN taking into account the network lifetime and the shadowing effect generated by the trees in the forest environment. Cooperative communication is a promising solution for WSN which uses, at each hop, the resources of multiple nodes to transmit its data. Thus, by sharing resources between nodes, the transmission quality is enhanced. In this paper, we use the technique of reinforcement learning by opponent modeling, optimizing a cooperative communication protocol based on RSSI and node energy consumption in a competitive context (RSSI/energy-CC), that is, an energy and quality-of-service aware-based cooperative communication routing protocol. Simulation results show that the proposed algorithm performs well in terms of network lifetime, packet delay, and energy consumption.

MAC and Routing Layer Supports for QoS in MANET: A Survey

In Mobile ad hoc networks (MANET), Providing QoS guarantee is difficult task due to unreliable Wireless nature of Link, Mobility, Lacking of Centralized Coordination and Channel contention. For Real-time applications (such as video, audio) QoS is More important on transmissions. Many efforts are put on ad hoc networks at both the MAC and routing layers Meanwhile, QoS aware issues are considered in both MAC and routing layers for ad hoc networks. However QoS can ensure by Admission control protocols and reservation mechanisms. This paper aims to investigate factors affecting QoS, admission control protocols, QoS routing protocols, reservation mechanisms, and MAC Layer QoS Supports. This is also aims to provide deep view of QoS in MANET Of current and Future trends.

Performance analysis of QoS routing protocol for WiMedia networks

Though the WiMedia supports higher data rates than other WPAN technologies, a WiMedia device cannot reach other devices that are separated from it by more than 10 m, which is the typical limited transmission range of the WiMedia protocol. In this work, we propose a multi-hop QoS routing protocol to enable WiMedia devices to transmit real-time data to devices that are located out of the transmission range. The proposed routing protocol is a hybrid algorithm, which mixes the table-driven and on-demand routing algorithms, searching one or more routes according to the number of hops to a destination device. WiMedia MAC is potentially capable of learning the existence of neighbor devices by using a beacon frame. By utilizing the neighbors’ information, all devices can create routing entries for devices within 2-hops periodically. For devices beyond the 2-hop range, the newly designed on-demand routing algorithm is applied to multi-hop routing. If a routing entry for a destination device is not listed in the routing table, the source device sends a request packet to 2-hop range devices which could be found in the routing table. Since every device maintains routing entries for 2-hop range devices in the routing table, the request packet is replied in advance before its arrival at the destination device. Also, to decide the optimal route for a destination device, the number of medium access slots (MASs), received signal strength indicator (RSSI) and hop count are utilized to establish a QoS-enabled routing table. We perform ns-2 simulation to investigate the performance of the proposed routing protocol with AODV and DSDV. The simulation results show that the proposed protocol has better throughput and lower overhead than other protocols.

Fuzzy Cost based Power Aware QoS Routing Protocol with Mobility Prediction in Mobile Ad Hoc Networks

Fuzzy Cost Based Power Aware QoS Routing (FCPAQR) protocol proposed to select an optimal path by considering multiple independent QoS metrics. Fuzzy inference rule which is used to calculate the QoS based fuzzy cost of each link to forward the data packets effectively and efficiently. Fuzzy cost is calculated based on various QoS Constraints. QoS constraints can be classified as Time Constraint (Delay and Jitter), Space Constraint (System Buffer), Frequency Constraint (System Bandwidth) Reliability Constraint (Error rate) [9]. Link Expiry Time(LET) and Energy Level are also additionally taken into account. Considering multiple QoS Constraints provide better result than taking single constraint into account. General Terms

Adhoc on Demand Multipath Reliable and Energy Aware Quality of Service Routing for Mobile Adhoc Networks

Problem statement: In a mobile adhoc network, there are a number of challenges for providing quality of service routing for multimedia applications and real time applications like voice transmission. The QoS parameters considered in this study are link reliability and energy consumption. Existing studies estimate the link reliability constraint between two nodes using exponentially distributed epoch lengths. The major problem in this approach is that the nodes are having memoryless property and the hazard rate is independent of time. Approach: In study, an analytical expression is proposed to estimate the link reliability of MANET when the nodes have identical weibull distribution where the hazard rate is a function of the time. Adhoc On Demand Multipath Reliable and Energy Aware QoS Routing (AOMP-REQR) protocol is designed by including the QoS constraints (Link Reliability and Energy Consumption) in the existing protocol AOMDV, which finds the multiple link disjoint stable paths. Results: Simulation results show that the proposed algorithm achieves better packet delivery ratio with reduced energy consumption and delay. Conclusion: Since the proposed analytical method estimates the link reliability in better way, AOMP-REQR protocol finds the multiple link disjoint stable paths and also the energy consumption is less.

WiMedia를 위한 멀티홉 라우팅 프로토콜 개발 및 성능분석

Though WiMedia supports the higher data rates than other WPAN technologies, a WiMedia device cannot reach other devices which are apart from it more than 10 meter; the limited transmission range of the WiMedia protocol. In this paper, we propose a multi-hop QoS routing protocol to enable WiMedia devices to transmit real-time data to devices that is located out of transmission range. The proposed routing protocol is a hybrid routing protocol, which is the mixed protocol of table-driven and on-demand routing algorithm. In the proposed protocol, a route for a device within 2-hop is established by using the table-driven routing algorithm and a route for the device beyond 2-hop is established by using the on-demand routing algorithm. We perform ns-2 simulation to investigate the performance of the proposed routing protocol with AODV and DSDV. The simulation results show that the proposed protocol`s performance is better than AODV and DSDV in terms of the throughput and delay.

A QoS Routing Protocol for Mobile Ad Hoc Networks Based on Multipath

With the development of Ad Hoc networks, the demand of QoS becomes more and more than ever before, it is more important to provide QoS guarantee for multimedia application. Most of present QoS routing algorithm based on single path, which do not take full advantage of resource of networks. This paper proposes a QoS-based multipath routing protocol for Ad Hoc network. Routing mechanism is described in detail and node disjoint path algorithm is a key. New routing protocol takes bandwidth and delay constraint into account, it can find several paths to provide QoS guarantee. Also, it can simultaneously use the node disjoint paths to transmit application data flow. The results of experiment show new protocol can significantly increase the packet delivery ratio and decrease the average delay, the performance is better than other protocols. This paper provides a good idea to study further QoS routing protocol.

GMCAR: Grid-based multipath with congestion avoidance routing protocol in wireless sensor networks

Recently, the interest in wireless sensor networks has been magnetized in the delay sensitive applications such as real-time applications. These time critical applications crave certain QoS requirements as though end-to-end delay guarantee and network bandwidth reservation. However, the severe resource constraints of the wireless sensor networks pose great challenges that hinder supporting these requirements. In this paper, we propose a Grid-based Multipath with Congestion Avoidance Routing protocol (GMCAR) as an efficient QoS routing protocol that is suited for grided sensor networks. We employ the idea of dividing the sensor network field into grids. Inside each grid, one of the sensor nodes is selected as a master node which is responsible for delivering the data generated by any node in that grid and for routing the data received from other master nodes in the neighbor grids. For each master node, multiple diagonal paths that connect the master node to the sink are stored as routing entries in the routing table of that node. The novelty of the proposed protocol lies behind the idea of incorporating the grids densities along with the hop count into the routing decisions. A congestion control mechanism is proposed in order to relieve the congested areas in case of congestion occurrence. Simulation results show that our proposed protocol has the potential to achieve up to 19.5% energy saving, 24.7% reduction in the delay and up to 8.5% enhancement in the network throughput when compared to another QoS routing protocol. However, when compared to the basic grid-based coordinated routing protocol, it achieves 23% energy saving. In addition, the proposed protocol shows its superiority in achieving better utilization to the available storage.

Mobile Ad Hoc Networks: A detailed Survey of QoS Routing Protocols

This paper shows a detailed overview of QoS routing metrics, resources, and factors which are affecting performance of QoS routing protocols. The relative strength, weakness, and applicability of existing QoS routing protocols are also studied and compared. QoS routing protocols are classified according to the QoS metrics.

SQR-AODV: A STABLE QOS-AWARE RELIABLE ON-DEMAND DISTANCE VECTOR ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS

In a mobile ad hoc network (MANET), the topology of the network may change rapidly and unexpectedly due to mobility of nodes. Thus, setting up routes that meet high reliability is a very challenging issue. Another important problem in the MANETs is the energy consumption of nodes. When the energy of a node is depleted, it stops working thus links break. Hence it is very important to find a route that has sufficient energy level and high stability, and so can obtain reliable routing and data transmission. To address the aforementioned problems, we propose a reliable QoS routing protocol which bases on the route life time that is obtained using mobility information, the residue energy and hop count. Therefore in this scheme, data is sent through a route with high stability, high residue energy level and low latency. Simulation results show that the SQR-AODV protocol achieves high reliability and stability and also long life time of the network, with high packet delivery ratio, high throughput, low energy consumption and considerable load balancing as compared to best-known on-demand protocol, AODV. Key words: Mobile ad hoc network, routing, ad hoc on-demand distance vector, quality of service.

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.

Single phase admission control for QoS-routing protocol in ad hoc networks

In this paper, in order to fulfill real-time traffic requirements in ad hoc networks, a novel and effective single phase admission control (SPAC) scheme for QoS-routing protocols has been proposed. The SPAC scheme is based on the ad hoc on-demand distance vector (AODV) protocol with slight modifications of control packets; network congestions are avoided by a simple and precise admission control that blocks most of the overloading flow requests in the route-discovery process. System simulations show that the SPAC scheme and its performance is comparable to the contention-aware admission control protocol (CACP)-Multihop performance in all respects; the SPAC scheme is also simpler. As compared to a QoS-aware routing protocol employing either “listen” or “hello” scheme, the SPAC protocol offers higher throughput and remarkably less end-to-end delays under heavy loads.

ECBRP: An Efficient Cluster-Based Routing Protocol for Real-Time Multimedia Streaming in MANETs

The dynamic characteristics of wireless networks and stringent QoS requirements of multimedia applications identify significant challenges for providing QoS guarantees for real-time multimedia streaming in such wireless environment. QoS routing protocols can decisively contribute to the QoS provision of network systems. This paper proposes an efficient cluster-based routing protocol (ECBRP) for real-time multimedia streaming in mobile ad hoc networks. First, to improve the stability of clusterheads, we introduce a new algorithm of cluster formation, in consideration of the node mobility and connectivity. Second, a link-broken detection mechanism is designed, which is able to distinguish whether packet loss is due to mobility or congestion, and to make proper reaction. This mechanism contributes to reduce route overhead, and to increase the decodable ratio of video frame at the application layer as well. Third, the routing protocol is enhanced via an adaptive packet salvage strategy, in order to alleviate the congestion in consideration of the characteristics of multimedia traffic. Our simulation experiment results demonstrate that the ECBRP leads to more stable cluster formation than the CBRP, and 80% decreases in the frequency of clusterhead changes against CBRP. As a result, the quality of real-time multimedia streaming is improved significantly, in terms of decodable frame ratio, delay and delay jitter, etc.

Evaluation of Energy-Aware QoS Routing Protocol for Ad Hoc Wireless Sensor Networks

Evaluation of Energy-Aware QoS Routing Protocol for Ad Hoc Wireless Sensor Networks

QoSNET: An integrated QoS network for routing protocols in large scale wireless sensor networks

Numerous QoS routing strategies focus on end-to-end delays to provide time constrained routing protocols in wireless sensor networks (WSNs). With the arrival of wireless multimedia sensor networks, traffic can be composed of time sensitive packets and reliability-demanding packets. In such situations, some works also take into account link reliability to provide probabilistic QoS. The trade-off between the guarantee of the QoS requirements and the network lifetime remains an open issue, especially in large scale WSNs. This paper proposes a promising multipath QoS routing protocol based on a separation of the nodes into two sub-networks: the first part includes specific nodes that are occasionally involved in routing decisions, while the remaining nodes in the second sub-network fully take part in them. The QoS routing is formulated as an optimization problem that aims to extend the network lifetime subject to QoS constraints. Using the percolation theory, a routing algorithm is designed to solve the problem on the respective sub-networks. Simulation results show the efficiency of this novel approach in terms of average end-to-end delays, on-time packet delivery ratio, and network lifetime.

Aggregation-Based QoS Routing in the Internet

In this paper, we study the problem of QoS routing with two concave constraints in the Internet. We propose an efficient approach for computing the supported QoS across domains based on the aggregated intradomain topology. The time complexity of our approach is polynomial. Moreover, our approach can be incorporated in the distance-vector based routing protocol, such as BGP, the de facto inter- domain routing protocol in the Internet. Our simulation results show that our interdomain QoS routing protocol can successfully serve more than 80% of the total connection requests and is very scalable.

Performance Evaluation of Node Failure Prediction QoS Routing Protocol (NFPQR) in Ad Hoc Networks

The characteristics of ad hoc networks make the QoS support a very complex process unlike traditional networks. The nodes in ad hoc wireless networks have limited power capabilities. The node failure in the network leads to different problems such as network topology changes, network partitions, packet losses and low signal quality. Many QoS routing protocols like Predictive location based QoS routing protocol (PLBQR), Ticket based QoS routing, Trigger based distributed QoS routing (TDR) protocol ,Bandwidth routing(BR) protocol, Core extracted distributed routing (CEDAR) protocol have been proposed. However these algorithms do not consider the node failures and their consequences in the routing. Thus most of the routing protocols do not perform well in frequent or unpredictable node failure conditions. Node Failure Predication QoS Routing” (NFPQR) scheme provides an optimal route selection by predicting the possibility of failure of a node through its power level. The NFPQR protocol has been modified as C-NFPQR (Clustered NFPQR) in order to provide power optimization using clustered based approach. The performance of the NFPQR and C-NFPQR is evaluated through the same QoS parameters.