Fault-tolerant Routing Protocol Research Articles

Comparative analysis of proactive solutions for fault-tolerant routing in the infocommunication network

The work established that an essential solution for proactively ensuring fault tolerance of networks is the support of load balancing both at the transport network level and access level using FHRP. However, FHRP load balancing is based on manual settings, which impose high requirements on the network administrator’s professional training and experience level. Therefore, the task of improving mathematical models and methods that make up the algorithmic basis of fault-tolerant routing protocols is urgent. At the same time, a mandatory requirement for these models and methods is to consider the border routers’ reliability through which the load incoming from access networks is balanced. The work describes four mathematical solutions to the problem of proactive fault-tolerant routing. To ensure a high level of Quality of Service, all analyzed solutions support the requirements of the Traffic Engineering concept, and two take into account the reliability of border routers (RATE and ResMetrTE). On the network topology chosen for the study, the problem of proactive fault-tolerant routing was solved using the solutions described in work. The results of the calculations confirmed the sensitivity of the RATE and ResMetrTE routing solutions to the reliability of border routers. Within the considered example, it was established that taking into account the level of border routers’ reliability when organizing load balancing between them using RATE or ResMetrTE solutions led to an increase in the upper bound of the network link utilization – from 15% to 27% on average. The work demonstrates that the implementation of analyzed load balancing solutions can be ensured using the GLBP protocol using the weighted balancing mode when the weight of each border router is determined not empirically but based on the results of calculations within the RATE or ResMetrTE solutions.

A New Modified Mutation based Ant Colony Algorithm for Optimized Fault Tolerant Routing Protocol in MANET

A New Modified Mutation based Ant Colony Algorithm for Optimized Fault Tolerant Routing Protocol in MANET

A New Modified Mutation based Ant Colony Algorithm for Optimized Fault Tolerant Routing Protocol in MANET

A New Modified Mutation based Ant Colony Algorithm for Optimized Fault Tolerant Routing Protocol in MANET

A novel approach of WSN routing protocols comparison for forest fire detection

Wireless sensor networks represent a promising solution for forest fire detection. Yet, these networks are composed of constrained elements and their operation must be optimized to reach a satisfying performance in terms of response time, fault tolerance and network lifetime. Studies have been made in this direction but they have studied only some of the aforementioned constraints and have not discussed the influence of the encountered situations after network deployment. The aim of this paper is to propose a comparison approach of fault tolerant routing protocols for the forest fire detection application which studies the network lifetime and network response time to an event taking into account the specificities of the different cases encountered in the field. To test this approach, the fault-tolerant routing protocols Multilevel, Heterogeneous Disjoint Multipath Routing Protocol (HDMRP) and Enhanced Ant-based QoS-aware routing protocol for Heterogeneous wireless Sensor Networks (EAQHSeN) are implemented and tested in the Castalia WSNs simulator. Simulations results showed that the three protocols have a very comparable network lifetime with a slight advantage in favor of the HDMRP and EAQHSeN protocols. On the other hand, HDMRP and EAQHSeN present a network response time respectively twice and approximately trice more preforming than that of multilevel.

An Incrementally Scalable and Cost-Efficient Interconnection Structure for Data Centers

The explosive growth in the volume of data storing and complexity of data processing drive data center networks (DCNs) to become incrementally scalable and cost-efficient while to maintain high network capacity and fault tolerance. To address these challenges, this paper proposes a new structure, called Totoro , which is defined recursively and hierarchically: dual-port servers and commodity switches are used to make Totoro affordable; a bunch of servers are connected to an intra-switch to form a basic partition; to construct a high-level structure, a half of the backup ports of servers in the low-level structures are connected by inter-switches in order to incrementally build a larger partition. Totoro is incrementally scalable since expanding the structure does not require any rewiring or routing alteration. We further design a distributed and fault-tolerant routing protocol to handle multiple types of failures. Experimental results demonstrate that Totoro is able to satisfy the demands of fault tolerance and high throughput. Furthermore, architecture analysis indicates that Totoro balances between performance and costs in terms of robustness, structural properties, bandwidth, economic costs and power consumption.

Bio-inspired self-aware fault-tolerant routing protocol for network-on-chip architectures using Particle Swarm Optimization

