Fault-tolerant clustering of wireless sensor networks

International Journal of Computer Applications, 2012

Wireless Sensor Networks (WSNs) are an important focus of research due to their many envisioned applications. They are formed by small, inexpensive and resource limited devices that can interact with the environment and communicate in a wireless manner with other devices. For energy conservation, the clustering technique is used where network organizes around a small set of cluster heads which then gather data from their local cluster aggregate this data and transmit it to the base station. Here we present two models for adding faulttolerance to clustering algorithms with a hierarchy maintained among various levels of cluster heads from base station. Since, sensor nodes are often deployed in harsh environments, they are prone to failure. Cluster-head failure can leave a cluster disconnected from the base station until the network reorganizes again. The proposed model "FTHC: Fault Tolerance in Hierarchical Clustering Environment for WSN" is used for both Inter and Intra clustering environment. We evaluate the proposed model and compare it with protocol MECH in terms of network lifetime when the cluster head fail.

2010

B y M o h a m m a d M e h r a n i , J a m s h i d S h a n b e h z a d e h , A b d o l h o s s e i n S a r r a f z a d e h , S e y e d J a v a d M i r a b e d i n i , C h r i s M a n f o r d I s l a m i c A z a d U n i v e r s i t y Abstracts-Increasing network lifetime, scalability and load balancing are important factors for wireless sensor networks. Clustering is a useful technique through which we can effect these factors. In this paper, we propose a new method of clustering which prolongs network lifetime by using energy, density and centrality factors and also the distances between nodes for making clusters. We assume a supervisor node for every cluster head which is to be its replacement when the cluster head fails. This property causes an increase in network lifetime and also helps the network to be fault tolerant. Simulation results demonstrate that using the proposed method offers significant improvement in clustering especially in network lifetime in comparison with the LEACH and HEED methods.

International Journal of Future Generation Communication and Networking, 2014

A wireless sensor network (WSN) typically consists of a large number of small sensor nodes with limited energy. Prolonged network lifetime, scalability, node mobility and load balancing are important requirements for many WSN applications. Wireless Sensor networks have limited energy resources so our main aim is to enhance network lifetime by energy balancing. Dynamic clustering plays an important role in enhancing network lifetime. In this paper we propose an idea of fault tolerant optimal path determination for forwarding data to the base station to enhance the network lifetime and implement fault tolerance at the same time. Simulation results prove the betterment of our proposed method over the existing Leach protocol and DCP.

2010

One of the major challenges in wireless sensor networks (WSN) is to meet the energy constraint of its sensor nodes while ensuring reliability of the system. Clustering is an effective self-organization approach to offer energy-efficient communication for WSNs. However, energy of a sensor node dynamically decreases when it plays a role of a cluster head. As a result some nodes die faster that shorten overall network lifetime and reduce reliability. Existing clustering techniques even with backup cluster head (BCH) consumes huge energy due to frequent re-clustering and inefficient backup cluster head selection and switching. In this paper we propose a new approach for backup cluster head scheme to reduce the frequency of re-clustering and thus to increase the network lifetime. We introduce the selection of an optimal set of backup cluster heads from the cluster member nodes and the calculation of their optimum switching time. To evaluate the efficacy of the proposed scheme we extend the HEED clustering protocol to backup cluster head. Simulation results demonstrate that our proposed approach is effective in prolonging the network lifetime that outperforms both HEED and backup clustering proposed in [10] considerably. Proposed scheme also enhances data reliability by reducing re-clustering overhead.

Wireless Sensor Networks often serve mission-critical applications in inhospitable environments such as battlefield and territorial borders. Wireless sensor and actor networks are the collection of heterogeneous elements linked by wireless medium to perform distributed sensing and acting tasks. The Actor nodes may fail for many reasons such as due of battery exhaustion, message overhead, hardware failure due to hash environment and these failures may convert the connected network into several disjoint networks that reduce the capability of network. Wireless sensor networks consist of widely distributed sensor nodes. These nodes have short energy because of its limited battery size. This low energy in turn decreases the life duration of network. The declined lifespan of network perhaps distress the application to run in-efficiently. For these reasons, many algorithms and protocols designed for wireless sensor networks which considered the energy consumption in their conception. The node failure becomes more critical when data aggregation is performed along routing paths as the data packets with aggregated data contain information from various sources and whenever one of these packets is lost a considerable amount of information will also be lost. To understand this challenges a comparative study need to done on various algorithm proposed over it.

