Faulty Nodes Research Articles

Fuzzy based Energy Efficient Rider Remora Routing protocol for secured communication in WSN network

Due to the resource constraint nature of WSN, ensuring secured communication in WSN is a challenging problem. Moreover, enhancing the network lifetime is one of the major issues faced by the existing studies. So, in order to secure the communication between WSNs and achieve improved network lifetime, a novel trust enabled routing protocol is proposed in this study. Initially, the clusters are constructed using Direct, Indirect, and Total Trust evaluations, which helps to identify the faulty nodes. After, an Improved Fuzzy-based Balanced Cost Cluster Head Selection (IFBECS) method is used to choose the cluster head (CH). Finally, to determine the best path from source to destination, a hybrid bionic energy-efficient routing model known as an Energy Efficient Rider Remora Routing (EERRR) protocol is introduced. To improve the network lifetime and throughput, the parameters like remaining energy of the CH, sensor node space, CH, etc., are considered by the utilized protocol. The proposed mechanism is implemented in NS-2 programming tool. The simulation results show that the proposed routing protocol has attained improved PDR of 97.92 % at the time period of 50 ms, reduced energy consumption of 3.336 at the time period of 100 ms, higher throughput of 86262.7 at the time period of 250 ms, and enhanced network lifetime of 1028.08 rounds in 200 nodes. Therefore, by attaining better results as compared with other existing protocols, it is clearly revealed that the proposed routing protocol is highly suitable for secured energy efficient WSN communication.

DEVELOPMENT OF A METHODOLOGY FOR DATA NORMALISATION AND AGGREGATION TO ENHANCE SECURITY LEVELS IN INTERNET OF THINGS INTERACTIONS

The number of interacting devices is increasing every day, and with this constant innovation, serious security challenges arise. The concept of the Internet of Things is being actively applied in both domestic and industrial settings. Researchers are increasingly highlighting the challenges and importance of network security. Data preprocessing plays an important role in security by transforming the input data corresponding to algorithmic criteria and thereby contributing to the prediction accuracy. The data preprocessing process is determined by many factors, including the processing algorithm, the data, and the application. Moreover, in Internet of Things interactions, data normalisation and aggregation can significantly improve security and reduce the amount of data used further decision making. This paper discusses the challenges of data normalisation and aggregation in the IoT to handle large amounts of data generated by multiple connected IoT devices. A secure data normalisation and aggregation method promotes successful minimised data transfer over the network and provides scalability to meet the increasing demands of IoT deployment. The proposed work presents approaches used in data aggregation protocols that address interference, fault tolerance, security and mobility issues. A local aggregation approach using the run-length encoding algorithm is presented. The proposed technique consists of data acquisition, data preprocessing, data normalisation and data aggregation steps. Data normalisation was performed via the Z-score algorithm, and the LEACH algorithm was used for data aggregation. In the experimental study, the percentage of faulty nodes reached 35%. The performance of the proposed solution was 0.82. The results demonstrate a reduction in resource consumption while maintaining the value and integrity of the data.

ENIAO: Energy Aware Faulty Node Re-Placement Integrated With Duty Cycling and Improved Harmony Search Based Clustering through Adaptive Fish School Search Routing for WSN Optimization

In wireless sensor networks (WSNs), sensor nodes are constrained by resource constraints. The limited energy supply and susceptibility to failure greatly affect WSN lifespan, hindering long-term deployment. ENIAO is an Integrated cross-layer Optimized Routing Approach for WSNs that is fault-tolerant and energy-efficient. A bio-inspired clustering architecture and adaptive duty cycling are incorporated into ENIAO's routing optimization. In a clustering protocol, the network is partitioned, and paths are dynamically optimized within and between clusters. By optimizing active/sleep schedules, duty cycling optimizes energy efficiency. A variety of network conditions have been simulated to assess ENIAO's performance. Regarding fault tolerance and energy consumption, ENIAO significantly prolongs the network lifetime. As compared to benchmark protocols, it achieves higher throughput. As a result of the cross-layer design, ENIAO is automatically adapted to optimize energy usage and routing reliability. In the long run, large-scale IoT deployments are possible with ENIAO due to the integrated approach.

Dynamic Byzantine Fault-Tolerant Consensus Algorithm with Supervised Feedback Mechanisms

