Prasenjit Chanak

Effective fault detection and routing scheme for wireless sensor networks

Display Omitted An energy efficient fault detection and data routing scheme (EFDR) is proposed for sensor nodes hardware.Cellular automata (CA) rules have been employed for sensor node and network management.The proposed scheme reuses the faulty sensor nodes in order to improve the network performances.The proposed method uses vector based fault detection model for sensor circuit fault identification.The performance of the EFDR is better in terms of network coverage, network life time and energy consumption. In a wireless sensor network (WSN), random occurrences of faulty nodes degrade the quality of service of the network. In this paper, we propose an efficient fault detection and routing (EFDR) scheme to manage a large size WSN. The faulty nodes are detected by neighbour nodes temporal and spatial correlation of sensing information and heart beat message passed by the cluster head. In EFDR scheme, three linear cellular automata (CA) are used to manage transmitter circuit/ battery condition/microcontroller fault, receiver circuit fault and sensor circuit fault representation. On the other hand, L-system rules based data routing scheme is proposed to determine optimal routing path between cluster head and base station. The proposed EFDR technique is capable of detecting and managing the faulty nodes in an efficient manner. The simulation results show 86% improvement in the rate of energy loss compared to an existing algorithm.

EERIH: Energy efficient routing via information highway in sensor network

Wireless Sensor Network is a collection of micro sensors which are gathering data in various situations from monitoring environment and transmitting it to base station. The most important challenging issue in wireless sensor network is energy conservation. The communication process must be designed such a way that it can conserve the limited energy resources of the sensors. In this paper we are proposing an energy efficient routing in wireless sensor network with the help of information high way which is designed by the proposed modified cyclic cellular automata scheme. The energy efficient routing via information high way in sensor network (EERIH) is more energy saving compared to other existing techniques. In our proposed model, nodes send their data to base station with minimum energy loss by the information high way. The EERIH is also tolerating faults of cluster head and traffic nodes failure.

Energy efficient fault-tolerant multipath routing scheme for wireless sensor networks

Abstract In wireless sensor network (MSN), reliability is the main issue to design any routing technique. To design a comprehensive reliable wireless sensor network, it is essential to consider node failure and energy constrain as inevitable phenomena. In this paper we present energy efficient node fault diagnosis and recovery for wireless sensor networks referred as energy efficient fault tolerant multipath routing scheme for wireless sensor network. The scheme is based on multipath data routing. One shortest path is used for main data routing in our scheme and other two backup paths are used as alternative path for faulty network and to handle the overloaded traffic on main channel. Shortest pat data routing ensures energy efficient data routing. Extensive simulation results have revealed that the performance of the proposed scheme is energy efficient and can tolerates more than 60% of fault.

EER: Energy Efficient Routing in Wireless Sensor Networks

Sensor Networks are usually large collections of sensing nodes. The main constrain of sensor network is that the sensor nodes have constant power source. They cannot be recharged or replaced once deployed. Topological control is a popular technique for energy conservation in sensor networks. Therefore, numbers of cluster base energy conservation technique are defined previously. In cluster base technique, main problems are proper data aggregation and a large amount of energy wastage to make cluster. In this paper we study the problem of efficient data propagation with proper data aggregation model in wireless sensor networks. The EER (Energy Efficient Routing in Wireless Sensor Network) technique define optimal size of clusters where data are aggregated properly and data routing occurs in energy efficient way. In EER, clusters are generated with the help of L-system CA scheme. Data routing path is also decided by L-system CA scheme. The simulation result depicts that life time of the nodes increases with respect to other existing energy conservation techniques.

Fuzzy rule-based faulty node classification and management scheme for large scale wireless sensor networks

Fuzzy logic based hardware status analysis of the deployed sensor nodes.Faulty sensor nodes are reused to improve WSNs quality of services (QoS).Data routing algorithm improves reusability of the faulty nodes.Simulations verify the effectiveness of the approach with comparisons. In a wireless sensor network (WSNs), probability of node failure rises with increase in number of sensor nodes within the network. The, quality of service (QoS) of WSNs is highly affected by the faulty sensor nodes. If faulty sensor nodes can be detected and reused for network operation, QoS of WSNs can be improved and will be sustainable throughout the monitoring period. The faulty nodes in the deployed WSN are crucial to detect due to its improvisational nature and invisibility of internal running status. Furthermore, most of the traditional fault detection methods in WSNs do not consider the uncertainties that are inherited in the WSN environment during the fault diagnosis period. Resulting traditional fault detection methods suffer from low detection accuracy and poor performance. To address these issues, we propose a fuzzy rule-based faulty node classification and management scheme for WSNs that can detect and reuse faulty sensor nodes according to their fault status. In order to overcome uncertainties that are inherited in the WSN environment, a fuzzy logic based method is utilized. Fuzzy interface engine categorizes different nodes according to the chosen membership function and the defuzzifier generates a non-fuzzy control to retrieve the various types of nodes. In addition, we employed a routing scheme that reuses the retrieved faulty nodes during the data routing process. We performed extensive experiments on the proposed scheme using various network scenarios. The experimental results are compared with the existing algorithms to demonstrate the effectiveness of the proposed algorithm in terms of various important performance metrics.

