Quasi Oppositional Glowworm Swarm Optimization Algorithm for Energy Efficient Clustering in Wireless Sensor Networks

2020 ◽  
Vol 17 (12) ◽  
pp. 5447-5456
Author(s):  
R. M. Alamelu ◽  
K. Prabu
Keyword(s):  
Energy Efficient ◽  
Cluster Head ◽  
Residual Energy ◽  
Link Quality ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Node Degree ◽  
Swarm Optimization ◽  
Glowworm Swarm Optimization ◽  
Energy Efficient Clustering

Wireless sensor network (WSN) becomes popular due to its applicability in distinct application areas like healthcare, military, search and rescue operations, etc. In WSN, the sensor nodes undergo deployment in massive number which operates autonomously in harsh environment. Because of limited resources and battery operated sensor nodes, energy efficiency is considered as a main design issue. To achieve, clustering is one of the effective technique which organizes the set of nodes into clusters and cluster head (CH) selection takes place. This paper presents a new Quasi Oppositional Glowworm Swarm Optimization (QOGSO) algorithm for energy efficient clustering in WSN. The proposed QOGSO algorithm is intended to elect the CHs among the sensor nodes using a set of parameters namely residual energy, communication cost, link quality, node degree and node marginality. The QOGSO algorithm incorporates quasi oppositional based learning (QOBL) concept to improvise the convergence rate of GSO technique. The QOGSO algorithm effectively selects the CHs and organizes clusters for minimized energy dissipation and maximum network lifetime. The performance of the QOGSO algorithm has been evaluated and the results are assessed interms of distinct evaluation parameters.

scholarly journals A Modified Energy-Efficient Clustering with Splitting and Merging for Wireless Sensor Networks using Cluster-Head Handover Mechanism

2019 ◽  
Vol 4 (1) ◽  
Author(s):  
Abdoulie M.S. Tekanyi ◽  
Jinadu A Braimoh ◽  
Buba G Bajoga
Keyword(s):  
Energy Efficiency ◽  
Energy Consumption ◽  
Energy Efficient ◽  
Cluster Head ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Modified Model ◽  
Handover Mechanism ◽  
Energy Efficient Clustering

Energy efficiency is one of the most important challenges for Wireless Sensor Networks (WSNs). This is due to the fact that sensor nodes have limited energy capacity. Therefore, the energy of sensor nodes has to be efficiently managed to provide longer lifetime for the network. To reduce energy consumption in WSNs, a modified Energy Efficient Clustering with Splitting and Merging (EECSM) for WSNs using Cluster-Head Handover Mechanism was implemented in this research. The modified model used information of the residual energy of sensor nodes to select backup Cluster Heads (CHs) while maintaining a suitable CH handover threshold to minimize energy consumption in the network. The backup CHs take over the responsibilities of the CHs once the handover threshold is reached. The modified model was validated in terms of network lifetime and residual energy ratio with EECSM using MATLAB R2013a. Average improvements of 7.5% and 50.7% were achieved for the network lifetime and residual energy ratio respectively which indicates a significant reduction in energy consumption of the network nodes. Keywords— Clustering, Energy-Efficiency, Handover, Lifetime, Wireless Sensor Network

Distributed Entropy Energy-Efficient Clustering algorithm for cluster head selection (DEEEC)

2020 ◽  
Vol 39 (6) ◽  
pp. 8139-8147
Author(s):  
Ranganathan Arun ◽  
Rangaswamy Balamurugan
Keyword(s):  
Energy Efficient ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Second Stage ◽  
Energy Efficient Clustering ◽  
Two Stages ◽  
Ch Selection