Among the existing consensus algorithms, there are very few low-latency consensus algorithms that can simultaneously take into account node dynamics, fault tolerance, and scalability, and which are applicable to large-scale open scenarios where low latency is required. Therefore, this paper proposes a low-latency scalable dynamic consensus algorithm with high fault tolerance utilizing a combination of layered and threshold signature technologies, known briefly as LTSBFT. Firstly, LTSBFT achieves linear communication complexity through the utilization of threshold signature technology and a two-layer structure. Secondly, the mutual supervision feedback mechanism among nodes enables the attainment of linear complexity for reaching consensus on the faulty upper-layer nodes during the view-change. Lastly, a node dynamic protocol was proposed for the first time to support dynamic changes in the number of nodes during the consensus process. That is to say, consensus can still be reached when the number of nodes dynamically changes without interrupting the client’s request for consensus in the network. The experimental results indicate that LTSBFT exhibits lower communication latency and higher throughput compared to the classic HotStuff and PBFT algorithms. Furthermore, in comparison to double-layer PBFT, the LTSBFT has been demonstrated to have improved fault tolerance.

An expandable and cost-effective data center network

With the rapid growth of data volume, the escalating complexity of data businesses, and the increasing reliance on the Internet for daily life and production, the scale of data centers is constantly expanding. The data center network (DCN) is a bridge connecting large-scale servers in data centers for large-scale distributed computing. How to build a DCN structure that is flexible and cost-effective, while maintaining its topological properties unchanged during network expansion has become a challenging issue. In this paper, we propose an expandable and cost-effective DCN, namely HHCube, which is based on the half hypercube structure. Further, we analyze some characteristics of HHCube, including connectivity, diameter, and bisection bandwidth of the HHCube. We also design an efficient algorithm to find the shortest path between any two distinct nodes and present a fault-tolerant routing scheme to obtain a fault-tolerant path between any two distinct fault-free nodes in HHCube. Meanwhile, we present two local diagnosis algorithms to determine the status of nodes in HHCube under the PMC model and MM* model, respectively. Our results demonstrate that despite the presence of up to 25% faulty nodes in HHCube, both algorithms achieve a correct diagnosis rate exceeding 90%. Finally, we compare HHCube with state-of-the-art DCNs including Fat-Tree, DCell, BCube, Ficonn, and HSDC, and the experimental results indicate that the HHCube is an excellent candidate for constructing expandable and cost-effective DCNs.

Fault-tolerant security-efficiency combined authentication scheme for manned-unmanned teaming

Manned-unmanned teaming (MUM-T) is an emerging network system which interconnects manned aerial vehicles (MAVs) with unmanned aerial vehicles (UAVs) to enhance mission effectiveness and reduce workloads. Like other wireless systems, MUM-T is prone to attacks from the open communication channel. Therefore, an authentication scheme is required to establish secure and trusted communication between the MAV and the UAV. However, existing schemes fail to provide adequate security features and necessary efficiency, mostly due to their incomprehensive threat modeling and improper use of authentication techniques. Moreover, traditional centralized architecture of the authentication server leads to the single point of failure (SPOF) problem, which jeopardizes the robustness and scalability of MUM-T. In this paper, we propose a fault-tolerant authentication scheme for MUM-T that will solve these problems. To enhance its security, we construct a new threat model consisting of adversary's capabilities, security features, and security challenges to ensure the security of a scheme under combination attacks. To preserve the highest possible efficiency, we propose the design principle of using lightweight primitives for authentication and applying public key operations in key establishment. To address the SPOF problem, we employ a distributed fault-tolerant mechanism to share registration information within authentication servers and defend against faulty nodes. As is demonstrated by the security proof and performance comparison, our scheme succeeds in improving security and reducing overall costs, which provides a better solution than existing schemes.

An effective metaheuristic based optimized type‐II fuzzy inference system for fault node identification in wireless sensor network

SummaryDeploying a wireless sensor network (WSN) for accessing the network of distant environments is more crucial. Node defect detection is a core technology of WSN and is essential for most WSN networks. The defective node reduces the overall service quality (OSQ) of the global WSN network system. Therefore, a type II fuzzy inference system (T2_FIS) is proposed for detecting defective nodes in the WSN network. The adaptive genetic algorithm (AGA) and proposed method are introduced for tuning the parameters in the T2_FIS system. The proposed T2_FIS method effectively detects the broken node in the WSN network using the fuzzy rules. In addition, the improved Mud Ring (IMR) optimization algorithm is proposed to replace the faulty node with the neighborhood node in the network. The defective nodes are identified and replaced with the closest nodes based on the membership function (MF) generated by the T2_FIS. Furthermore, the lifetime and throughput of the WSN network are increased by minimizing energy consumption. The overall performance is evaluated using the MATLAB tool, and the implementation results are compared with the existing methods. The total energy consumption for the proposed method is 50.451, with a throughput and lifetime of 153.657 and 22979.25. Furthermore, the performance metrics for the existing and proposed strategies are analyzed, and the accuracy of the proposed method is proven to be 99.3827%, the false alarm rate (FAR) is 0.0008, and the false positive rate (FPR) is 0.0617. The results show the effectiveness and performance of the proposed method.

