A Fault Tolerance Management Framework for Wireless Sensor Networks

A wireless sensor network (WSN) is a collection of various tiny devices known as sensor nodes, which are also called motes. Due to high-energy consumption, the possibility of hardware, link or node failure, and some malicious attacks, sensor networks are considered error-prone networks. Hence, fault tolerance (FT) in WSN is one of the prominent issues. This article presents a novel FT approach named node-link failure fault tolerance model (NLFFT Model) in WSN, to handle the faults that occur either by link or node failure during data transmission from the sensor to the sink or base station. The NLFFT model consists of an improved quadratic minimum spanning tree (Imp-QMST) approach. This approach helps in finding the alternate link whenever it fails due to various situations and also an improved-handoff (Imp-Handoff) algorithm to support the node failure to the fault tolerance. Improved QMST presents a novel mechanism to find an alternate edge in place of the broken or failed edge in the spanning tree, to improve the fault tolerance in WSN. Imp-Handoff suggests a novel way to find the faulty node owing to less battery power and replaces a defective node by an appropriate neighbor to shift the tasks performed by a faulty node in WSN. Simulation results clearly state that as compared to the basic techniques i.e. Q-MST and Handoff algorithm, the proposed NLFFT model improvises the performance of WSN around by 7%. The results prove that the Imp-QMST gives about 6% improved throughput, 5% less end-to-end delay, and 6% less power consumption than the QMST algorithm. Similarly, Imp-Handoff improves about 4% throughput, 6% less end-to-end delay, and utilizes 7% less power consumption.

Fault tolerance is the major issue in wireless sensor networks (WSNs). These networks are mobile in nature hence achieving fault free function in these networks is always a challenge. Therefore, need to diagnose these networks is very important for its graceful performance. In this paper, we have divided the fault diagnosis model into three major modules namely monitoring, detection and recovery. Extensive literature survey has been conducted to survey and analyze different techniques used in all these modules. Some open research problem areas have also been investigated. The given paper presents a comprehensive survey of techniques used to achieve fault tolerance in WSNs.

Applications of wireless sensor network face many censorious issues, fault tolerance being a prominent one. The problem of missing communication link(s), sensor node(s) and data is unavoidable in such networks. Fault tolerance is important for reliable delivery of data in WSN applications. This ensures the system’s availability for use in case of any interruption or occurrence of fault, thus enhancing the availability and reliability. Current work introduces the fault-tolerance behavior of a dynamically generated system of wireless sensor network that comprises of super-nodes and sensor nodes having k - vertex disjoint paths. As the parameters involved in the process of determination of fault-tolerance of a network change, the capacity of the network to tolerate the fault changes accordingly. This paper proposes an algorithm that evaluates the fault tolerance of randomly generated networks based on k - vertex disjoint path connectivity and also evaluates the results.

Wireless Sensor Network (WSN) suffers from different malware attacks. Several traditional approaches are proposed for detecting fault nodes in WSN. It is necessary to redistribute the nodes and detect the fault nodes while modifying the WSN parameters. Faults can occur in the nodes interrupting the continuous communication process of the nodes in the WSN. The main reason for a fault is also the induction of the energy drain in a node to the maximum possible level, failure of links in communicating nodes due to bandwidth constraints, and attacks induced by the malicious nodes. To solve this problems, Extended Finite State Machine based Fault Tolerance (EFSM_FT) in the WSN is used to detect the fault sensor nodes in the WSN. In this approach, called the finite state machine (FSM), state prompted is modified while a set of situations are true. Every node can be absolutely to be faulty or not establishing on the sensor node states. Using sensor energy, drop rate, forward sensor rate, sensor obtained rate, bandwidth, and transmission delay, this method finds the node with the fault. As a result, this approach accurately detects the faulty nodes in the WSN. The simulation outcomes illustrate the proposed method has a better fault detection ratio and minimizes the false negative ratio in the WSN.

Mesh communications is emerging as a popular networking solution. Mesh networks have a decentralized and multihop design. These characteristics arouse interest for the research of the following features: cooperation, task distribution, scalability and communication with limited infrastructure support. This chapter studies relevant solutions in Wireless Sensor Networks (WSNs) with a mesh design that is used with mobile devices. The use of mobile devices on WSNs has recently grown due to: hardware evolution, large number of embedded sensors and daily high utilization of handheld devices. Consequently, novel requisites in the design and implementation of WSNs urge to be satisfied: autonomy of sensors battery and, efficient data exchange amongst sensors and the Internet. A real mesh testbed with two Layer 2 mesh solutions (Open802.11s and B.A.T.M.A.N) was implemented with different topologies. Some relevant results for a mesh network are discussed in terms of its scalability, performance and volatility.