This research paper proposes a bio-inspired self-aware fault-tolerant routing protocol for network-on-chip architecture using particle swarm optimization (PSO), which considers synchronous, asynchronous, and self-organizing communication mechanisms to intelligently load-balance the traffic on the entire network in the presence of faulty components. By way of experimentation and simulation, this study demonstrates that the proposed scheme can converge to a global optimum, minimal routing path in real time, in the presence of network congestion and faulty routers and links. The basic PSO algorithm was improved to implement the proposed routing scheme, named bio-inspired self-aware fault-tolerant routing protocol (BISFTRP). This scheme uses the synchronous, asynchronous, and self-organizing features of PSO to create a global routing table and intelligent adaptation, which gives rise to scalable, real-time, and dynamic routing decisions with high throughput, low latency, and minimum power consumption. A cycle-accurate simulation system to demonstrate the flexibility and efficiency of the proposed scheme is used. Comparison results with state-of-the-art fault-tolerant routing algorithms show that the BISFTRP routing protocol achieves high routing performance without routing oscillations and throughput degradation. Furthermore, the hardware implementation results show that the BISFTRP router achieves an efficient area and power utilization, compared with state-of-the-art routers.

A dynamic Energy-aware fault tolerant routing protocol for wireless sensor networks

In recent decades, cluster-based schemes have emerged as viable solutions for energy conservation problem in wireless sensor networks (WSN). However, most of the existing solutions incur imbalanced energy consumption and high network overheads. In addition, existing cluster-based solutions do not optimize route discovery based on the restricted resources of sensor nodes. Moreover, most of the cluster-based solutions perform periodical re-clustering for load balancing, which results in shortening network lifetime. This research paper presents a Dynamic Energy-aware Fault Tolerant Routing (DEFTR) protocol that exploits uniform-sized network partitioning based on network size and utilizes a multi-facet routing mechanism, which takes into consideration the residual energy, and position and link quality of neighbors. Furthermore, DEFTR not only offers reliable and energy efficient data routing but also supports fault tolerance. Simulation results demonstrate that DEFTR improved the network lifetime by 20.9% and throughput by 35%, also it reduced the delay by 29% and transmission cost by 46% in comparison to the existing work.

Fault tolerant routing protocols in wireless sensor networks: a decision support tool

Wireless Sensor Networks WSNs can be prone to many shortcomings owing to the energy limitation as well as the hostile environments where they could be deployed. Thus, it becomes of paramount importance to consider an adequate Fault Tolerant Routing Protocol FTRP. Nevertheless, the multiplicity of the existing FTRPs makes the choice of a specific protocol, to tackle target application constraints, very expensive in terms of simulations conduction. In this paper, we propose a Decision Support Tool for WSN applications developers to enable them to make the choice of a protocols, before performing simulations, which satisfies the predefined conditions in terms of time and energy costs of fault tolerance as well as its efficiency of the application to be deployed. The studied protocols are also classified according to the target applications types. An example of this tool usage is provided in a case study of forest fire detection.

A Kautz-Based Wireless Sensor and Actuator Network for Real-Time, Fault-Tolerant and Energy-Efficient Transmission

Wireless sensor and actuator networks (WSANs) are composed of sensors and actuators to perform distributed sensing and actuating tasks. Most WSAN applications (e.g., fire detection) demand that actuators rapidly respond to observed events. Therefore, real-time (i.e., fast) and fault-tolerant transmission is a critical requirement in WSANs to enable sensed data to reach actuators reliably and quickly. Due to limited power resources, energy-efficiency is another crucial requirement. Such requirements become formidably challenging in large-scale WSANs. However, existing WSANs fall short in meeting these requirements. To this end, we first theoretically study the Kautz graph for its applicability in WSANs to meet these requirements. We then propose a Kautz-based REal-time, Fault-tolerant and EneRgy-efficient WSAN (REFER). REFER embeds Kautz graphs into the physical topology of a WSAN for real-time communication and connects the Kautz graphs using distributed hash table (DHT) for high scalability. We also theoretically study routing paths in the Kautz graph, based on which we develop an efficient fault-tolerant routing protocol. It enables a relay node to quickly and efficiently identify the next shortest path from itself to the destination based only on node IDs upon routing failure, rather than relying on retransmission from the source. REFER is advantageous over previous Kautz graph based works in that it does not need an energy-consuming protocol to find the next shortest path and it preserves the consistency between the overlay and physical topology. We further improve routing in REFER by multi-path based routing and energy-efficient multicasting within and between Kautz graph cells, respectively. Extensive experimental results demonstrate the superior performance of REFER in comparison with existing WSAN systems in terms of real-time communication, energy-efficiency, fault-tolerance and scalability.

A Secure Cooperative Bait DetectionApproach for Detecting Malicious Nodes inMANETs

In mobile adhoc-hoc Networks (MANETs), the important concern is the security as well as establishment of verbal exchange amongst nodes is that nodes have got to work at the side of each different? Averting or sensing malicious nodes initiation gray hole or collaborative black hole attacks is the fundamental undertaking. Cooperative bait detection approach mixes the benefits of each proactive and reactive defense manners. Right here it makes use of the method of transposition for implementing safety and the CBDA procedure outfits a reverse tracing procedure to aid achieve the certain goal. The demo in the existence of malicious-node assaults, the CBDA beats the DSR, and Best-Effort Fault-Tolerant Routing (BFTR) protocols in relations to packet supply ratio and routing overhead. Within the transposition method we use the key which is the ascii worth of the personality which is encrypted at sender aspect and decrypted at receiver.

