Fault detection and diagnosis of induction motors using motor current signature analysis and a hybrid FMM-CART model

In this paper, a novel approach to detect and classify comprehensive fault conditions of induction motors using a hybrid fuzzy min-max (FMM) neural network and classification and regression tree (CART) is proposed. The hybrid model, known as FMM-CART, exploits the advantages of both FMM and CART for undertaking data classification and rule extraction problems. A series of real experiments is conducted, whereby the motor current signature analysis method is applied to form a database comprising stator current signatures under different motor conditions. The signal harmonics from the power spectral density are extracted as discriminative input features for fault detection and classification with FMM-CART. A comprehensive list of induction motor fault conditions, viz., broken rotor bars, unbalanced voltages, stator winding faults, and eccentricity problems, has been successfully classified using FMM-CART with good accuracy rates. The results are comparable, if not better, than those reported in the literature. Useful explanatory rules in the form of a decision tree are also elicited from FMM-CART to analyze and understand different fault conditions of induction motors.

Application of the fuzzy min-max neural network to fault detection and diagnosis of induction motors

In this paper, an application of the motor current signature analysis (MCSA) method and the fuzzy min–max (FMM) neural network to detection and classification of induction motor faults is described. The finite element method is employed to generate simulated data pertaining to changes in the stator current signatures under different motor conditions. The MCSA method is then used to process the stator current signatures. Specifically, the power spectral density is employed to extract harmonics features for fault detection and classification with the FMM network. Various types of induction motor faults, which include stator winding faults and eccentricity problems, under different load conditions are experimented. The results are analyzed and compared with those from other methods. The outcomes indicate that the proposed technique is effective for fault detection and diagnosis of induction motors under different conditions.

Online motor fault detection and diagnosis using a hybrid FMM-CART model

In this brief, a hybrid model combining the fuzzy min-max (FMM) neural network and the classification and regression tree (CART) for online motor detection and diagnosis tasks is described. The hybrid model, known as FMM-CART, exploits the advantages of both FMM and CART for undertaking data classification and rule extraction problems. To evaluate the applicability of the proposed FMM-CART model, an evaluation with a benchmark data set pertaining to electrical motor bearing faults is first conducted. The results obtained are equivalent to those reported in the literature. Then, a laboratory experiment for detecting and diagnosing eccentricity faults in an induction motor is performed. In addition to producing accurate results, useful rules in the form of a decision tree are extracted to provide explanation and justification for the predictions from FMM-CART. The experimental outcome positively shows the potential of FMM-CART in undertaking online motor fault detection and diagnosis tasks.

Motor fault detection and diagnosis using a hybrid FMM-CART model with online learning

In this paper, a hybrid online learning model that combines the fuzzy min-max (FMM) neural network and the Classification and Regression Tree (CART) for motor fault detection and diagnosis tasks is described. The hybrid model, known as FMM-CART, incorporates the advantages of both FMM and CART for undertaking data classification (with FMM) and rule extraction (with CART) problems. In particular, the CART model is enhanced with an importance predictor-based feature selection measure. To evaluate the effectiveness of the proposed online FMM-CART model, a series of experiments using publicly available data sets containing motor bearing faults is first conducted. The results (primarily prediction accuracy and model complexity) are analyzed and compared with those reported in the literature. Then, an experimental study on detecting imbalanced voltage supply of an induction motor using a laboratory-scale test rig is performed. In addition to producing accurate results, a set of rules in the form of a decision tree is extracted from FMM-CART to provide explanations for its predictions. The results positively demonstrate the usefulness of FMM-CART with online learning capabilities in tackling real-world motor fault detection and diagnosis tasks. © 2014 Springer Science+Business Media New York.

Recover fault services via complex service-to-node mappings in wireless sensor networks

With the motivation of seamlessly extending wireless sensor networks to the external environment, service-oriented architecture comes up as a promising solution. However, as sensor nodes are failure prone, this consequently renders the whole wireless sensor network to seriously faulty. When a particular node is faulty, the service on it should be migrated into those substitute sensor nodes that are in a normal status. Currently, two kinds of approaches exist to identify the substitute sensor nodes: the most common approach is to prepare redundancy nodes, though the involved tasks such as maintaining redundancy nodes, i.e., relocating the new node, lead to an extra burden on the wireless sensor networks. More recently, other approaches without using redundancy nodes are emerging, and they merely select the substitute nodes in a sensor node's perspective i.e., migrating the service of faulty node to it's nearest sensor node, though usually neglecting the requirements of the application level. Even a few work consider the need of the application level, they perform at packets granularity and don't fit well at service granularity. In this paper, we aim to remove these limitations in the wireless sensor network with the service-oriented architecture. Instead of deploying redundancy nodes, the proposed mechanism replaces the faulty sensor node with consideration of the similarity on the application level, as well as on the sensor level. On the application level, we apply the Bloom Filter for its high efficiency and low space costs. While on the sensor level, we design an objective solution via the coefficient of a variation as an evaluation for choosing the substitute on the sensor level. © 2014 Springer Science+Business Media New York.

