Organized Selection Cluster Head on Fuzzy Low-Energy Adaptive Clustering Hierarchy Protocol in Three-Dimensional Wireless Sensor Networks

2020 ◽  
Vol 10 ◽  
Author(s):  
Abderrahmane El Aalaoui ◽  
Abderrahmane Hajraoui
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Cluster Head ◽  
Three Dimensional ◽  
Low Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Balancing ◽  
Adaptive Clustering ◽  
Development Approach

: In this paper, we propose an enhancement approach to reduce the energy consumption, extend the network lifetime and improve the performance of protocol Fuzzy Low-Energy Adaptive Clustering Hierarchy Algorithm (Fuzzy LEACH). This improvement in order to augment the energy balancing in clusters among all sensor nodes and to minimize the energy dissipation during network communications. The proposed method is based on a cluster head selection method. Moreover, an enhanced organization of this selection has been implemented. Therefore, the development approach indicates a progress in terms of network lifetime, energy consumption and number of packets transferred to BS compared to Low-Energy Adaptive Clustering Hierarchy Algorithm (LEACH) and other related extended spaces protocols. Mathematical analysis and MATLAB 2013a simulation results show the effectiveness of the proposed approach. The new approach reduce the energy consumption of Wireless Sensor Network (WSN) about 0.99% to 5.64%, prolongs the network life cycle by 42% and increases the number of packets sent by 86% to 732%.

scholarly journals Optimal clustering algorithm for wireless sensor networks using combined turbid ant swarm and improved myopic algorithm for maximizing life of sensors

2021 ◽  
Author(s):  
Muthukumar S ◽  
D. Hevin Rajesh
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Control Factor ◽  
Network Simulator ◽  
Adaptive Clustering ◽  
Save Energy

Abstract Wireless sensor network (WSNs) consistsof a variety of sensor nodes to sense the environmentalparameters and communicate to the sink knot. The control factor is that controlling the power of the sensor nodes and charging or replacing the battery is an expensive and complicated process, which affects the sensor node lifetime as well as network lifetime. Clustering is one of the schemes that save energy by reducing the amount of intra-cluster communication cost. In this paper, an optimal clustering (OC) algorithm proposed to maximizes the network lifetime at data transmission without compromising energy expenditure. In OC algorithm, first we propose the turbid ant swarm(TAS) algorithm to form the clusters, which reduces much amount of energy consumption. Then, an improved myopic (IM) algorithm proposed to determines the cluster head (CH) of cluster, which minimizes re-clustering frequency and intra-communication charge. The proposed OC-TAS-IM algorithm is concentrate to get better the energy efficiency and extend the network life span. Moreover, the planned algorithm is practical to the low-energy adaptive clustering hierarchy (LEACH) to perform the entire routing. The completion and imitation experiment with Network Simulator (NS2) are obtainable in order to authenticate our planned OC-TAS-IM algorithm. Imitation outcome illustrate that OC-TAS-IM algorithm is stable in terms of energy consumption and network lifetime because of optimal clustering.

scholarly journals Energy Consumption Based Low Energy Aware Gateway (LEAG) Protocol in Wireless Sensor Networks

2019 ◽  
Vol 8 (5S3) ◽  
pp. 128-132 ◽  
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Cluster Head ◽  
Base Station ◽  
Low Energy ◽  
Secure Routing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Aware

Wireless Sensor Networks (WSN) consists of a large amount of nodes connected in a self-directed manner. The most important problems in WSN are Energy, Routing, Security, etc., price of the sensor nodes and renovation of these networks is reasonable. The sensor node tools included a radio transceiver with an antenna and an energy source, usually a battery. WSN compute the environmental conditions such as temperature, sound, pollution levels, etc., WSN built the network with the help of nodes. A sensor community consists of many detection stations known as sensor nodes, every of which is small, light-weight and portable. Nodes are linked separately. Each node is linked into the sensors. In recent years WSN has grow to be an essential function in real world. The data’s are sent from end to end multiple nodes and gateways, the data’s are connected to other networks such as wireless Ethernet. MGEAR is the existing mechanism. It works with the routing and energy consumption. The principal problem of this work is choosing cluster head, and the selection is based on base station, so the manner is consumes energy. In this paper, develop the novel based hybrid protocol Low Energy Aware Gateway (LEAG). We used Zigbee techniques to reduce energy consumption and routing. Gateway is used to minimize the energy consumption and data is send to the base station. Nodes are used to transmit the data into the cluster head, it transmit the data into gateway and gateway compress and aggregate the data then sent to the base station. Simulation result shows our proposed mechanism consumes less energy, increased throughput, packet delivery ration and secure routing when compared to existing mechanism (MGEAR).

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.

