QoS Routing Protocol Research Articles

Analysis of clustered QoS routing protocol for distributed wireless sensor network

A wireless network is a collection of wireless nodes within decentralized and distributed network architecture. This distributed architecture gives rise to issues concerning resilience, node mobility, link failure, routing overhead and drop rate. To avoid these issues and satisfy QoS requirements, a new routing protocol known as clustered QoS routing protocol (CQRP) is proposed. This routing protocol creates a cluster with a grouping of nodes and assigns a cluster head. This cluster head is used to assign an available link for the wireless node to avoid issues with resilience and link failure. Cluster members communicate with data packets through the cluster head. Through the use of this cluster head, quality of service requirements for a distributed network can be met. Experimental results show that the performance of the proposed clustered QoS routing protocol CQRP increases throughput, delivery rate and network efficiency, and decreases the drop rate, delay and routing overhead.

English

English

FEQRP: a Fuzzy based Energy-efficient and QoS Routing Protocol over WSNs

In this paper, an energy efficient and QoS routing protocol; named Fuzzy based Energy-efficient and QoS Routing protocol (FEQRP) for wireless sensor networks; is proposed to extend the life time of the network. Most of the existing protocols don't take care about energy balancing. The energy manager protocols balance the energy consumption in the network to avoid network partitioning. The proposed protocol tries to find the best route with smallest distance between source and destination, reduce the energy consumption and balance it by fuzzy set approach. In FEQRP, both the node position and the energy level are used to route the packets from sources to destination. Each node knows the location and energy level of its neighbors.

A Qos Routing protocol based on AODV

A Qos Routing protocol based on AODV (QOSAODV) is proposed aiming at the problem of the traditional QoS routing protocol which can not be applied perfectly in VANET. The weakness of the AODV routing protocol mechanism and the protocol itself are represented. By the simulation, the effectiveness and feasibility were completely verified. QOSAODV shows the superior performances in effectively lowering the routing broke ratio as well as packet drop ratio significantly, meanwhile, increasing the network throughput and scale.

A Locality Based Clustering and M-Ant Routing Protocol for QoS in Wireless Sensors Networks

The advancement of research increases the interest of researchers to find solutions routing issues in Wireless Sensor Networks (WSN) and largely of the other routing protocols for WSN consider uniform nodes wherein, all sensor nodes have the same capabilities in terms of sensing, announcement and calculation capabilities. However, deployment of a homogeneous sensor network may suffer from poor performance. Clustering is an effective method for resource management regarding performance of the network, design of routing protocol, Quality of Service etc. In this paper, a novel Location Enhanced Cluster based QoS routing scheme is proposed to know the best possible routing schemes, depending on multiple optimization goals. This protocol locates the nodes and formation of cluster and cluster head selection is processed by Modified K means clustering algorithm. Then a Modified Ant Colony Optimization (MACO) technique is proposed for optimal routing which is in insensible to preliminary location, thus preeminent in the situation of Wireless Sensor Network (WSNs). We propose a location enhanced Clustering for cluster formation. Our protocol utilizes limited location information acquired by elegant antennas to determine routes and create direction-finding decisions for the clustered WSNs. The key feature of the protocol is its ability to meet different QoS requirements posed by dissimilar kind of traffic generated due to various natures of nodes thus maximizing network performance and consumption. Simulation results suggest a considerable increase in the performance of proposed protocol over existing protocol.

Link-Disjoint Interference-Aware Admission Control and QoS Routing Protocol for Mobile Adhoc Networks

In Mobile Adhoc Networks (MANETs) interferences diminish the network performances such as data failure, retransmission, conflict and delay. Hence, interferences are main factors that affect the network performances. Sinking interferences on the routing paths are crucial problem to enhance performances of the networks. Here, we proposed a protocol called Link-Disjoint Interference Aware (LDIA) QoS Routing Protocol based on MARIA Protocol. The capacity of networks in rigorously affects by interferences among links and numerous efforts to representation this effects make use of ‘Cliques’ structure in adhoc graphs. Here, we compared this simulation results in NS2 and analysis made for LDIA QoS Routing protocol and QoS Aware Routing Protocol (QoSAR).

