scholarly journals Increasing life-time of wireless sensor network using energy-efficient and fault tolerance algorithms

Author(s):  
Sama Hussam Sabah ◽  
Muayad Sadik Croock

Energy-efficiency ofwireless sensor networks (WSN) becomes an essential issue in the research area. This is because of the energy constraints in WSN that depend on a battery, which is difficult to replace or recharge; therefore, multiple clustering algorithms were proposed to achieve efficiency in using the available energy as much as possible. This paper proposed energy-efficient and fault-tolerance algorithms that enhance thelow energy adaptive clustering hierarchy (LEACH) protocol by three algorithms. The first focuses on selecting the best cluster head and the second focuses on minimizing the required nodes within the same cluster. Simultaneously, the third fault tolerance algorithm uses software engineering techniques like sleep schedules to increase network lifetime as much as possible. The testing results of the proposed algorithms prove the claim of enhancing the lifetime of WSN. In order to check improvement of lifetime of WSN we have compered the results of the proposed algorithms with standered algorthim. The results show prove the claim of enhancing the life-time of WSN, where the total lifetime of WSN rise from about 550 rounds to reach 4100 when utilized self-checking process and rised up to 5200 after enhance minimum distans.

Author(s):  
Gaurav Kumar ◽  
Harjit Pal Singh

Life time of sensor network is very crucial and hot topic of research in wireless sensor network (WSN) from past to future. It is crucial due to system recharging and replacing the sensors are difficult and costly affair. Clustering provides some solution to extend the network lifetime. Existing clustering algorithms, such as LEACH and other heterogeneous routing protocol, can significantly minimize the power consumption on each sensor and prolong the network lifetime but not consideration of coverage network area. Balanced Energy Efficient Multi-hop (BEEM) algorithm has implemented to simulated WSN network and the selection of the cluster head on the basis of firefly (FF) optimization algorithm. Performance of the proposed hybrid Algorithm is well suited in terms of energy consumptions, stability period, network lifetime, throughput, Alive & Dead Nodes & other parameters. Proposed algorithm has showed improved result in energy consumption with firefly-BEEM over the existing BEEM.


Author(s):  
Sandeep Kaur ◽  
Dr. Rajeev Bedi ◽  
Mohit Marwaha

In WSNs, the only source to save life for the node is the battery consumption. During communication with other area nodes or sensing activities consumes a lot of power energy in processing the data and transmitting the collected/selected data to the sink. In wireless sensor networks, energy conservation is directly to the network lifetime and energy plays an important role in the cluster head selection. A new threshold has been formulated for cluster head selection, which is based on remaining energy of the sensor node and the distance from the base station. Proposed approach selects the cluster head nearer to base station having maximum remaining energy than any other sensor node in multi-hop communication. The multi hop approach minimizing the inter cluster communication without effecting the data reliability.


2014 ◽  
Vol 610 ◽  
pp. 927-932
Author(s):  
Ahmed Rouaba ◽  
Nouamane Soualmi ◽  
He Zun Wen

A wireless sensor network (WSN) consists of large number of autonomous sensors nodes; these nodes communicate with each other in dispersed manner to observe the environment. WSNs become one of the most important researches in modern communication systems. The energy source of nodes is limited and practically it is impossible to change or charge the battery. In order to save energy and increases the life time of battery in WSNs. Many energy routing protocols using the clustering were proposed in the literature. Low Energy Adaptive Clustering Hierarchy (LEACH) is the most famous routing protocol. In this paper we propose a new algorithm to choose the cluster head which has the highest energy. We shared the network to four regions, between them 90° for each part we find the powerful sensor between the sensors groups, and this last will be the cluster head of this round. Each sensor sends its data to the nearest cluster head and this last will send it to the sink. The same work for five and six clusters heads with sink in the center and in the corner (100, 0) is done.


2021 ◽  
Vol 4 (2) ◽  
pp. 25
Author(s):  
Anupkumar Bongale ◽  
Arunkumar Bongale ◽  
Satish Kumar ◽  
Rahul Joshi ◽  
Kishore Bhamidipati

