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.

scholarly journals Energy Balance Routing Algorithm Based on Virtual MIMO Scheme for Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Jianpo Li ◽  
Xue Jiang ◽  
I-Tai Lu
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Balance ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Virtual Mimo ◽  
Head Node

Wireless sensor networks are usually energy limited and therefore an energy-efficient routing algorithm is desired for prolonging the network lifetime. In this paper, we propose a new energy balance routing algorithm which has the following three improvements over the conventional LEACH algorithm. Firstly, we propose a new cluster head selection scheme by taking into consideration the remaining energy and the most recent energy consumption of the nodes and the entire network. In this way, the sensor nodes with smaller remaining energy or larger energy consumption will be much less likely to be chosen as cluster heads. Secondly, according to the ratio of remaining energy to distance, cooperative nodes are selected to form virtual MIMO structures. It mitigates the uneven distribution of clusters and the unbalanced energy consumption of the whole network. Thirdly, we construct a comprehensive energy consumption model, which can reflect more realistically the practical energy consumption. Numerical simulations analyze the influences of cooperative node numbers and cluster head node numbers on the network lifetime. It is shown that the energy consumption of the proposed routing algorithm is lower than the conventional LEACH algorithm and for the simulation example the network lifetime is prolonged about 25%.

A Cluster Algorithm for Wireless Sensor Networks Based on Energy Efficiency

2015 ◽  
Vol 785 ◽  
pp. 744-750
Author(s):  
Lei Gao ◽  
Qun Chen
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Selection Criterion ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Head Node

In order to solve the energy limited problem of sensor nodes in the wireless sensor networks (WSN), a fast clustering algorithm based on energy efficiency for wire1ess sensor networks is presented in this paper. In the system initialization phase, the deployment region is divided into several clusters rapidly. The energy consumption ratio and degree of the node are chosen as the selection criterion for the cluster head. Re-election of the cluster head node at this time became a local trigger behavior. Because of the range of the re-election is within the cluster, which greatly reduces the complexity and computational load to re-elect the cluster head node. Theoretical analysis indicates that the timing complexity of the clustering algorithm is O(1), which shows that the algorithm overhead is small and has nothing to do with the network size n. Simulation results show that clustering algorithm based on energy efficiency can provide better load balancing of cluster heads and less protocol overhead. Clustering algorithm based on energy efficiency can reduce energy consumption and prolong the network lifetime compared with LEACH protocol.

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.

A New Clustering Routing Algorithm for WSN Based on PSO

2013 ◽  
Vol 850-851 ◽  
pp. 689-692
Author(s):  
Li Fu Wang ◽  
Jian Ding ◽  
Zhi Kong
Keyword(s):  
Energy Consumption ◽  
Clustering Algorithm ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Pso Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Long Distance ◽  
Wireless Sensor Nodes ◽  
Spatially Distributed

A wireless sensor network (WSN) consists of spatially distributed wireless sensor nodes. The node power constrains the development of WSN. Employing techniques of clustering can reduce energy consumption of wireless sensor nodes and prolong the network lifetime. Therefore, in the study a new clustering routing algorithm is presented. The clustering algorithm uses the double-layer sensor nodes to communicate. And in order to optimize power energy consumption for WSN node energy, PSO algorithm is employed to find cluster head in each layer. Simulation results show that the algorithm not only can equal power energy of node, but also can reduce consumption in the long distance data transmission.

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 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.

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 CAF: Cluster Algorithm and A-Star with Fuzzy Approach for Lifetime Enhancement in Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-17 ◽  
Author(s):  
Yali Yuan ◽  
Caihong Li ◽  
Yi Yang ◽  
Xiangliang Zhang ◽  
Lian Li
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Clustering Algorithm ◽  
Fuzzy Inference ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Fuzzy Approach

Energy is a major factor in designing wireless sensor networks (WSNs). In particular, in the real world, battery energy is limited; thus the effective improvement of the energy becomes the key of the routing protocols. Besides, the sensor nodes are always deployed far away from the base station and the transmission energy consumption is index times increasing with the increase of distance as well. This paper proposes a new routing method for WSNs to extend the network lifetime using a combination of a clustering algorithm, a fuzzy approach, and an A-star method. The proposal is divided into two steps. Firstly, WSNs are separated into clusters using the Stable Election Protocol (SEP) method. Secondly, the combined methods of fuzzy inference and A-star algorithm are adopted, taking into account the factors such as the remaining power, the minimum hops, and the traffic numbers of nodes. Simulation results demonstrate that the proposed method has significant effectiveness in terms of balancing energy consumption as well as maximizing the network lifetime by comparing the performance of the A-star and fuzzy (AF) approach, cluster and fuzzy (CF)method, cluster and A-star (CA)method, A-star method, and SEP algorithm under the same routing criteria.

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.

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).

Sign in / Sign up

Export Citation Format

Share Document