Optimized Lifetime of Wireless Sensor Networks Through Metaheuristic Firefly Based Cluster Head Selection Algorithm

2021 ◽  
Author(s):  
Anusha Chintam ◽  
Madhusudhana Rao T.v ◽  
Rajendra Kumar G
Keyword(s):  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Ad Hoc ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Head Selection ◽  
Fitness Value

Abstract A wireless sensor network is a type of wireless ad-hoc networks, which is a collection of individual sensor nodes that are battery-operated devices and connected through ad-hoc and self-configuring connectivity. Therefore, the energy-saving of sensor node is a challenging design issue. Hence, the lifetime of a node is decreased. To enhance the network lifetime and optimal energy consumption, clustering is one of the best methods in WSN. While message transmission there is more distance between the cluster head and base station then more energy drained by the cluster head compare to the remaining sensor nodes in a particular cluster and if the energy consumption is more then automatically the network lifetime decreased. Therefore, this paper proposed an optimal metaheuristic firefly based cluster head selection protocol (FCH) by finding fitness value for selecting the best cluster head. This best-elected cluster head drains less energy as well as increase the network lifetime. In addition to the proposed FCH compared with two basic sensor networks algorithms low energy adaptive clustering hierarchy (LEACH) and Data transmission (DT). The FCH algorithm achieved better results than compared algorithms in terms of dead nodes, remaining energy, and alive nodes of the network.

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.

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 A PSO-Based Uneven Dynamic Clustering Multi-Hop Routing Protocol for Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (8) ◽  
pp. 1835 ◽  
Author(s):  
Ruan ◽  
Huang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Dynamic Clustering ◽  
Energy Efficient Routing

Since wireless sensor networks (WSNs) are powered by energy-constrained batteries, many energy-efficient routing protocols have been proposed to extend the network lifetime. However, most of the protocols do not well balance the energy consumption of the WSNs. The hotspot problem caused by unbalanced energy consumption in the WSNs reduces the network lifetime. To solve the problem, this paper proposes a PSO (Particle Swarm Optimization)-based uneven dynamic clustering multi-hop routing protocol (PUDCRP). In the PUDCRP protocol, the distribution of the clusters will change dynamically when some nodes fail. The PSO algorithm is used to determine the area where the candidate CH (cluster head) nodes are located. The adaptive clustering method based on node distribution makes the cluster distribution more reasonable, which balances the energy consumption of the network more effectively. In order to improve the energy efficiency of multi-hop transmission between the BS (Base Station) and CH nodes, we also propose a connecting line aided route construction method to determine the most appropriate next hop. Compared with UCCGRA, multi-hop EEBCDA, EEMRP, CAMP, PSO-ECHS and PSO-SD, PUDCRP prolongs the network lifetime by between 7.36% and 74.21%. The protocol significantly balances the energy consumption of the network and has better scalability for various sizes of network.

scholarly journals An Energy-Aware Method for Selecting Cluster Heads in Wireless Sensor Networks

2020 ◽  
Vol 10 (21) ◽  
pp. 7886
Author(s):  
Atefeh Rahiminasab ◽  
Peyman Tirandazi ◽  
M. J. Ebadi ◽  
Ali Ahmadian ◽  
Mehdi Salimi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Cluster Head ◽  
Base Station ◽  
Energy Resources ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Dynamic Clustering ◽  
Clustering Protocol

Wireless sensor networks (WSNs) include several sensor nodes that have limited capabilities. The most critical restriction in WSNs is energy resources. Moreover, since each sensor node’s energy resources cannot be recharged or replaced, it is inevitable to propose various methods for managing the energy resources. Furthermore, this procedure increases the network lifetime. In wireless sensor networks, the cluster head has a significant impact on system global scalability, energy efficiency, and lifetime. Furthermore, the cluster head is most important in combining, aggregating, and transferring data that are received from other cluster nodes. One of the substantial challenges in a cluster-based network is to choose a suitable cluster head. In this paper, to select an appropriate cluster head, we first model this problem by using multi-factor decision-making according to the four factors, including energy, mobility, distance to centre, and the length of data queues. Then, we use the Cluster Splitting Process (CSP) algorithm and the Analytical Hierarchy Process (AHP) method in order to provide a new method to solve this problem. These four factors are examined in our proposed approach, and our method is compared with the Base station Controlled Dynamic Clustering Protocol (BCDCP) algorithm. The simulation results show the proposed method in improving the network lifetime has better performance than the base station controlled dynamic clustering protocol algorithm. In our proposed method, the energy reduction is almost 5% more than the BCDCP method, and the packet loss rate in our proposed method is almost 25% lower than in the BCDCP method.

scholarly journals Cluster Head Relocation Based on Selfish Herd Hypothesis for Prolonging the Life Span of Wireless Sensor Networks

Electronics ◽  
2018 ◽  
Vol 7 (12) ◽  
pp. 403 ◽  
Author(s):  
Goran Popovic ◽  
Goran Djukanovic ◽  
Dimitris Kanellopoulos
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Network Performance ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Total Energy Consumption ◽  
Selfish Herd

Clustering achieves energy efficiency and scalable performance in wireless sensor networks (WSNs). A cluster is formed of several sensor nodes, one of them selected as the cluster head (CH). A CH collects information from the cluster members and sends aggregated data to the base station or another CH. In such a hierarchical WSN, some nodes are possibly moveable or nomadic (relocated periodically), while others are static. The mobility of sensor nodes can improve network performance and prolong network lifetime. This paper presents the idea of mobile, solar-powered CHs that relocate themselves inside clusters in such a way that the total energy consumption in the network is reduced and the network lifetime is extended. The positioning of CHs is made in each round based on a selfish herd hypothesis, where the leader retreats to the center of gravity. Based on this idea, the CH-active algorithm is proposed in this study. Simulation results show that this algorithm has benefits in terms of network lifetime and in the prolongation of the duration of network stability period.