International Journal of Distributed Sensor Networks, 2011

More often than not, wireless sensor networks (WSNs) are deployed in adverse environments, where failures of sensor nodes and disruption of connectivity are regular phenomena. Therefore, the organization or clustering of WSNs needs to be survivable to the changing situations. On the other hand, energy efficiency in WSNs remains the main concern to achieve a longer network lifetime. In this work, we associate survivability and energy efficiency with the clustering of WSNs and show that such a proactive scheme can actually increase the lifetime. We present an easy-to-implement method named DED (distributed, energy-efficient, and dualhomed clustering) which provides robustness for WSNs without relying on the redundancy of dedicated sensors, that is, without depending on node density. DED uses the information already gathered during the clustering process to determine backup routes from sources to observers, thus incurring low message overhead. It does not make any assumptions about network dimension, node capacity, or location awareness and terminates in a constant number of iterations. The correctness of the algorithm is proved analytically. Simulation results comparing with contemporary approaches demonstrate that our approach is effective both in providing survivability and in prolonging the network lifetime.

2003

Wireless sensor networks have potential to monitor environments for both military and civil applications. Due to inhospitable conditions these sensors are not always deployed uniformly ion the area of interest. Since sensors are generally constrained in on-board energy supply, efficient management of the network is crucial to extend the life of the sensors. Sensors' energy cannot support long haul communication to reach a remote command site and thus requires many levels of hops or a gateway to forward the data on behalf of the sensor. In this paper, we propose an algorithm to network these sensors in to well define clusters with less energy-constrained gateway nodes acting as cluster-heads, and balance load among these gateways. Simulation results show how our approach can balance the load and improve the lifetime of the system.

Energies, 2021

Technological advancements have led to increased confidence in the design of large-scale wireless networks that comprise small energy constraint devices. Despite the boost in technological advancements, energy dissipation and fault tolerance are amongst the key deciding factors while designing and deploying wireless sensor networks. This paper proposes a Fault-tolerant Energy-efficient Hierarchical Clustering Algorithm (FEHCA) for wireless sensor networks (WSNs), which demonstrates energy-efficient clustering and fault-tolerant operation of cluster heads (CHs). It treats CHs as no special node but equally prone to faults as normal sensing nodes of the cluster. The proposed scheme addresses some of the limitations of prominent hierarchical clustering algorithms, such as the randomized election of the cluster heads after each round, which results in significant energy dissipation; non-consideration of the residual energy of the sensing nodes while selecting cluster heads, etc. It util...

2014

ABSTRACT Energy efficiency in specific clustering protocols is highly desired in wireless sensor networks. Most existing clustering protocols periodically form clusters and statically assign cluster heads (CHs) and thus are not energy efficient. Every non‐CH node of these protocols sends data to the CH in every time slot of a frame allocated to them using the time division multiple access scheme, which is an energy‐consuming process. Moreover, these protocols do not provide any fault tolerance mechanism. Considering these limitations, we have proposed an efficient fault‐tolerant and energy‐efficient clustering protocol for a wireless sensor network. The performance of the proposed protocol was tested by means of a simulation and compared against the low energy adaptive clustering hierarchy and dynamic static clustering protocols. Simulation results showed that the fault‐tolerant and energy‐efficient clustering protocol has better performance than both the low energy adaptive clustering hierarchy and dynamic static clustering protocols in terms of energy efficiency and reliability. Copyright © 2012 John Wiley & Sons, Ltd.

International Journal of Future Computer and Communication, 2014