Due to adverse effects of hostile deployment environment(s), sensors nodes (SNs) deployed in the network may drain or get damaged. This attributes for loss of connectivity between the sensors and the sink node. Hence it is necessary to design the wireless sensor network (WSN) in a manner that the network is capable of coping up with the failure of few nodes/links. Using single hop data communication model reduces the lifetime of the network as the SNs are resource constrained (in terms of battery). Relay nodes (RNs) facilitate in improving network lifetime, fault tolerance and/or connectivity. Finding minimum number of relay nodes for a fault tolerant, fully connected network is a NP Hard problem. In this paper, we follow two phase relay node placement procedure to achieve the objective. In the first phase, we cluster the SNs using mean shift algorithm and place RNs as the cluster heads. In the second phase, we use metaheuristic algorithms like Moth Flame Optimization (MFO), Differential Evolution (DE), Bat algorithm (BA) and Biogeography Based Optimization algorithm (BBO) to place the RNs such that the required fault tolerance is achieved along with fully connected network. Extensive simulation results prove that MFO algorithm performs better for fault tolerant relay node placement problem.

This paper presents a neural model for reliable and fault tolerant transmission in Wireless Sensor Networks based on Bi-directional Associative Memory. The proposed model is an attempt to enhance the performances of both the cooperative and non cooperative Automatic Repeat Request (ARQ) schemes in terms of reliability and fault tolerance. We have also demonstrated the performances of both the schemes with the help of suitable examples.

In this paper a procedure is proposed to construct a heterogeneous wireless Sensor network (WSN) that is both bi-directional and fault tolerant. Fault tolerance, is based on finding the k-best disjoint paths using trellis graph transformation. Recognizing limited energy in WSN's the proposed algorithm minimizes energy consumption. Simulation study reveals how metrics, such as average end to end delay, transmission overhead and throughput, compare for unidirectional and bidirectional graphs.

The present cluster head selection is fixed as a static node, so the cluster head becomes malicious the entire cluster communication is discarded in wireless sensor networks (WSNs). As per our new approach, the cluster heads are using fault tolerance schemes supports for selection cluster head through the game theory. This process may take additional energy to detect malicious cluster heads and to recover the network communication in the cluster. This article proposes fault-tolerant backup cluster head (BCH) selection influenced by game theory in wireless sensor networks WSNs by utilizing less energy. In WSNs, the malicious cluster heads can be exhibited efficiently using game theory through the different network conditions such as scalability, mobility, and energy utilization. Due to scalable WSNs, the cluster node is increasing in the cluster head becomes malicious thus network lifetime is reduced. So, the fault-tolerant BCH technique is incorporated to increase the lifetime of WSNs. So, the efficiency of the sensor network is reduced due to the cooperation of malicious and normal nodes. The malicious cluster heads being detected based on node parameters and the clustered network operations are carried out through fault-tolerant backup cluster head in WSNs. The simulation results have obtained for the proposed scheme compared with the network parameters such as dead nodes, alive nodes, and average energy of active nodes in the network.KeywordsWireless sensor networkGame theoryFault-tolerant networkCluster head selectionBackup cluster head

Wireless Sensor Networks (WSNs) belongs to a new trend in technology in which tiny and resource constrained devices are wirelessly interconnected and are able to interact with the surrounding environment by collecting data such as temperature and humidity. Recently, due to the huge growth in the use of mobile devices with Internet connection, smartphones are becoming the center of future ubiquitous wireless networks. Interconnecting WSNs with smartphones and the Internet is a big challenge and new architectures are required due to the heterogeneity of these devices. Taking into account that people are using smartphones with Internet connection, there is a good opportunity to propose a new architecture for wireless sensors monitoring using push notifications and smartphones. Then, this paper proposes a ubiquitous approach for WSN monitoring based on a REST Web Service, a relational database, and an Android mobile application. Real-time data sensed by WSNs are sent directly to a smartphone or stored in a database and requested by the mobile application using a well-defined RESTful interface. A push notification system was created in order to alert mobile users when a sensor parameter overcomes a given threshold. The proposed architecture and mobile application were evaluated and validated using a laboratory WSN testbed and are ready for use.

An adaptive cellular automata scheme for diagnosis of fault tolerance and connectivity preserving in wireless sensor networks