Recent Trends Toward Fault Tolerance Techniques in MANET

Mobile ad hoc networks (MANETs) have emerged like a key technology with regard to next-generation wireless networking. MANETs usually are going through rapid progress and also inspiring quite a few purposes. Even so, a lot of complex issues are still dealing with the particular deployment on this technological innovation. On the other hand, adversarial conditions are standard in MANET environments, and there are misbehaving nodes that decay the overall performance.MANETs should be fault tolerant to recover even after a failure occurs. This paper has focused on the significance of the fault tolerant routing protocols and what are the various challenges for fault tolerant MANETs.In this paper, a review on issues in fault tolerance is presented. This review paper has presented various fault tolerance techniques to improve failures in network.

GTRF: a game theory approach for regulating node behavior in real-time wireless sensor networks.

The selfish behaviors of nodes (or selfish nodes) cause packet loss, network congestion or even void regions in real-time wireless sensor networks, which greatly decrease the network performance. Previous methods have focused on detecting selfish nodes or avoiding selfish behavior, but little attention has been paid to regulating selfish behavior. In this paper, a Game Theory-based Real-time & Fault-tolerant (GTRF) routing protocol is proposed. GTRF is composed of two stages. In the first stage, a game theory model named VA is developed to regulate nodes’ behaviors and meanwhile balance energy cost. In the second stage, a jumping transmission method is adopted, which ensures that real-time packets can be successfully delivered to the sink before a specific deadline. We prove that GTRF theoretically meets real-time requirements with low energy cost. Finally, extensive simulations are conducted to demonstrate the performance of our scheme. Simulation results show that GTRF not only balances the energy cost of the network, but also prolongs network lifetime.

MPSICA: An intelligent routing recovery scheme for heterogeneous wireless sensor networks

To address the fault-tolerant recovery problem in a heterogeneous wireless sensor network consisting of several resource-rich supernodes, and a large number of energy-constrained ordinary sensor nodes, we propose a multi-particle-swarm immune cooperative algorithm (MPSICA) to provide intelligent routing recovery scheme. The MPSICA could maintain K disjoint paths from each source node to the nearest supernode and the available path from supernodes to the sink. Moreover, it could investigate the optimal alternative routing strategies, and solve the problem with cloning, high-frequency mutation, clone selection operations, which can improve the fault tolerant ability and reliability of inter-cluster and intra-cluster data transmission. Using this scheme, we can efficiently repair the broken path of intercluster supernodes or intracluster ordinary nodes network. Finally, we discuss the implementation of the MPSICA based fault-tolerant routing protocol and present the performance evaluation through experiments. The simulation results have verified that the MPSICA based protocol can provide reliable communication with intelligent bio-heuristic routing recovery scheme, thus extend the lifetime of WSNs.

E-Cube+ Routing Protocol for Wireless Sensor Networks in the Presence of Network Failures

Providing reliable communication represents one of the major barriers to wireless sensor networks. In this paper, we propose a fault-tolerant tableless routing protocol called E-cube+, inspired from e-cube routing protocol, to support intelligent rerouting. A range of fault-tolerant routing properties of E-cube+ (such as loop-freeness, failure recovery guarantees, and bounded latency) have been derived and analyzed. Experiment results also show that E-cube+ is able to route data properly without complicated and energy-intensive routing table lookup processes even when node failures occur.

Defending Against Collaborative Attacks by Malicious Nodes in MANETs: A Cooperative Bait Detection Approach

In mobile ad hoc networks (MANETs), a primary requirement for the establishment of communication among nodes is that nodes should cooperate with each other. In the presence of malevolent nodes, this requirement may lead to serious security concerns; for instance, such nodes may disrupt the routing process. In this context, preventing or detecting malicious nodes launching grayhole or collaborative blackhole attacks is a challenge. This paper attempts to resolve this issue by designing a dynamic source routing (DSR)-based routing mechanism, which is referred to as the cooperative bait detection scheme (CBDS), that integrates the advantages of both proactive and reactive defense architectures. Our CBDS method implements a reverse tracing technique to help in achieving the stated goal. Simulation results are provided, showing that in the presence of malicious-node attacks, the CBDS outperforms the DSR, 2ACK, and best-effort fault-tolerant routing (BFTR) protocols (chosen as benchmarks) in terms of packet delivery ratio and routing overhead (chosen as performance metrics).

FTCARP: A Fault-Tolerant Routing Protocol for Cognitive Radio Ad Hoc Networks