In Wireless Sensor Networks (WSN) the energy of Sensor nodes is not certainly sufficient. In order to optimize the endurance of WSN, it is essential to minimize the utilization of energy. Head of group or Cluster Head (CH) is an eminent method to develop the endurance of WSN that aggregates the WSN with higher energy. CH for intra-cluster and inter-cluster communication becomes dependent. For complete, in WSN, the Energy level of CH extends its life of cluster. While evolving cluster algorithms, the complicated job is to identify the energy utilization amount of heterogeneous WSNs. Based on Chaotic Firefly Algorithm CH (CFACH) selection, the formulated work is named “Novel Distributed Entropy Energy-Efficient Clustering Algorithm”, in short, DEEEC for HWSNs. The formulated DEEEC Algorithm, which is a CH, has two main stages. In the first stage, the identification of temporary CHs along with its entropy value is found using the correlative measure of residual and original energy. Along with this, in the clustering algorithm, the rotating epoch and its entropy value must be predicted automatically by its sensor nodes. In the second stage, if any member in the cluster having larger residual energy, shall modify the temporary CHs in the direction of the deciding set. The target of the nodes with large energy has the probability to be CHs which is determined by the above two stages meant for CH selection. The MATLAB is required to simulate the DEEEC Algorithm. The simulated results of the formulated DEEEC Algorithm produce good results with respect to the energy and increased lifetime when it is correlated with the current traditional clustering protocols being used in the Heterogeneous WSNs.

Hybrid artificial bee colony and glow worm algorithm for energy efficient cluster head selection in wireless sensor networks

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Jasleen Kaur ◽  
Punam Rani ◽  
Brahm Prakash Dahiya
Keyword(s):  
Artificial Bee Colony ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Head Selection ◽  
Swarm Optimization ◽  
Content Type ◽  
Bee Colony ◽  
Glowworm Swarm Optimization ◽  
Optimal Cluster

Purpose This paper aim to find optimal cluster head and minimize energy wastage in WSNs. Wireless sensor networks (WSNs) have low power sensor nodes that quickly lose energy. Energy efficiency is most important factor in WSNs, as they incorporate limited sized batteries that would not be recharged or replaced. The energy possessed by the sensor nodes must be optimally used so as to increase the lifespan. The research is proposing hybrid artificial bee colony and glowworm swarm optimization [Hybrid artificial bee colony and glowworm swarm optimization (HABC-GSO)] algorithm to select the cluster heads. Previous research has considered fitness-based glowworm swarm with Fruitfly (FGF) algorithm, but existing research was limited to maximizing network lifetime and energy efficiency. Design/methodology/approach The proposed HABC-GSO algorithm selects global optima and improves convergence ratio. It also performs optimal cluster head selection by balancing between exploitation and exploration phases. The simulation is performed in MATLAB. Findings The HABC-GSO performance is evaluated with existing algorithms such as particle swarm optimization, GSO, Cuckoo Search, Group Search Ant Lion with Levy Flight, Fruitfly Optimization algorithm and grasshopper optimization algorithm, a new FGF in the terms of alive nodes, normalized energy, cluster head distance and delay. Originality/value This research work is original.

Using Multi-Objective Particle Swarm Optimization for Energy-Efficient Clustering in Wireless Sensor Networks

2012 ◽  
pp. 291-304
Author(s):  
Hamid Ali ◽  
Waseem Shahzad ◽  
Farrukh Aslam Khan
Keyword(s):  
Particle Swarm Optimization ◽  
Energy Efficient ◽  
Efficient Solution ◽  
Particle Swarm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Swarm Optimization ◽  
Multi Objective ◽  
Battery Power ◽  
Energy Efficient Clustering

In this chapter, the authors propose a multi-objective solution to the problem by using multi-objective particle swarm optimization (MOPSO) algorithm to optimize the number of clusters in a sensor network in order to provide an energy-efficient solution. The proposed algorithm considers the ideal degree of nodes and battery power consumption of the sensor nodes. The main advantage of the proposed method is that it provides a set of solutions at a time. The results of the proposed approach were compared with two other well-known clustering techniques: WCA and CLPSO-based clustering. Extensive simulations were performed to show that the proposed approach is an effective approach for clustering in WSN environments and performs better than the other two approaches.

scholarly journals A New Energy Efficient Multitier Deterministic Energy-Efficient Clustering Routing Protocol for Wireless Sensor Networks