Mobility and Bandwidth Aware QoS Routing Protocol for MANET

Mobility and Bandwidth Aware QoS Routing Protocol for MANET

A QoS-aware routing protocol with adaptive feedback scheme for video streaming for mobile networks

One of the major challenges for the transmission of time-sensitive data like video over mobile ad-hoc networks (MANETs) is the deployment of an end-to-end QoS support mechanism. Therefore, several approaches and enhancements have been proposed concerning the routing protocols. In this paper we propose a new QoS routing protocol based on AODV (named AQA-AODV), which creates routes according to application QoS requirements. We have introduced link and path available bandwidth estimation mechanisms and an adaptive scheme that can provide feedback to the source node about the current network state, to allow the application to appropriately adjust the transmission rate. In the same way, we propose a route recovery approach into the AQA-AODV protocol, which provides a mechanism to detect the link failures in a route and re-establish the connections taking into account the conditions of QoS that have been established during the previous route discovery phase. The simulation results reveal performance improvements in terms of packet delay, number of link failures and connection setup latency while we make more efficient use of the available bandwidth than other protocols like AODV and QAODV. In terms of video transmission, the obtained results prove that the combined use of AQA-AODV and the scalable video coding provides an efficient platform for supporting rate-adaptive video streaming.

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.

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.

A grid-based cooperative QoS routing protocol with fading memory optimization for navigation carrier ad hoc networks

Cooperative QoS routing (CQR) protocols have the potential to provide scalable information delivery in multi-service network application. However, CQR approach in harsh environments, in terms of long-range transmission, high dynamic topology, and three-dimensional monitor region, is still an open issue. In this paper, we propose a novel grid-based routing approach, namely FMCQR protocol, to guarantee QoS-aware routing for heterogeneous services in above harsh environments. Our approach is explored by the synthesis of three kernel features. First, a grid-based route model is developed on the basis of two key points, i.e., Three-dimensional Geographic Grid (TGG) space and Controlled Virtual Node (CVN). Hereinto, TGG provides a refined virtual addressing space; CVN, basically a distributed cooperative strategy within TGG border, forms the intra-TGG nodes into a virtual MIMO agent, thus the three-dimensional high dynamic topology can be transferred into a CVN-based stationary topology in TGG space. Second, a QoS routing mechanism, namely CQR, is introduced to guarantee QoS-aware route for heterogeneous requests with the assist from CVN-based metrics, and achieve the route discovery in unknown environments by switching between relay-destination (RD) and source-relay (SR) searching algorithms. Third, a novel Fading Memory Optimization (FMO) algorithm, based on Ebbinghaus memory principle, is designed to further enhance the route efficiency. Finally, extensive simulations are conducted to assess the effectiveness of the above features, compared to related typical routing protocols, our approach has better convergence and better QoS in terms of successful delivery ratio, average delay, average link overhead, and normalized routing distance.

Research and Improvement of Dynamic Source Routing Protocol Based on Ad Hoc

With the growth of multimedia business demand in commercial applications, providing QoS support in Ad Hoc network is more and more important. With the appearance of the business which has strict requirements on the QoS, to provide QoS guarantee in mobile Ad Hoc network will have more important significance. By researching the QoS guarantee mechanism research status of wireless Ad Hoc network, as well as the existing research results and the analysis of the problems remaining to be solved, this paper puts forward a new QoS routing protocol named ProDSR, which adds QoS guarantee mechanism extension to the dynamic source routing protocol (DSR). This protocol makes bandwidth, stability and hop count to be selection criteria for providing QoS guarantee, effectively improves the service quality of mobile Ad Hoc network.

QoS Routing Protocol Based on Resource Optimization for Aerospace Networks