Obstacle avoidance routing scheme through optimal sink movement for home monitoring and mobile robotic consumer devices

In recent years, ZigBee has been proven to be an excellent solution to create scalable and flexible home automation networks. In a home automation network, consumer devices typically collect data from a home monitoring environment and then transmit the data to an end user through multi-hop communication without the need for any human intervention. However, due to the presence of typical obstacles in a home environment, error-free reception may not be possible, particularly for power constrained devices. A mobile sink based data transmission scheme can be one solution but obstacles create significant complexities for the sink movement path determination process. Therefore, an obstacle avoidance data routing scheme is of vital importance to the design of an efficient home automation system. This paper presents a mobile sink based obstacle avoidance routing scheme for a home monitoring system. The mobile sink collects data by traversing through the obstacle avoidance path. Through ZigBee based hardware implementation and verification, the proposed scheme successfully transmits data through the obstacle avoidance path to improve network performance in terms of life span, energy consumption and reliability. The application of this work can be applied to a wide range of intelligent pervasive consumer products and services including robotic vacuum cleaners and personal security robots.

Distributed Multipath Fault Tolerance Routing Scheme for Wireless Sensor Networks

This paper reports a distributed multipath fault tolerance routing scheme for wireless sensor network (DFTR). The multipath fault tolerance routing provides better resilience to various faults in wireless sensor network (WSN). However, the multipath fault tolerance routing has suffered by two problems regarding the routing strategy design. The first problem is that the traffic overhead becomes very high if the data are transmitted individually by the large number of duplicate routing paths between the source and base station. The second one is that the high traffic creates energy hole in the network which decrease the network life span rapidly. In this paper, a distributed multipath fault tolerant routing scheme has developed to tackle these problems in WSN. Effective size cluster formation is employed to prevent traffic over head and energy hole. Level based multipath tree mechanism is developed to tolerate nodes and transmission fault. The experimental results verify that the effectiveness and feasibility of the proposed work.

Load management scheme for energy holes reduction in wireless sensor networks

Display Omitted Load management strategy for large scale wireless sensor networks.Energy efficient on demand clustering strategy.Load balancing data routing mechanism.Load balancing data routing mechanism reduces energy holes from the network.Experimental results for verifying the effectiveness and feasibility of the proposed work. In a wireless sensor network where sensors are arranged into a flat topology, sensors near the sink consume much more energy than sensors at the boundary of the network. Sensors near the sink relay many packets than far away sensors to the sink. After these sensors expire, energy holes are created near the sink. Therefore, other sensors cannot reach to the sink and the network becomes disconnected. In this paper, we propose some strategies that can balance energy consumption of the deployed sensors and reduce energy holes from the network by balancing the communication load as equally as possible. We performed extensive experiments on the proposed algorithm using various network scenarios and compared it with other existing algorithms. The experimental results verify the effectiveness and feasibility of the proposed work in terms of network lifetime, energy consumption, and other important network parameters.

DFDNM: A Distributed Fault Detection and Node Management Scheme for Wireless Sensor Network

This paper presents a distributed fault detection and node management scheme with the help of cellular automata in wireless sensor networks. The node failure is detected in distributed way and the cellular automata are used for network management. The linear cellular automata run on every sensor nodes and each sensor node set own state with the help of CA. The faulty are detected by neighbour node’s temporal and spatial correlation of sensing information and heart beat message passing by the cluster head. The proposed distributed fault detection and node management scheme (DFDNM) can detects and manages the faulty nodes in an energy efficient manner. The simulation result shows how DFDNM perform well comparison to others faults detection algorithms.

Energy-aware distributed routing algorithm to tolerate network failure in wireless sensor networks

Wireless Sensor Networks are prone to link/node failures due to various environmental hazards such as interference and internal faults in deployed sensor nodes. Such failures can result in a disconnection in part of the network and the sensed data being unable to obtain a route to the sink(s), i.e. a network failure. Network failures potentially degrade the Quality of Service (QoS) of Wireless Sensor Networks (WSNs). It is very difficult to monitor network failures using a manual operator in a harsh or hostile environment. In such environments, communication links can easy fail because of node unequal energy depletion and hardware failure or invasion. Thus it is desirable that deployed sensor nodes are capable of overcoming network failures. In this paper, we consider the problem of tolerating network failures seen by deployed sensor nodes in a WSN. We first propose a novel clustering algorithm for WSNs, termed Distributed Energy Efficient Heterogeneous Clustering (DEEHC) that selects cluster heads according to the residual energy of deployed sensor nodes with the aid of a secondary timer. During the clustering phase, each sensor node finds k-vertex disjoint paths to cluster heads depending on the energy level of its neighbor sensor nodes. We then present a k-Vertex Disjoint Path Routing (kVDPR) algorithm where each cluster head finds k-vertex disjoint paths to the base station and relays their aggregate data to the base station. Furthermore, we also propose a novel Route Maintenance Mechanism (RMM) that can repair k-vertex disjoint paths throughout the monitoring session. The resulting WSNs become tolerant to k-1 failures in the worst case. The proposed scheme has been extensively tested using various network scenarios and compared to the existing state of the art approaches to show the effectiveness of the proposed scheme.