Symmetry ◽  
2020 ◽  
Vol 12 (5) ◽  
pp. 837 ◽  
Author(s):  
Hakan Koyuncu ◽  
Geetam S. Tomar ◽  
Dinesh Sharma
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Life Span ◽  
Energy Efficient ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Primary Concern ◽  
Energy Efficient Clustering

Wireless Sensor Networks (WSNs) may be incorporated with thousands of small nodes. This gives them the capability to effectively sense, communicate, and compute parameters. However, the security and life span of a WSN node is a primary concern. This paper is focused on introducing a mathematical model of a modified Multitier Deterministic Energy-Efficient Clustering (DEC) based on novel election multi-tier random probability protocol for agricultural WSNs to enhance the life span of a WSN node along with a comparison of it with existing DEC protocol. In the proposed model, the selection of cluster heads, (CH), is done based on the energy drain pattern and location of the sensor nodes, which increased the lifespan of sensor nodes. In addition, several WSN probabilistic routing protocols to save energy throughout data transmissions like Low Energy Adaptive Clustering Hierarchy (LEACH), Power-Efficient Gathering in Sensor Information Systems (PEGASIS), DEC, and Stable Election Protocol (SEP) are explained. Moreover, it has been found that, after some mathematical modification in existing DEC routing, it will be capable to give a more positive result and reduce the energy drain in WSN nodes using a selective cluster head technique based on residual energy of sensor nodes. The DEC protocol is also compared with our proposed modified protocol for showing the energy-efficiency. The energy efficiency of clustering is associated with the field of energy sustainability of wireless sensor networks which is in the scope of Symmetry journal.

scholarly journals Energy-Efficient Clustering Multi-Hop Routing Protocol in a UWSN

Sensors ◽  
2021 ◽  
Vol 21 (2) ◽  
pp. 627
Author(s):  
Nhat-Tien Nguyen ◽  
Thien T. T. Le ◽  
Huy-Hung Nguyen ◽  
Miroslav Voznak
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Cluster Head ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Depth Level ◽  
Large Numbers ◽  
Energy Efficient Clustering

Underwater wireless sensor networks are currently seeing broad research in various applications for human benefits. Large numbers of sensor nodes are being deployed in rivers and oceans to monitor the underwater environment. In the paper, we propose an energy-efficient clustering multi-hop routing protocol (EECMR) which can balance the energy consumption of these nodes and increase their network lifetime. The network area is divided into layers with regard to the depth level. The data sensed by the nodes are transmitted to a sink via a multi-hop routing path. The cluster head is selected according to the depth of the node and its residual energy. To transmit data from the node to the sink, the cluster head aggregates the data packet of all cluster members and then forwards them to the upper layer of the sink node. The simulation results show that EECMR is effective in terms of network lifetime and the nodes’ energy consumption.

scholarly journals Clustering Algorithm for Energy- Efficient Wireless Sensor Network

2021 ◽  
Vol 12 (5) ◽  
pp. 877-884
Author(s):  
Asha Rawat, Dr. Mukesh Kalla
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Energy Efficient ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Packet Transmission ◽  
Wireless Sensor ◽  
Energy Efficient Clustering

Wireless networks data aggregation allows in-network processing, reduces packet transmission and data redundancy, and thus helps extend wireless sensor systems to the full duration of their lives. There have been many ways of dividing the network into clusters, collecting information from nodes and adding it to the base station, to extend wireless sensor network life. Certain cluster algorithms consider the residual energy of the nodes when selecting clusterheads and others regularly rotate the selection head of the cluster. However, we seldom investigate the network density or local distance. In this report we present an energy-efficient clustering algorithm that selects the best cluster heads of the system after dividing the network into clusters. The cluster head selection depends on the distance between the base station nodes and the remaining power of this approach.Each node's residual energy is compared to the node count. Our results show that the solution proposed more efficiently extends the life of the wireless sensor network. The algorithm prolongs the life and effectiveness of the Wireless Sensor Network.

Enhanced Adaptive Distributed Energy-Efficient Clustering (EADEEC) for Wireless Sensor Networks