An improved localization algorithm to replace faulty nodes for an IoT network using weighted grey wolf optimization

An improved localization algorithm to replace faulty nodes for an IoT network using weighted grey wolf optimization

A Q-learning based iterated local search algorithm for human-UAV cooperation in restoring transmission network

The power transmission network is easily to be destroyed when natural or man-made disasters occur. Restoration of power supply under disaster environments faces difficulties since a large-scale network typically contains many uninspected faulty nodes. Utilizing unmanned aerial vehicles (UAVs) to inspect these unknown faulty nodes can significantly improve the efficiency for subsequent restoration work performed by human-teams. Nevertheless, efficient cooperation of UAV and human-team is a complicated work due to the complexity of network structure and correlation between UAV scheduling and human-team scheduling. In this paper, a mathematical model is established to describe the considered problem aiming at maximizing the restored power supply in a limited response time. Then a Q-learning based iterated local search (Q ILS) algorithm is proposed to formulate the collaborative scheduling problem. Firstly, an initialization method is designed to assign UAVs for inspecting unknown faulty nodes and human-teams for repairing faulty nodes, which ensures each unknown faulty node is inspected before maintenance. Secondly, searching operators including perturbation and local search procedures are designed to ensure exploration and exploitation capability. Thirdly, Q-learning method is utilized as a learning engine to guide the direction of solution evolution. Moreover, the parameters of Q ILS are calibrated by multi-factor analysis of variance method to determine proper values. The computational simulations and comparison experiments validate the superiority of proposed algorithm.

Evaluating Trust Management Frameworks for Wireless Sensor Networks.

Wireless Sensor Networks (WSNs) are crucial in various fields including Health Care Monitoring, Battlefield Surveillance, and Smart Agriculture. However, WSNs are susceptible to malicious attacks due to the massive quantity of sensors within them. Hence, there is a demand for a trust evaluation framework within WSNs to function as a secure system, to identify and isolate malicious or faulty sensor nodes. This information can be leveraged by neighboring nodes, to prevent collaboration in tasks like data aggregation and forwarding. While numerous trust frameworks have been suggested in the literature to assess trust scores and examine the reliability of sensors through direct and indirect communications, implementing these trust evaluation criteria is challenging due to the intricate nature of the trust evaluation process and the limited availability of datasets. This research conducts a novel comparative analysis of three trust management models: "Lightweight Trust Management based on Bayesian and Entropy (LTMBE)", "Beta-based Trust and Reputation Evaluation System (BTRES)", and "Lightweight and Dependable Trust System (LDTS)". To assess the practicality of these trust management models, we compare and examine their performance in multiple scenarios. Additionally, we assess and compare how well the trust management approaches perform in response to two significant cyber-attacks. Based on the experimental comparative analysis, it can be inferred that the LTMBE model is optimal for WSN applications emphasizing high energy efficiency, while the BTRES model is most suitable for WSN applications prioritizing critical security measures. The conducted empirical comparative analysis can act as a benchmark for upcoming research on trust evaluation frameworks for WSNs.

Faulty Nodes Detection for Reliable Data Transmission in Intelligent Wireless Sensor Networks

Faulty Nodes Detection for Reliable Data Transmission in Intelligent Wireless Sensor Networks

T/k-Diagnosability of Regular Networks under the Comparison Model.