Cognitive Radio (CR) has been recently proposed as a promising technology to remedy the problems of spectrum scarcity and spectrum underutilization by enabling unlicensed users to opportunistically utilize temporally unused licensed spectrums in a cautious manner. In Cognitive Radio Ad Hoc Networks (CRAHNs), data routing is one of the most challenging tasks since the channel availability and node mobility are unpredictable. Moreover, the network performance is severely degraded due to large numbers of path failures. In this paper, we propose the Fault-Tolerant Cognitive Ad-hoc Routing Protocol (FTCARP) to provide fast and efficient route recovery in presence of path failures during data delivery in CRAHNs. The protocol exploits the joint path and spectrum diversity to offer reliable communication and efficient spectrum usage over the networks. In the proposed protocol, a backup path is utilized in case a failure occurs over a primary transmission route. Different cause of a path failure will be handled by different route recovery mechanism. The protocol performance is compared with that of the Dual Diversity Cognitive Ad-hoc Routing Protocol (D2CARP). The simulation results obviously prove that FTCARP outperforms D2CARP in terms of throughput, packet loss, end-to-end delay and jitter in the high path-failure rate CRAHNs.

Introducing a Novel Fault Tolerant Routing Protocol in Wireless Sensor Networks Using Fuzzy Logic

Although routing is one of the key issues, the challenges facing WSN makes the subject even more demanding. In this study, we propose a novel fault tolerant routing protocol in wireless sensor networks using fuzzy logic. We approach the problem by breaking it down into two parts. The first sub problem is designing a routing module and the second one retrofitting the designed module in a way that answering to these two sub problems leads to the final solution of the main problem. To deal with the first stage, by using fuzzy logic, we design a routing module; then for the second stage, the module enters fault tolerant routing in order that it be tolerant against routing faults. In this study, the term network failure is figuratively equal to node failure.

Performance Comparison of Survival Routing Mechanisms in Wireless Mesh Networks

This paper addresses the fault-tolerant mechanisms in Wireless mesh networks (WMNs), and designs a C++ based simulation platform to measure the performance of different fault-tolerant mechanisms. A comprehensive performance evaluation of network coding tree algorithm (NCT), 1+1 scheme and 1: N scheme in WMNs is conducted. Performance metrics, such as packet delivery ratio, resource redundancy degree, end-to-end delay, and useful throughput ratio, are investigated. The simulation results and performance analysis reveal that how wireless channel quality can influence the performance of WMNs and how different fault-tolerant mechanisms can be efficient and effective for latency-sensitive applications in WMNs. The results can also provide the enlightening insights for efficient design of fault-tolerant routing protocols for many-to-one traffic pattern in WMNs.

A Fault Tolerant Congestion Aware Routing Protocol for Mobile Adhoc Networks

Problem statement: The performance of ad hoc routing protocols will si gnificantly degrade when there are faulty nodes in the network. Packet losses and bandwidth degradation are caused due to congestion and thus, time and energy is wasted during its recovery. The fault tolerant congestion aware routing protocol addresses these p roblems by exploring the network redundancy through multipath routing. Approach: In this study, it is proposed to design a fault to lerant congestion aware multi path routing protocol to reduce the rou te breakages and congestion losses. The AOMDV protocol is used as a base for the multipath routin g. This proposed scheme enables more nodes to salvage a dropped packet. Results: Simulation results show that the proposed protocol achieves better throughput and packet delivery ratio with reduced d elay, packet drop and energy. Conclusion: An effective congestion control technique proposed in this study proactively detects node level and link level congestion and performs congestion control us ing the fault-tolerant multiple paths.

Realization of Fault Tolerant Routing Protocol for Zigbee

Problem statement: Increased use of handheld devices and sensor devices pose problems in existing routing protocols. The performance of the existing routing protocols deteriorates very much on these dense scenarios. Control overheads are very important parameter in deciding the performance of routing protocols, which are introduced during route discovery and maintenance process. Denser the network, higher is the control overhead in establishing and maintaining the communication path between end systems. This study aims at implementing an improved fault tolerant routing algorithm that minimizes the routing overhead for ad hoc networks using Zigbee. Approach: We propose a routing protocol which minimizes the routing overhead by exploiting the network density. The number of nodes involved in handling the control packets is minimized in the proposed protocol by selecting few of the neighbors of each node based on the received signal strength. The link breaks are maintained locally, thus by reducing the number of control overheads in the network. Results: The performance of the proposed protocol is tested using OMNet++ simulator. The implementation using Zigbee nodes indicate that the control overhead is reduced up to 80% in dense environments and 60% in heterogeneous and sparse thereby saving energy in the sensor nodes. Conclusion: The proposed protocol increases the energy conservation and hence the nodes life time and networks’ lifetime.