Wireless Sensor Networks (WSN) is of ubiquitous importance in the present day wireless communication. While disseminated architecture delights a more security and fault-tolerant WSN, such architecture also places a number of security challenges particularly when employed in vital applications such as health care, environment monitoring and battlefield. In this paper, we propose Trust Awaken Routing for Improving the Reliable Communication in WSN. The main objective of this paper is to develop trust management for WSNs, and this technique is used to improve the reliability of data transmission in the network. In this scheme, the trust Awaken Factor is used to select the reliable path from source to destination in the system. trust Awaken Factor computed by node interaction, node recommendation, quick response and node selfishness. The simulation results show the better improvement in throughput and reduce the network delay in the network.

Wireless Sensor Networks (WSNs) have undergone significant advancements over the past few decades, becoming a crucial component in various applications such as environmental monitoring, healthcare, and industrial automation. Traditionally, WSNs have relied on static routing protocols that lack adaptability to changing network conditions. This rigidity often results in congestion, energy inefficiency, and suboptimal overall network performance. Fixed routing paths frequently cause imbalanced load distribution, ultimately reducing the lifespan and efficiency of sensor nodes. A key limitation of conventional WSNs is their inability to accommodate dynamic network changes, including node failures, energy depletion, or environmental disruptions. These challenges lead to inefficient routing, redundant data retransmissions, and increased energy consumption. Moreover, traditional WSN architectures generally exhibit poor scalability, making it difficult to maintain consistent performance as the network size increases. Single-path routing, commonly used in these systems, further exacerbates the risk of data loss in the event of path failure or congestion. This research addresses the need for a more adaptive and efficient routing mechanism capable of responding to dynamic network conditions while ensuring load balancing and fault tolerance. The primary motivation is to enhance the reliability, energy efficiency, and scalability of WSNs, especially in large-scale deployments where conventional routing techniques fall short. To tackle these challenges, the proposed system integrates Software-Defined Networking (SDN) with WSNs. SDN introduces centralized control and real-time routing adaptation, enabling dynamic load balancing and multipath routing. This integration allows for more flexible and efficient traffic management, improved fault tolerance, and optimal resource utilization. By dynamically adjusting routes and distributing the network load, the system aims to overcome the limitations of traditional WSNs and deliver robust performance across a wide range of applications.

The future of our society, the connected world of tomorrow, will be one of better integration with, and more awareness of our surroundings. Wireless sensor networks will breathe life into objects and allow us to extend our sensory perception to every square of land and water. Before large amounts of information regarding our private lives and surroundings start being sent around the world,privacy issues have to be addressed. At the moment there is no transparent or holistic security solution for wireless sensor networks. Because sensor networks have a wide range of applications with very di erent requirements, and because they have constrained hardware, security solutions can't be static but need to be con gured, tailored, for every single applications, to make effi cient use of the available resources while providing the required security level. Furthermore, the control over the security con guration needs to be placed in the hands of the sensor network's user, because only the user knows the details of the application and can control its parameters. This thesis presents a framework for the security con guration of wireless sensor networks (WSNs), which provides complete and transparent communication security to any data stream, at any network layer, of a sensor network application, without requiring changes to the application code. The design of the framework takes into account the WSN life cycle and its actors, developer and user, as well as their knowledge domains. It is assumed that neither actors have security expertise so all the security decisions are made within the framework. The main contributions of the framework are a security con guration methodology and a modular security architecture. The configuration methodology determines resource-e cient security services and protocols based on application parameters like data sampling rate, network lifetime or power supply, thereby putting the control of security con guration into the user's hands. The security architecture enables the decoupling of application and security code and allows security components to be installed on the application without changing its code. This is achieved through policy-based security of messages intercepted between the layers of the network stack. The security con guration methodology is validated against a scenario and the modular security architecture is tested and compared with hard-coded security. Considering the reduction in complexity and the increased exibility, the performance overhead of the framework is acceptable. The framework is independent of security services and protocols and can easily be extended to support new types. By encouraging reuse of services and protocols it can increase their strength and resilience, through repeated verification of the code. It is hoped that the transparency and ease of use of this framework will provide the necessary con dence in wireless sensor networks as a technology of the future.

Wireless Sensor Networks (WSN), an element of pervasive computing, are presently being used on a large scale to monitor real-time environmental status. WSN has the potential of significantly enhancing our ability to monitor and interact with our physical environment. Fault tolerance is one of the main issues in Wireless Sensor Networks (WSNs) since it becomes critical in real deployment environment where reliability and reduced inaccessibility times are important. So, we propose a fault-tolerance technique for coverage area of the sensor network that enhances the energy efficiency by reducing the communication, with the help of Constrained Delaunay Triangulation. Further by applying the above approach, we reduce the energy consumption and congestion in the network. In last, we compared our approach (CDT) with previous approach Delaunay Triangulation (DT) and concluded that our approach is better in fault tolerance and energy saving.