Presenting the Hybrid Algorithm of Honeybee - Harmony in Clustering and Routing of Wireless Sensor Networks

2019 ◽  
Vol 9 (3) ◽  
pp. 357-371
Author(s):  
Mohammad Sedighimanesh ◽  
Hesam Zandhesami ◽  
Ali Sedighimanesh
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Network Lifetime ◽  
Cluster Head ◽  
Rechargeable Batteries ◽  
Base Station ◽  
Wireless Sensor

Background: Wireless sensor networks are considered as one of the 21st century's most important technologies. Sensors in wireless sensor networks usually have limited and sometimes non-rechargeable batteries, which they are supposed to be preserved for months or even years. That's why the energy consumption in these networks is of a great importance. Objective: One way to improve energy consumption in a wireless sensor network is to use clustering. In clustered networks, one node is known as the cluster head and other nodes as normal members, which normal nodes send the collected data to the cluster head, and the cluster head sends the information to the base station either by a single step or by multiple steps. Method: Using clustering simplifies resource management and increases scalability, reliability, and the network lifetime. Although the cluster formation involves a time- overhead and how to choose the cluster head is another problem, but its advantages are more than its disadvantages. : The primary aim of this study is to offer a solution to reduce energy consumption in the sensor network. In this study, during the selection of cluster heads, Honeybee Algorithm is used and also for routing, Harmonic Search Algorithm is used. In this paper, the simulation is performed by using MATLAB software and the proposed method is compared with the Low Energy Adaptive Clustering Hierarchy (LEACH) and the multi-objective fuzzy clustering algorithm (MOFCA). Result and Conclusion: By simulations of this study, we conclude that this research has remarkably increased the network lifetime with respect to EECS, LEACH, and MOFCA algorithms. In view of the energy constraints of the wireless sensor network and the non-rechargeable batteries in most cases, providing such solutions and using metaheuristic algorithms can result in a significant reduction in energy consumption and, consequently, increase in the network lifetime.

Enhanced Auxiliary Cluster Head Selection Routing Algorithm in Wireless Sensor Networks

2019 ◽  
Vol 12 ◽  
Author(s):  
Gaurav Kumar Nigam ◽  
Chetna Dabas
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Cluster Head ◽  
Base Station ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Head Selection

Background & Objective: Wireless sensor networks are made up of huge amount of less powered small sensor nodes that can audit the surroundings, collect meaningful data, and send it base station. Various energy management plans that pursue to lengthen the endurance of overall network has been proposed over the years, but energy conservation remains the major challenge as the sensor nodes have finite battery and low computational capabilities. Cluster based routing is the most fitting system to help for burden adjusting, adaptation to internal failure, and solid correspondence to draw out execution parameters of wireless sensor network. Low energy adaptive clustering hierarchy is an efficient clustering based hierarchical protocol that is used to enhance the lifetime of sensor nodes in wireless sensor network. It has some basic flaws that need to be overwhelmed in order to reduce the energy utilization and inflating the nodes lifetime. Methods : In this paper, an effective auxiliary cluster head selection is used to propose a new enhanced GC-LEACH algorithm in order to minimize the energy utilization and prolonged the lifespan of wireless sensor network. Results & Conclusion: Simulation is performed in NS-2 and the outcomes show that the GC-LEACH outperforms conventional LEACH and its existing versions in the context of frequent cluster head rotation in various rounds, number of data packets collected at base station, as well as reduces the energy consumption 14% - 19% and prolongs the system lifetime 8% - 15%.

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.

Distance Based Clustering Algorithm for Energy Efficiency in Wireless Sensor Networks

2014 ◽  
Vol 626 ◽  
pp. 20-25
Author(s):  
K. Kalaiselvi ◽  
G.R. Suresh
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Head Selection ◽  
Energy Efficient Routing

In wireless sensor networks Energy-efficient routing is an important issue due to the limited battery power within the network, Energy consumption is one of the important performance factors. Specifically for the election of cluster head selection and distance between the cluster head node and base station. The main objective of this proposed system is to reduce the energy consumption and prolong the network lifetime. This paper introduces a new clustering algorithm for energy efficient routing based on a cluster head selection

Clustering Algorithm to Reduce Power Consumptions for Wireless Sensor Networks

2012 ◽  
Vol 433-440 ◽  
pp. 5228-5232
Author(s):  
Mohammad Ahmadi ◽  
Hamid Faraji ◽  
Hossien Zohrevand
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Life Time ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Head Selection ◽  
Cluster Heads

A sensor network has many sensor nodes with limited energy. One of the important issues in these networks is the increase of the life time of the network. In this article, a clustering algorithm is introduced for wireless sensor networks that considering the parameters of distance and remaining energy of each node in the process of cluster head selection. The introduced algorithm is able to reduce the amount of consumed energy in the network. In this algorithm, the nodes that have more energy and less distance from the base station more probably will become cluster heads. Also, we use algorithm for finding the shortest path between cluster heads and base station. The results of simulation with the help of Matlab software show that the proposed algorithm increase the life time of the network compared with LEACH algorithm.

Sign in / Sign up

Export Citation Format

Share Document