Wireless Sensor Network (WSN) applications have increased in recent times in fields such as environmental sensing, area monitoring, air pollution monitoring, forest res detection, machine health monitoring, and landslide detection. In such applications, there is a high need of secure communication among sensor nodes. There are different techniques to secure network data transmissions, but due to power constraints of WSN, group key based mechanism is the most preferred one. Hence, to implement scalable energy efficient secure group communication, the best approach would be hierarchical based like Clustering. In most of the WSN designs based on clustering, Base Station (BS) is the central point of contact to the outside world and in case of its failure; it may lead to total disconnection in the communication. Critical applications like these cannot afford to have BS failure as it is a gateway from sensor networks to the outside world. In order to provide better fault tolerant immediate action, a new BS at some other physical location will have to take the charge. This may lead to a total change in the hierarchical network topology, which in turn leads to re-clustering the entire network and in turn formation of new security keys. Therefore, there is a need to find a suitable algorithm which clusters sensor nodes in such a way that when a BS fails and a new BS takes the charge, new group key gets established with minimum computation and less energy consumption.

Recent Trends in Intensive Computing

A sensor network can be defined an assembly of sensor nodes which associated by all together to complete particular detailed task. These sensor nodes are mostly in huge amounts also compactly installed moreover in the network area or very near to it. Sensor networks can be worked for several sectors such that: environmental monitoring, home, health care, Industries, military, and habitat. Failure of network is unavoidable in wireless sensor networks because of unfriendly location and non-reachable placement. Hence, it is needed that network faults are discovered in time and proper methods are engaged to bear network task. So, it is important to deliver fault forbearing systems for spread sensor applications. Numerous new work in this field yield severely different methodologies to talking the fault tolerance concern in routing. In this propose review and equate present fault tolerant practices to provision for sensor applications.

One of the most important and efficient factors in longevity of wireless sensor networks is their energy consumption.

—Some WSN by a lot of immobile node and with the limited energy and without further charge of energy. Whereas extension of many sensor nodes and their operation. Hence it is normal unactive nodes miss their communication in network, hence split the network. For avoidance split of network, we proposed a fault recovery corrupted node and Self Healing is necessary. In this paper, we design techniques to maintain the cluster structure in the event of failures caused by energy-drained nodes. Initially, node with the maximum residual energy in a cluster becomes cluster heed and node with the second maximum residual energy becomes secondary cluster heed. Later on, selection of cluster heed and secondary cluster heed will be based on available residual energy. We use Matlab software as simulation platform quantities. Like, energy consumption at cluster and number of clusters is computed in evaluation of proposed algorithm. Eventually we evaluated and compare this proposed method against previous method and we demonstrate our model is better optimization than other method, in energy consumption rate.

Computer Communications

Sensor networks are deployed to accomplish certain specific missions over a period of time. It is essential that the network continues to operate, even if some of its nodes fail. It is also important that the network is able to support the mission for a minimum specified period of time. Hence, the design of a sensor network should not only provide some guarantees that all data from the sensor nodes are gathered at the base station, even in the presence of some faults, but should also allow the network to remain functional for a specified duration. This paper considers a two-tier, hierarchical sensor network architecture, where some relay nodes, provisioned with higher power and other capabilities, are used as cluster heads. Given a distribution of sensor nodes in a sensor network, finding the locations to place a minimum number of relay nodes such that, each sensor node is covered by at least one relay node, is known to be a computationally difficult problem. In addition, for successful and reliable data communication, the relay nodes network needs to be connected, as well as resilient to node failures. In this paper, a novel integrated Integer Linear Program (ILP) formulation is proposed, which, unlike existing techniques, not only finds a suitable placement strategy for the relay nodes, but also assigns the sensor nodes to the clusters and determines a load-balanced routing scheme. Therefore, in addition to the desired levels of fault tolerance for both the sensor nodes and the relay nodes, the proposed approach also meets specified performance guarantees with respect to network lifetime by limiting the maximum energy consumption of the relay nodes.