Fault tolerance in data gathering wireless sensor networks

In data gathering wireless sensor networks, data loss often happens due to external faults such as random link faults and hazard node faults, since sensor nodes have constrained resources and are often deployed in inhospitable environments. However, already known fault tolerance mechanisms often bring new internal faults (e.g. out-of-power faults and collisions on wireless bandwidth) to the original network and dissipate lots of extra energy and time to reduce data loss. Therefore, we propose a novel Dual Cluster Heads Cooperation (CoDuch) scheme to tolerate external faults while introducing less internal faults and dissipating less extra energy and time. In CoDuch scheme, dual cluster heads cooperate with each other to reduce extra costs by sending only one copy of sensed data to the Base Station; also, dual cluster heads check errors with each other during the collecting data process. Two algorithms are developed based on the CoDuch scheme: CoDuch-l for tolerating link faults and CoDuch-b for tolerating both link faults and node faults; theory and experimental study validate their effectiveness and efficiency. © 2010 The Author Published by Oxford University Press on behalf of The British Computer Society. All rights reserved.

Multi-level virtual ring : a foundation network architecture to support peer-to-peer application in wireless sensor network

Two main problems prevent the deployment of peer-to-peer application in a wireless sensor network: the index table, which should be distributed stored rather than uses a central server as the director; the unique node identifier, which cannot use the global addresses. This paper presents a multi-level virtual ring (MVR) structure to solve these two problems.

The index table in MVR is distributed stored by using the DHT technique. MVR is constructed decentralized and runs on mobile nodes themselves, requiring no central server or interruption. Naming system in MVR uses natural names rather than global addresses to identify sensor nodes. The MVR can route directly on the name identifiers of the sensor nodes without being aware the location. Some sensor nodes are selected as the backbone nodes by the backbone selection algorithm and are placed on the different levels of the virtual rings. MVR hashes nodes’ identifiers on the virtual ring, and stores them at the backbone nodes. Furthermore, MVR adopts cross-level routing to improve the routing efficiency.

Experiments using ns2 simulator for up to 200 nodes show that the storage and bandwidth requirements of MVR grow slowly with the size of the network. Furthermore, MVR has demonstrated as self-administrating, fault-tolerant, and resilient under the different workloads.

Flock inspired area coverage using wireless boid-like sensor agents

Simulated flocking is achievable using three boid rules [13]. We propose an area coverage model inspired by Reynolds’ flocking algorithm, investigating strategies for achieving quality coverage using flocking rules. Our agents are identical and autonomous, using only local sensory information for indirect communication. Upon deployment, agents are in the default separation mode. The cohesion rule would then guarantee that agents remain within the swarm, covering spaces with explored neighbour spaces. Four experiments are conducted to evaluate our model in terms of coverage quality achieved. We firstly investigate agents’ separation speed before the speed with which isolated agents re-organizes is investigated. The third experiment compares coverage quality achieved using our model with coverage quality achieved using random guessing. Finally, we investigate fault tolerance in the event of agents’ failures. Our model exhibits good separation and cohesion speed, achieving high quality coverage. Additionally, the model is fault tolerant and adaptive to agents’ failures.

Multi-level virtual ring : an architecture for content routing in wireless sensor network

Two main problems prevent the deployment of content delivery in a wireless sensor network: the address, which is widely used in the Internet as the identifier, is meaningless in wireless network, and the routing efficiency is a big concern in wireless sensor network. This paper presents an embedded multi-level ring (MVR) structure to address those two problems. The MVR uses names rather than addresses to identify sensor nodes. The MVR routes packets on the name identifiers without being aware the location. Some sensor nodes are selected as the backbone nodes and are placed on the different levels of the virtual rings. MVR hashes nodes and contents identifiers, and stores them at the backbone nodes. MVR takes the cross-level routing to improve the routing efficiency. Further, MVR is constructed decentralized and runs on the mobile nodes themselves, requiring no central control. Experiments using ns2 simulator for up to 200 nodes show that the storage and bandwidth requirements of MVR grow slowly with the size of the network. Furthermore, MVR has demonstrated as self-administrating, fault-tolerant, and resilient under the different workloads. We also discuss alternative implementation options, and future work.

Minimal-order functional observer-based residual generators for fault detection and isolation of dynamical systems

This paper examines the design of minimal-order residual generators for the purpose of detecting and isolating actuator and/or component faults in dynamical systems. We first derive existence conditions and design residual generators using only first-order observers to detect and identify the faults. When the first-order functional observers do not exist, then based on a parametric approach to the solution of a generalized Sylvester matrix equation, we develop systematic procedures for designing residual generators utilizing minimal-order functional observers. Our design approach gives lower-order residual generators than existing results in the literature. The advantages for having such lower-order residual generators are obvious from the economical and practical points of view as cost saving and simplicity in implementation can be achieved, particularly when dealing with high-order complex systems. Numerical examples are given to illustrate the proposed fault detection and isolation schemes. In all of the numerical examples, we design minimum-order residual generators to effectively detect and isolate actuator and/or component faults in the system.