As multiprocessor systems continue to grow in processor scale, the incidence of faults also increases. As a result, fault diagnosis is becoming a key mechanism for maintaining the normal operation of multiprocessor systems. To explore more effective diagnostic methods, Somani et al. introduced a generalized pessimistic diagnostic strategy, named t/k-diagnosis, in which all faulty nodes are isolated in a set of nodes and at most k fault-free nodes are misdiagnosed, provided that the quantity of faults is limited by t. By imposing certain conditions or restrictions, the t/k-diagnosability of some regular networks under the Preparata, Metze, and Chien (PMC) model has been determined. However, the t/k-diagnosability of many networks under the comparison model remains unidentified. In this paper, we provide new insights into the study of t/k-diagnosability under the comparison model. After introducing some new notions, such as the 0-test unit, 0-test set and 0-test subgraph, under the comparison model, we study the relationship in a system G between the 0-test subgraphs and the components of G-F, where F is the set of faulty nodes, and we obtain some important correlation properties. Based on these results, we study t/k-diagnosability under the comparison model. As a result, the t/k-diagnosability of some regular interconnection networks can be efficiently determined.

Minimum-Cost-Based Neighbour Node Discovery Scheme for Fault Tolerance under IoT-Fog Networks

The exponential growth in data traffic in the real world has drawn attention to the emerging computing technique called Fog Computing (FC) for offloading tasks in fault-free environments. This is a promising computing standard that offers higher computing benefits with a reduced cost, higher flexibility, and increased availability. With the increased number of tasks, the occurrence of faults increases and affects the offloading of tasks. A suitable mechanism is essential to rectify the faults that occur in the Fog network. In this research, the fault-tolerance (FT) mechanism is proposed based on cost optimization and fault minimization. Initially, the faulty nodes are identified based on the remaining residual energy with the proposed Priority Task-based Fault-Tolerance (PTFT) mechanism. The Minimum-Cost Neighbour Candidate Node Discovery (MCNCND) algorithm is proposed to discover the neighbouring candidate Fog access node that can replace the faulty Fog node. The Replication and Pre-emptive Forwarding (RPF) algorithm is proposed to forward the task information to the new candidate Fog access node for reliable transmission. These proposed mechanisms are simulated, analysed, and compared with existing FT methods. It is observed that the proposed FT mechanism improves the utilization of an active number of Fog access nodes. It also saved a residual energy of 1.55 J without replicas, compared to the 0.85 J of energy that is used without the FT method.

On Practical Reconstruction of Quality Virtual Backbones in Heterogeneous Wireless Sensor Networks With Faulty Nodes

On Practical Reconstruction of Quality Virtual Backbones in Heterogeneous Wireless Sensor Networks With Faulty Nodes

Identification of edge removal fault in Boolean networks and disjunctive Boolean networks

It is meaningful to identify various faults occurring in dynamic systems as early as possible. This paper explores the identification of edge removal fault in Boolean networks (BNs). At first, with the help of semi-tensor product of matrices, the algebraic formulation is presented for the faulty BNs subject to an edge removal fault. After that, a fault-triggered matrix is constructed to uncover the relationship of algebraic formulations between non-faulty BN and faulty BN, based on which, a kind of fault identification equation is established to identify the two faulty nodes in the single edge removal fault. Furthermore, a fault identification matrix is constructed to identify the faulty nodes in the single and multiple edge removal faults of a disjunctive BN, whose dimension is much smaller than the fault-triggered matrix. Finally, the obtained results are demonstrated by the Drosophila Spz processing model.

Design of fault tolerant algorithm for network on chip router using field programmable gate array

<p class="Abstract">Many internet protocol (IP) modules are present in contemporary system on chips (SoCs). This could provide an issue with interconnection among different IP modules, which would limit the system's ability to scale. Traditional bus-based SoC architectures have a connectivity bottleneck, and network on chip (NoC) has evolved as an embedded switching network to address this issue. The interconnections between various cores or IP modules on a chip have a significant impact on communication and chip performance in terms of power, area latency and throughput. Also, designing a reliable fault tolerant NoC became a significant concern. In fault tolerant NoC it becomes critical to identify faulty node and dynamically reroute the packets keeping minimum latency. This study provides an insight into a domain of NoC, with intention of understanding fault tolerant approach based on the XY routing algorithm for 4×4 mesh architecture. The fault tolerant NoC design is synthesized on Field programmable gate array (FPGA).</p>

A graph neural network based fault diagnosis strategy for power communication networks