2020 ◽  
Vol 13 (2) ◽  
pp. 168-172
Author(s):  
Ravi Kumar Poluru ◽  
M. Praveen Kumar Reddy ◽  
Syed Muzamil Basha ◽  
Rizwan Patan ◽  
Suresh Kallam
Keyword(s):  
Network Lifetime ◽  
Routing Protocols ◽  
Energy Efficient ◽  
High Energy ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Distributed Energy ◽  
Stability Period ◽  
Energy Efficient Clustering

Background:Recently Wireless Sensor Network (WSN) is a composed of a full number of arbitrarily dispensed energy-constrained sensor nodes. The sensor nodes help in sensing the data and then it will transmit it to sink. The Base station will produce a significant amount of energy while accessing the sensing data and transmitting data. High energy is required to move towards base station when sensing and transmitting data. WSN possesses significant challenges like saving energy and extending network lifetime. In WSN the most research goals in routing protocols such as robustness, energy efficiency, high reliability, network lifetime, fault tolerance, deployment of nodes and latency. Most of the routing protocols are based upon clustering has been proposed using heterogeneity. For optimizing energy consumption in WSN, a vital technique referred to as clustering.Methods:To improve the lifetime of network and stability we have proposed an Enhanced Adaptive Distributed Energy-Efficient Clustering (EADEEC).Results:In simulation results describes the protocol performs better regarding network lifetime and packet delivery capacity compared to EEDEC and DEEC algorithm. Stability period and network lifetime are improved in EADEEC compare to DEEC and EDEEC.Conclusion:The EADEEC is overall Lifetime of a cluster is improved to perform the network operation: Data transfer, Node Lifetime and stability period of the cluster. EADEEC protocol evidently tells that it improved the throughput, extended the lifetime of network, longevity, and stability compared with DEEC and EDEEC.

Energy Efficient Clustering and Routing Algorithm for WSN

2019 ◽  
Vol 12 ◽  
Author(s):  
Mohit Kumar ◽  
Sonu Mittal ◽  
Md. Amir Khusru Akhtar
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Hot Spot ◽  
Routing Algorithm ◽  
Relay Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Clustering ◽  
Hot Spot Problem

Background: This paper presents a novel Energy Efficient Clustering and Routing Algorithm (EECRA) for WSN. It is a clustering-based algorithm that minimizes energy dissipation in wireless sensor networks. The proposed algorithm takes into consideration energy conservation of the nodes through its inherent architecture and load balancing technique. In the proposed algorithm the role of inter-cluster transmission is not performed by gateways instead a chosen member node of respective cluster is responsible for data forwarding to another cluster or directly to the sink. Our algorithm eases out the load of the gateways by distributing the transmission load among chosen sensor node which acts as a relay node for inter-cluster communication for that round. Grievous simulations show that EECRA is better than PBCA and other algorithms in terms of energy consumption per round and network lifetime. Objective: The objective of this research lies in its inherent architecture and load balancing technique. The sole purpose of this clustering-based algorithm is that it minimizes energy dissipation in wireless sensor networks. Method: This algorithm is tested with 100 sensor nodes and 10 gateways deployed in the target area of 300m × 300m. The round assumed in this simulation is same as in LEACH. The performance metrics used for comparisons are (a) network lifetime of gateways and (b) energy consumption per round by gateways. Our algorithm gives superior result compared to LBC, EELBCA and PBCA. Fig 6 and Fig 7 shows the comparison between the algorithms. Results: The simulation was performed on MATLAB version R2012b. The performance of EECRA is compared with some existing algorithms like PBCA, EELBCA and LBCA. The comparative analysis shows that the proposed algorithm outperforms the other existing algorithms in terms of network lifetime and energy consumption. Conclusion: The novelty of this algorithm lies in the fact that the gateways are not responsible for inter-cluster forwarding, instead some sensor nodes are chosen in every cluster based on some cost function and they act as a relay node for data forwarding. Note the algorithm does not address the hot-spot problem. Our next endeavor will be to design an algorithm with consideration of hot-spot problem.

Sign in / Sign up

Export Citation Format

Share Document