Efficient energy utilization and network life prolongation are primary objectives to be considered when designing a Wireless Sensor Network. Cluster-based routing protocols are most suitable for achieving such goals. Energy and Optimal Inter Cluster Head Distance (EOICHD) is a cluster-based hierarchical routing protocol inspired by the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol. EOICHD resolves the problems associated with LEACH protocol, such as selecting cluster head nodes in close proximity. By carefully selecting the cluster head nodes based on residual energy and optimal inter-cluster head distance, EOICHD ensures that selected cluster head nodes are separated by a certain optimal distance. This approach ensures uniform distribution of cluster head nodes across the entire network. The study of the EOICHD protocol presented so far is not sufficient. Hence, in this paper, we propose three variants of EOICHD protocol to understand its behavior in a better manner. A comparative analysis of all three EOICHD variants, LEACH and LEACH-central constrained (LEACH-C) protocol, is performed by considering comparative parameters such as alive nodes, cumulative network energy, data packets arrived at the base station, and stability of the network.


2021 ◽  
Vol 20 (3) ◽  
pp. 161-166
Author(s):  
Asma Mesmoudi ◽  
Samira Mesmoudi ◽  
Zakarya Houari ◽  
Khelifa Mostefa

Wireless sensor networks have recently gained a lot of attention from the scientific community due to their very wide spectrum of applications. In such networks, the sensor nodes have limited resources. These constraints impose many challenges to the design of related protocols. Especially, routing protocols should be energy-efficient for the prolonged network lifetime. The LEACH protocol is the most popular energy-efficient hierarchical clustering protocol for WSNs that was proposed for reducing power consumption. However, LEACH suffers from several drawbacks such as the non uniform distribution of Cluster Head nodes, the possibility of choosing a low energy node as Cluster Head, etc. In this paper, an attempt is made to overcome this shortcoming by introducing a new hierarchical clustering protocol, called SCHP (Static Cluster-based Hierarchical Protocol). The SCHP protocol is based on a static cluster creation and an optimal cluster head selection. Simulation results show that the proposal guarantees better performance than the LEACH Protocol that is considered as the baseline in the literature. We used many metrics, as packet loss rate, end-to-end delay, and energy consumption to evaluate the efficiency of our proposal. We show also that the SCHP protocol can improve the network lifetime.


Author(s):  
Yasser R. Alselehibi Yasser R. Alselehibi

The technology revolution in wireless communications and micro-electro-mechanical systems (MEMS) directly affects the development of wireless sensor networks (WSNs), which are used in several application areas, including the military, home, and environment. One of the best categories of routing networks in WSNs are hierarchical protocols (cluster-based). The wellknown protocols in this category include the Low Energy Adaptive Clustering Hierarchy (LEACH). However, the LEACH is vulnerable to many attacks. To provide cryptographic protection against outsider attacks, a modified version of LEACH, called Enhancing Secure LEACH (MS-LEACH) protocol, is used. MS-LEACH enhances security but increases power consumption. To maintain an acceptable level of security and decrease the power consumption of secure LEACH protocols, the present research proposes a Secure Lightweight LEACH (SLWLEACH) scheme. The simulation results show that this proposed SLW-LEACH protocol outperforms the MS-LEACH in terms of ne


2016 ◽  
Vol 16 (3) ◽  
pp. 154-164 ◽  
Author(s):  
S. Ananda Kumar ◽  
P. Ilango ◽  
Grover Harsh Dinesh

Abstract Many studies have been proposed on clustering protocols for various applications in Wireless Sensor Network (WSN). The main objective of the clustering algorithm is to minimize the energy consumption, deployment of nodes, latency, and fault tolerance in network. In short high reliability, robustness and scalability can be achieved. Clustering techniques are mainly used to extend the lifetime of wireless sensor network. The first and foremost clustering algorithm for wireless sensor network was Low Energy Adaptive Clustering Hierarchy (LEACH). As per LEACH, some Cluster Head (CH) may have more nodes, some other may have less nodes, which affects the network performance. The proposed method MaximuM-LEACH provides a solution by load balancing the number of nodes equally by fixing the average value N, so the life time of the network is increased.


Sign in / Sign up

Export Citation Format

Share Document