scholarly journals An Enhanced LEACH in Wireless Sensor Network

2019 ◽  
Vol 8 (9S) ◽  
pp. 703-709
Keyword(s):  
Minimum Energy ◽  
Cluster Head ◽  
Cuckoo Search ◽  
Low Energy ◽  
Wireless Sensor ◽  
Support Vector ◽  
Adaptive Clustering ◽  
Minimum Energy Consumption ◽  
Leach Protocol ◽  
Long Life

Wireless sensor networks (WSNs) consist of self-governing sensors that sense as well as monitor the area in which these nodes are deployed and distribute this information in a distributed manner. Presently, the WSN with long life and minimum energy consumption are in demand. To overcome this problem, Low Energy Adaptive Clustering Hierarchy (LEACH) is presented with the addition of Cuckoo Search (CS) and Support Vector Machine (SVM) concept. The problem of LEACH protocol like which node is considered as Cluster Head (CH) is overcome by CS. On the basis of healthy function, the nodes property such as energy consumed by each node is categorized. Those nodes that have higher energy compared to the defined function are put in one category and remaining in another category. These two categories of nodes are provided as an input to SVM and train the system. Therefore, the best node having the highest energy is considered as CH and hence enhanced the lifetime by saving the energy upto 21.86 %.

A Low Energy Clustering Routing Protocol Based on the Partition

2014 ◽  
Vol 644-650 ◽  
pp. 2707-2710
Author(s):  
Jing Feng Xu ◽  
Feng Xu ◽  
Qi Lu Meng
Keyword(s):  
Life Cycle ◽  
Routing Protocol ◽  
Topology Control ◽  
Cluster Head ◽  
Low Energy ◽  
Wireless Sensor ◽  
Simulation Experiments ◽  
Adaptive Clustering ◽  
Hierarchical Topology ◽  
Leach Protocol

In wireless sensor network (WSN), LEACH protocol is a typical representative of the hierarchical topology control protocol. Compared to plane multiple hops routing protocol, it can significantly prolong the life cycle of the network. But LEACH protocol having the problem of uneven distribution at the cluster head election, this paper proposes a low energy adaptive clustering routing protocol based on the partition. On the basis of the partition, cluster heads are selected by the energy of nodes and their location information. Simulation experiments show that the proposed protocol can be more effective than LEACH to balance the energy and improve the life cycle of the network.

EUCOR: An Efficient Unequal Clustering and Optimal Routing in wireless sensor networks for energy conservation

2021 ◽  
pp. 1-9
Author(s):  
C. Jothikumar ◽  
Revathi Venkataraman ◽  
T. Sai Raj ◽  
J. Selvin Paul Peter ◽  
T.Y.J. Nagamalleswari
Keyword(s):  
Objective Function ◽  
Physical Phenomenon ◽  
Minimum Energy ◽  
Cluster Head ◽  
Industrial Applications ◽  
Base Station ◽  
Wireless Sensor ◽  
Unequal Clustering ◽  
Minimum Energy Consumption ◽  
Variable Cluster

Wireless sensor network is a wide network that works as a cutting edge model in industrial applications. The sensor application is mostly used for high security systems that provide safety support to the environment. The sensor system senses the physical phenomenon, processes the input signal and communicates with the base station through its neighbors. Energy is the most important criterion to support a live network for long hours. In the proposed system, the EUCOR (Efficient Unequal Clustering and Optimized Routing) protocol uses the objective function to identify the efficient cluster head with variable cluster size. The computation of the objective function deals with the ant colony approach for minimum energy consumption and the varying size of the cluster in each cycle is calculated based on the competition radius. The system prolongs the lifespan of the nodes by minimizing the utilization of energy in the transmission of packets in the networks when compared with the existing system.

scholarly journals Consumption of Energy and Routing Protocols in Wireless Sensor Network

2016 ◽  
Vol 8 (3) ◽  
pp. 76 ◽  
Author(s):  
Ridha Azizi
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Protocols ◽  
Cluster Head ◽  
Low Energy ◽  
Wireless Sensor ◽  
Simulation Tool ◽  
New Approach ◽  
Adaptive Clustering

Extend the life of a wireless sensor network (WSN) is a fundamental challenge, as they have a limited supply. Multiple protocols and approaches have been proposed to minimize power consumption. Routing protocols and especially the hierarchical approach is one of the techniques used to minimize energy consumption and to improve the duration of network life. In this paper we propose a new approach to transfer and select the CH (Cluster Head). ART-LEACH (Advanced Routing Transfer- Low-Energy Adaptive Clustering Hierarchy) is a self-organizing protocol based on clustering. Our approach is to use energy more evenly the selected nodes as CH. We evaluated the performance of LEACH (Low-Energy Adaptive Clustering Hierarchy) and IB-LEACH (Improved and Balanced Low Energy Adaptive Clustering Hierarchy) protocol with the proposed new approach using MATLAB as a simulation tool. The simulation results showed that our proposal provides a reduction in energy consumption and increase the duration of network life.