ABSTRACT The power communication network (PCN) is the backbone network of the power system. However, faulty nodes in the network may cause communication interruptions, seriously affecting the reliable operation of the power system. Therefore, accurate diagnosis of faulty nodes is crucial for timely detection, localization, and troubleshooting. Based on graph neural networks, we propose a Neighbour Selection and Merge Fault Diagnosis (NSMFD) strategy, which aims to identify faulty nodes capturing graph structure information and node feature information. First, we construct a graph representation of PCN, where nodes represent devices in the network and edges represent the connections between devices. Then, we use sampling and aggregation in node embedding to capture adjacent feature information of nodes, gradually fuse and update node representations through graph convolutional layers, which could be applied as the input layer of diagnostic process. Finally, we use softmax and cross entropy loss function to get a probabilistic representation and optimize it by backpropagation for prediction. We conduct experiments using real PCN datasets and compare it with other advanced diagnostic methods in terms of accuracy, false positive rate, and false negative rate. Compared with diagnostic methods, our method can accurately identify faulty nodes and achieve timely fault detection and recovery.

Fault-tolerant Hamiltonian cycle strategy for fast node fault diagnosis based on PMC in data center networks.

System-level fault diagnosis model, namely, the PMC model, detects fault nodes only through the mutual testing of nodes in the system without physical equipment. In order to achieve server nodes fault diagnosis in large-scale data center networks (DCNs), the traditional algorithm based on the PMC model cannot meet the characteristics of high diagnosability, high accuracy and high efficiency due to its inability to ensure that the test nodes are fault-free. This paper first proposed a fault-tolerant Hamiltonian cycle fault diagnosis (FHFD) algorithm, which tests nodes in the order of the Hamiltonian cycle to ensure that the test nodes are faultless. In order to improve testing efficiency, a hierarchical diagnosis mechanism was further proposed, which recursively divides high scale structures into a large number of low scale structures based on the recursive structure characteristics of DCNs. Additionally, we proved that $ 2(n-2){n^{k-1}} $ and $ (n-2){t_{n, k}}/{t_{n, 1}} $ faulty nodes could be detected for $ BCub{e_{n, k}} $ and $ DCel{l_{n, k}} $ within a limited time for the proposed diagnosis strategy. Simulation experiments have also shown that our proposed strategy has improved the diagnosability and test efficiency dramatically.

An algorithm for conditional-fault local diagnosis of multiprocessor systems under the MM⁎ model

Diagnosis is a crucial subject for maintaining the reliability of multiprocessor systems. Under the MM⁎ diagnosis model, Sengupta and Dahbura proposed a polynomial-time algorithm with time complexity O(N5) to diagnose a system with N processors. In this paper, we propose a (α,β)-trees combination S(u,X,α,β) and give an algorithm to identify the fault or fault-free status of each processor for conditional local diagnosis under the MM⁎ model. According to our results, a connected network with a (α,β)-trees combination S(u,X,α,β) for a node u is conditionally locally (α+2β−3)-diagnosable at node u and the time complexity of our algorithm to diagnose u is O(α2β+αβ2). As an application, we show that our algorithm can identify the status of each node of n-dimensional star graph Sn if the faulty node number does not exceed 3n−8. Compared with existing algorithms, our algorithm allows more faulty nodes in a multiprocessor system.

Enhancing Fault Detection in Wireless Sensor Networks Through Support Vector Machines: A Comprehensive Study

The Wireless Sensor Network (WSN) consists of many sensors that are distributed in a specific area for the purpose of monitoring physical conditions. Factors such as hardware limitations, limited resources, unfavourable WSN deployment environment, and the presence of various attacks on nodes can lead to the presence of Faulty Nodes in a WSN. This raises the problem of detecting Faulty Nodes and avoiding Data loss. Detecting Faulty Nodes in real-world scenarios will improve the quality of a WSN. The research was aimed at developing an algorithm to determine the location of Faulty Nodes in a WSN. The algorithm uses characteristics of Machine Learning and Support Vector Machines (SVM), which use the classification of Data into true and false. A Mathematical Model for determining Faulty Nodes using the SVM is considered. A methodology for detecting a Faulty Node is demonstrated, which consists of Data Collection, Feature Extraction, Training, and Testing the Model. The Results of simulated experiments that were conducted with different numbers of nodes from 50 to 320 are shown. The Model is tested on Data very similar to real-world sensing Data to evaluate the ability of the Model to detect failed nodes and calculate training and testing errors. As a result, the training error is 4.6667%, the accuracy of detecting faulty nodes was 97%. The simulation results demonstrate the high stability of the proposed algorithm and are suitable for network environments with irregular node distribution or coverage gaps. In real scenarios, it can provide a high level of uninterrupted operation of the WSN and lossless data transmission. Shortcomings and prospects in research on fault detection in WSN, such as studying real-world hardware issues and its security, were presented.