scholarly journals Distributed fuzzy logic based cluster head election scheme (DFLCHES) for prolonging the lifetime of the wireless sensor network

2017 ◽  
Vol 7 (1.5) ◽  
pp. 111
Author(s):  
S. Ramakrishnan ◽  
S. Prayla Shyry
Keyword(s):  
Fuzzy Logic ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Significant Feature ◽  
Cluster Head Election ◽  
Wide Range

Wireless sensor networks (WSNs) is considered as the predominant technology due to their high suitability and adaptability that makes it possible to be deployed in wide range of applications like civil and military domain. But energy-constraint is the significant feature that needs to be addressed for sensor networks since energy drain of sensor nodes affects network lifetime, stability and co-operation of sensor nodes in the event of enforce reliable data dissemination. Cluster head election has to been performed periodically in order to handle energy balance for facilitating reliable packet delivery. Most of the cluster head election schemes of the literature elect a node as cluster head either randomly or by elucidating their stochastic probabilities. Hence a Distributed Fuzzy Logic based Cluster Head Election Scheme (DFLCHES) that discriminates and discards packets from the sensor nodes that has the least probability of being elected as cluster head is proposed. DFLCHES utilizes five significant parameters such as trust, energy, node density, hop count and centrality measure for quantifying the probability of cluster head election. This DFLCHES is run on each neighbor nodes of the cluster members to facilitate the action of discrimination. DFLCHES also balances the energy consumption of the cluster members during transmission as it discards packets from ineligible nodes. Further the action of cluster head election has to be optimized periodically for reducing and balancing energy consumption for prolonging the network lifetime. In DFLCHES, the process of optimizing cluster head depends on the incorporation of the concept of Genetic algorithms for enabling and ensuring reliable routing.

scholarly journals An enhancement of path selection to cluster head based on multi-hop routing in two-tier wireless sensor network

2019 ◽  
Vol 9 (6) ◽  
pp. 5360
Author(s):  
Wan Isni Sofiah Wan Din ◽  
Asyran Zarizi Bin Abdullah ◽  
Razulaimi Razali ◽  
Ahmad Firdaus ◽  
Salwana Mohamad ◽  
...  
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Lifetime ◽  
Data Transmission ◽  
Cluster Head ◽  
Threshold Value ◽  
Path Selection ◽  
Sensor Nodes ◽  
Wireless Sensor

<span lang="EN-US">Wireless Sensor Network (WSN) is a distributed wireless connection that consists many wireless sensor devices. It is used to get information from the surrounding activities or the environment and send the details to the user for future work. Due to its advantages, WSN has been widely used to help people to collect, monitor and analyse data. However, the biggest limitation of WSN is about the network lifetime. Usually WSN has a small energy capacity for operation, and after the energy was used up below the threshold value, it will then be declared as a dead node. When this happens, the sensor node cannot receive and send the data until the energy is renewed. To reduce WSN energy consumption, the process of selecting a path to the destination is very important. Currently, the data transmission from sensor nodes to the cluster head uses a single hop which consumes more energy; thus, in this paper the enhancement of previous algorithm, which is MAP, the data transmission will use several paths to reach the cluster head. The best path uses a small amount of energy and will take a short time for packet delivery. The element of Shortest Path First (SPF) Algorithm that is used in a routing protocol will be implemented. It will determine the path based on a cost, in which the decision will be made depending on the lowest cost between several connected paths. By using the MATLAB simulation tool, the performance of SPF algorithm and conventional method will be evaluated. The expected result of SPF implementation will increase the energy consumption in order to prolong the network lifetime for WSN.</span>

scholarly journals Efficient organization of nodes in wireless sensor networks (clustering location-based LEACH)

2022 ◽  
Vol 12 (1) ◽  
pp. 1011
Author(s):  
Mohammed Réda El Ouadi ◽  
Abderrahim Hasbi
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Rapid Development ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Main Element

The rapid development of connected devices and wireless communication has enabled several researchers to study wireless sensor networks and propose methods and algorithms to improve their performance. Wireless sensor networks (WSN) are composed of several sensor nodes deployed to collect and transfer data to base station (BS). Sensor node is considered as the main element in this field, characterized by minimal capacities of storage, energy, and computing. In consequence of the important impact of the energy on network lifetime, several researches are interested to propose different mechanisms to minimize energy consumption. In this work, we propose a new enhancement of low-energy adaptive clustering hierarchy (LEACH) protocol, named clustering location-based LEACH (CLOC-LEACH), which represents a continuity of our previous published work location-based LEACH (LOC-LEACH). The proposed protocol organizes sensor nodes into four regions, using clustering mechanism. In addition, an efficient concept is adopted to choose cluster head. CLOC-LEACH considers the energy as the principal metric to choose cluster heads and uses a gateway node to ensure the inter-cluster communication. The simulation with MATLAB shows that our contribution offers better performance than LEACH and LOC-LEACH, in terms of stability, energy consumption and network lifetime.

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.