Research on Low Power Routing Protocol for WSNs

2014 ◽  
Vol 610 ◽  
pp. 927-932
Author(s):  
Ahmed Rouaba ◽  
Nouamane Soualmi ◽  
He Zun Wen
Keyword(s):  
Energy Source ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Communication Systems ◽  
Cluster Head ◽  
Life Time ◽  
Low Energy ◽  
Wireless Sensor ◽  
Adaptive Clustering ◽  
Save Energy

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.

scholarly journals Design and Implementation of EOICHD Based Clustered Routing Protocol Variants for Wireless Sensor Networks

2021 ◽  
Vol 4 (2) ◽  
pp. 25
Author(s):  
Anupkumar Bongale ◽  
Arunkumar Bongale ◽  
Satish Kumar ◽  
Rahul Joshi ◽  
Kishore Bhamidipati
Keyword(s):  
Routing Protocol ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Energy Utilization ◽  
Wireless Sensor ◽  
Data Packets ◽  
Adaptive Clustering ◽  
Network Cluster ◽  
Leach Protocol

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.

scholarly journals Performance evaluation of wireless sensor networks using LEACH protocol

2020 ◽  
Vol 19 (1) ◽  
pp. 395
Author(s):  
Anas Ali Hussien ◽  
Shaymaa Waleed Al-Shammari ◽  
Mehdi J. Marie
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Initial Energy ◽  
Low Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Space Technology ◽  
Adaptive Clustering ◽  
Leach Protocol

<span>Recent days witnessed considerable developments in the field of wireless sensor networks (WSNs). The applications of these networks can be seen in the simple consumer electronic devices as well as in the advanced space technology. The communication protocols are of prior importance and interest; the low-energy adaptive clustering hierarchy (LEACH) protocol is used to enhance the performance of power consumption for the WSNs nodes. The efficiency of a wireless network can be affected by different factors, such as the size of the WSN and the initial energy of the sensor node. This can inspire the researchers to develop the optimum structure of the WSNs to get its desired functionality. In this paper, the performance of the low-energy adaptive clustering hierarchy (LEACH) protocol is investigated using MATLAB to study the effect of the initial energy of the sensor node and the WSN size on the number of the running nodes. It is found that increasing the initial energy of a sensor node increases the life time of the node and hence the number of the running nodes. It has been also approved that the WSN size has an inverse proportion with the number of running sensor nodes during the use of LEACH protocol.</span>

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

2021 ◽  
Vol 23 (2) ◽  
pp. 1093
Author(s):  
Sama Hussam Sabah ◽  
Muayad Sadik Croock
Keyword(s):  
Fault Tolerance ◽  
Energy Efficient ◽  
Clustering Algorithms ◽  
Cluster Head ◽  
Life Time ◽  
Research Area ◽  
Wireless Sensor ◽  
Adaptive Clustering ◽  
Available Energy ◽  
Leach Protocol

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.

A Clustering Protocol for Maximum Coverage in Large-Scale Wireless Sensor Networks

2015 ◽  
Vol 11 (2) ◽  
pp. 1-21 ◽  
Author(s):  
Wassim Jerbi ◽  
Abderrahmen Guermazi ◽  
Hafedh Trabelsi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Large Scale ◽  
Cluster Head ◽  
Low Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Basic Algorithm ◽  
Adaptive Clustering

The optimum use of coverage in wireless sensor networks (WSNs) is very important. The hierarchical routing protocol LEACH (Low Energy Adaptive Clustering Hierarchy) is referred to as the basic algorithm of distributed clustering protocols. LEACH allows clusters formation. Each cluster has a leader called Cluster Head (CH). The selection of CHs is made with a probabilistic calculation. It is supposed that each non-CH node join a cluster and becomes a cluster member. Nevertheless, some CHs can be concentrated in a specific part of the network. Thus several sensor nodes cannot reach any CH. As a result, the remaining part of the controlled field will not be covered; some sensor nodes will be outside the network. To solve this problem, the authors propose O-LEACH (Orphan Low Energy Adaptive Clustering Hierarchy), a routing protocol that takes into account the orphan nodes. O-LEACH presents two scenarios, a gateway and sub cluster that allow the joining of orphan nodes.

Sign in / Sign up

Export Citation Format

Share Document