To guarantee the QoS of the various traffics and take good advantage of the network resource, the QoS routing protocol based on resource optimization is proposed. By the network state information dynamic update and the QoS routing optimization model design, the QoS routing protocol can provide the optimal path for real-time traffic, broadband traffic and best effort traffic in time with low control message cost. Simulation shown that, compared to the traditional shortest path routing, the QoS routing can satisfy the demand of traffics and can improve the network performance.

Game Theoretic Approach in Adapting QoS Routing Protocol for Wireless Multimedia Sensor Networks

Network routing has a direct impact on the fairness and efficiency of the whole wireless multimedia sensor networks, the cooperation of nodes in term of routing can be considered as a group called routing coalition. In order to improve the fairness of the wireless multimedia sensors networks, each node should take into account the choices of joining a appropriate routing coalition. This paper presents a game theoretic approach, called coalitional routing game (CRG), which is guideline for nodes to choose the best coalition. The objective of the proposed method is to achieve fairness and QoS efficiency for each node in joining the routing coalition. The Shapley value is used as a solution for the CRG. The coalitional routing game is implemented in DSR protocol in network simulator NS-2 to verify its performance with simulations. Numerical analysis and simulations are conducted, and the results demonstrate that the CRG improves performance of the DSR compared to the same network with only DSR protocol.

A PREEMPTIVE LINK STATE SPANNING TREE SOURCE ROUTING PROTOCOL FOR MOBILE ADHOC NETWORKS

Routing protocol is a central issue in Mobile Adhoc Networks (MANET). Several routing protocols have been proposed to deal with the routing issue in MAN ETs. Routing is a complex task in MANET, if the network is heavily loaded. In this study a new QoS routing protocol is proposed which provides better path selection by avoiding congestion, balancing the loa d and energy. It minimizes the communication overhead without reducing the network performance. Simulation results show this preemptive link state DFS spanning tree QoS source routing protocol achieves better performance than OLSR and DSDV.

A fuzzy based secure QoS routing protocol using ant colony optimization for mobile Ad hoc network

Ensuring secure communication in mobile ad hoc network (MANET) is the main challenging task due to the network characteristics. In this paper, we apply fuzzy logic method and method of ant colony optimization (ACO) to establish a secure routing path with minimum delay for mobile ad hoc network. The ACO algorithm is used to establish a virtual backbone connecting cluster heads (CHs). The general ACO algorithm is modified to allow selection of routing path, based on trust value of the nodes lying in the routing path and delaying experienced in the path. The procedure uses a fuzzy logic controller to evaluate the trust value of the nodes based on node's QoS parameters: energy drain rate, lifetime of the node, packet drop rate and packet forwarding status of the node. The behavior of the protocol under various attacks is analyzed. Experimentation shows that the algorithm results in secure shortest routing path for data communication. Additionally, the packet drop rate and routing delay of the proposed routing protocol in presence of malicious nodes is fewer compared to secure cluster based routing protocol (SCBRP) and Fuzzy Logic based Security Level routing protocol (FLSL).

QoS routing and rerouting optimisation in cognitive network

The human interventions in the network should be reduced as much as possible to alleviate the network complexity. Through mimicking the cognitive behaviours of human brains, the cognitive network concept is proposed to improve the scalability, self-adaptation, self-organisation, and self-protection of the network. In this paper, based on the cognitive science model, we design the cognitive behaviours for the network nodes to benefit the quality-of-service QoS routing and rerouting optimisation. We propose a QoS routing protocol oriented to cognitive network, named as CogRT which addresses the rerouting issue as well. CogRT is a distributed hop-by-hop routing protocol. Inspired by the small-world phenomenon, the experiential route information is collected and stored at each node to benefit the future route selection. We implement and evaluate CogRT in NS2 platform. The results show that CogRT has achieved remarkable performance improvements over the protocols where no cognitive behaviours are exploited.

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

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.

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.