scholarly journals An Energy-Balanced Routing Protocol for a Wireless Sensor Network

2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Lin Li ◽  
Donghui Li
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Protocol ◽  
Cluster Head ◽  
Low Energy ◽  
Fuzzy Rules ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Adaptive Clustering ◽  
Energy Balanced Routing

The wireless sensor network is an intelligent self-organizing network which consists of many sensor nodes deployed in the monitoring area. The greatest challenge of designing a wireless sensor network is to balance the energy consumption and prolong the lifetime of the network, seeing that the nodes can be powered only by batteries in most conditions. An energy-balanced routing protocol (EBRP) for wireless sensor networks is proposed in this paper. In EBRP, we divide the network into several clusters by using K-means++ algorithm and select the cluster head by using the fuzzy logical system (FLS). Since the previous researches did not demonstrate how to get the fuzzy rules for different networks, we propose a genetic algorithm (GA) to obtain the fuzzy rules. We code the rules as a chromosome, and the lifetime of the network is treated as a fit function. Then, through the selection, crossover, and mutation of each generation, the best offspring can be decoded as the best rule for each network model. Through the simulation, comparing with the existing routing protocols such as low-energy adaptive clustering hierarchy (LEACH), low-energy adaptive clustering hierarchy-centralized (LEACH-C), and stable election protocol (SEP), the EBRP prolongs the network lifetime (first node dies) by 57%, 63%, and 63%, respectively.

Improvement of Clustering Algorithm for WSNs

2014 ◽  
Vol 665 ◽  
pp. 745-750
Author(s):  
Qi Gong Chen ◽  
Yong Zhi Wang ◽  
Li Sheng Wei ◽  
Wen Gen Gao
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Optimal Number ◽  
Low Energy ◽  
Experimental Results ◽  
Wireless Sensor ◽  
Adaptive Clustering

Energy consumption is a hot issue in WSNs (Wireless Sensor Networks). In this paper, we present an improved clustering algorithm. By changing the order of traditional WSNs clustering algorithm, this algorithm uses k-means clustering firstly base on optimal number of cluster head is determined; Then selects cluster head by an improved LEACH (Low Energy Adaptive Clustering Hierarchy) algorithm; Finally, Our experimental results demonstrate that this approach can reduces energy consumption and increases the lifetime of the WSNs.

Routing Algorithm based on Clustering for Increasing the Lifetime of Sensor Networks by Using Meta-Heuristic Bee Algorithms

2020 ◽  
Vol 10 (1) ◽  
pp. 25-36
Author(s):  
Mohammad Sedighimanesh ◽  
Hesam Zand Hesami ◽  
Ali Sedighimanesh
Keyword(s):  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Clustering Algorithm ◽  
Heuristic Algorithms ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Cost Effective ◽  
Sensor Nodes ◽  
Wireless Sensor

Background: Nowadays, the use of wireless sensor networks is developing rapidly. these networks are applicable in many fields, including military, medical, and environment. these networks use hundreds or thousands of cheap sensor nodes with low power-low and low energy to perform large tasks. These networks have limitations that can lead to inefficiency or not cost - effective. Among these limitations, consumption of energy and issues related to the lifetime of the network. One of the solutions that can assist the load balancing between sensor nodes, increased scalability, improving energy consumption and consequently, increasing network lifetime, clustering of sensor nodes and placing a suitable cluster head in all clusters. Choosing the right cluster head, significantly reduces energy consumption in the network and increases network lifetime. Objective: The purpose of this paper is to increase network lifetime by using the efficient clustering algorithm, which is used in Meta-heuristic bee colony to select the cluster head. Simulation of this paper is performed by MATLB software and the proposed method is compared with LEACH and GACR approaches. Conclusion: The simulation findings in this study show that the intended study has remarkably increased the length of the network lifetime by LEACH and GACR algorithms. Due to the limitation of energy in the wireless sensor network such solutions and using Meta-heuristic algorithms can give rise a remarkable increasing in network lifetime.

Sign in / Sign up

Export Citation Format

Share Document