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

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.

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 Implementation of Enhanced AODV based Self-Organized Tree for Energy Balanced Routing in Wireless Sensor Networks

2020 ◽  
Vol 9 (3) ◽  
pp. 1926-1933
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Data Transmission ◽  
Cluster Head ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Self Organized ◽  
Energy Balanced Routing

Wireless sensor networks (WSN) are gaining attention in numerous fields with the advent of embedded systems and IoT. Wireless sensors are deployed in environmental conditions where human intervention is less or eliminated. Since these are not human monitored, powering and maintaining the energy of the node is a challenging issue. The main research hotspot in WSN is energy consumption. As energy drains faster, the network lifetime also decreases. Self-Organizing Networks (SON) are just the solution for the above-discussed problem. Self-organizing networks can automatically configure themselves, find an optimalsolution, diagnose and self-heal to some extent. In this work, “Implementation of Enhanced AODV based Self-Organized Tree for Energy Balanced Routing in Wireless Sensor Networks” is introduced which uses self-organization to balance energy and thus reduce energy consumption. This protocol uses combination of number of neighboring nodes and residual energy as the criteria for efficient cluster head election to form a tree-based cluster structure. Threshold for residual energy and distance are defined to decide the path of the data transmission which is energy efficient. The improvement made in choosing robust parameters for cluster head election and efficient data transmission results in lesser energy consumption. The implementation of the proposed protocol is carried out in NS2 environment. The experiment is conducted by varying the node density as 20, 40 and 60 nodes and with two pause times 5ms, 10ms. The analysis of the result indicates that the new system consumes 17.6% less energy than the existing system. The routing load, network lifetime metrics show better values than the existing system.

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.

Minimizing Energy Consumption Based on Neural Network in Clustered Wireless Sensor Networks

2019 ◽  
Vol 16 (2) ◽  
pp. 496-502
Author(s):  
N. Vadivelan ◽  
A. Ramamurthy ◽  
P. Padmaja
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Physical Phenomenon ◽  
Geographical Area ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Head Node ◽  
Large Geographical Area

Wireless sensor networks were organized with the collections of sensor nodes for the purpose of monitoring physical phenomenon such as temperature, humidity and seismic events, etc., in the real world environments where the manual human access is not possible. The major tasks of this type of networks are to route the information to sink systems in the sensor network from sensor nodes. Sensors are deployed in a large geographical area where human cannot enter such as volcanic eruption or under the deep sea. Hence sensors are not rechargeable and limited with battery backup; it is very complicated to provide the continuous service of sending information to sink systems from sensor nodes. To overcome the drawback of limited battery power, this paper proposes the concept of minimizing energy consumption with the help of neural networks. The modified form of HRP protocol called energy efficient HRP protocol has been implemented in this paper. Based on this concept, the workload of cluster head is shared by the cluster isolation node in order to increase the lifetime of the cluster head node. Also cluster monitoring node is introduced to reduce the re-clustering process. The implementation procedure, algorithm, results and conclusions were proved that the proposed concept is better than the existing protocols.

scholarly journals PCA-Guided Routing Algorithm for Wireless Sensor Networks

2012 ◽  
Vol 2012 ◽  
pp. 1-10 ◽  
Author(s):  
Gong Chen ◽  
Liansheng Tan ◽  
Yanlin Gong ◽  
Wei Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Principal Component ◽  
Wireless Sensor ◽  
Energy Dissipated ◽  
Sum Of Distances ◽  
Theoretical Analyses

An important performance concern for wireless sensor networks (WSNs) is the total energy dissipated by all the nodes in the network over the course of network lifetime. In this paper, we propose a routing algorithm termed as PCA-guided routing algorithm (PCA-RA) by exploring the principal component analysis (PCA) approach. Our algorithm remarkably reduces energy consumption and prolongs network lifetime by realizing the objective of minimizing the sum of distances between the nodes and the cluster centers in a WSN network. It is demonstrated that the PCA-RA can be efficiently implemented in WSNs by forming a nearly optimalK-means-like clustering structure. In addition, it can decrease the network load while maintaining the accuracy of the sensor measurements during data aggregating process. We validate the efficacy and efficiency of the proposed algorithm by simulations. Both theoretical analyses and simulation results demonstrate that this algorithm can perform significantly with less energy consumption and thus prolong the system lifetime for the networks.

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 proposing a new clustering algorithm to Reduction of Energy Consumption using Fuzzy Logic and Genetic Algorithm for Wireless Sensor Networks.

2016 ◽  
Vol 11 (2) ◽  
pp. 2702-2719
Author(s):  
Sayyed Hedayat Tarighi Nejad ◽  
Reza Alinaghian ◽  
Mehdi Sadeghzadeh
Keyword(s):  
Genetic Algorithm ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Sensor Network ◽  
Network Lifetime ◽  
Fuzzy System ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Reduction Of Energy Consumption

The large-scale deployment of wireless sensor networks  and the need for data aggregation necessitate efficient organization of the network topology for the purpose of balancing the load and prolonging the network lifetime. Clustering is one of the important methods for prolonging the network lifetime in wireless sensor networks. It involves grouping of sensor nodes into clusters and electing cluster heads for all the clusters. Clustering has proven to be an effective approach for organizing the network into a connected hierarchy.In this paper, using fuzzy system design and system optimization by genetic algorithm and colony of ants is presented approach to select the best cluster head in sensor networks. Using design and simulation a sensor network has been addressed to evaluation the presented fuzzy system in this paper, and finally the amount of energy consumption using proposed fuzzy system in comparison with LEACH method is calculated in select the cluster head. The result of evaluations is representative of a reduction of energy consumption in the proposed method in comparison with LEATCH method for select the cluster head. The reduction of energy consumption directly is effective on lifetime of wireless sensor network and can cause increase the lifetime these networks.

scholarly journals A Clustering Routing Algorithm Based on Improved Ant Colony Optimization Algorithms for Underwater Wireless Sensor Networks

Algorithms ◽  
2020 ◽  
Vol 13 (10) ◽  
pp. 250
Author(s):  
Xingxing Xiao ◽  
Haining Huang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Ant Colony Optimization ◽  
Routing Algorithm ◽  
Ant Colony ◽  
Wireless Sensor ◽  
Sink Node ◽  
Underwater Wireless Sensor Networks ◽  
Head Node

Because of the complicated underwater environment, the efficiency of data transmission from underwater sensor nodes to a sink node (SN) is faced with great challenges. Aiming at the problem of energy consumption in underwater wireless sensor networks (UWSNs), this paper proposes an energy-efficient clustering routing algorithm based on an improved ant colony optimization (ACO) algorithm. In clustering routing algorithms, the network is divided into many clusters, and each cluster consists of one cluster head node (CHN) and several cluster member nodes (CMNs). This paper optimizes the CHN selection based on the residual energy of nodes and the distance factor. The selected CHN gathers data sent by the CMNs and transmits them to the sink node by multiple hops. Optimal multi-hop paths from the CHNs to the SN are found by an improved ACO algorithm. This paper presents the ACO algorithm through the improvement of the heuristic information, the evaporation parameter for the pheromone update mechanism, and the ant searching scope. Simulation results indicate the high effectiveness and efficiency of the proposed algorithm in reducing the energy consumption, prolonging the network lifetime, and decreasing the packet loss ratio.

scholarly journals Load Balanced Energy Efficient Cluster-chain Based Hybrid Protocol for Wireless Sensor Networks

2019 ◽  
Vol 8 (3) ◽  
pp. 3561-3570
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Load Balancing ◽  
Network Lifetime ◽  
Outer Layer ◽  
Energy Efficient ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Load Balanced

In this paper a novel geographical multilayer protocol named Cluster-chain Based Hybrid (CCBH) Protocol is proposed for proper load balancing across the network that enhance the network lifespan and eliminate the energy holes problem. The CCBH protocol divides the network into the multilayer square structure around the sink. Each layer is divided into to the zones in such a way that the zones near to the sink are smaller in size and size of zones increases as the separation from the sink increases. In inner two layers, each zone has a cluster head (CH) and to reduce the load of CH a leader node (LN) is assigned in every zone. LN collects and aggregates the data received from neighboring nodes and sends it to the associated CH. Outer layer zones are larger in size. To reduce the clustering overhead chain strategy is introduced in outer layer zones that ensure lesser energy consumption as compared to clustering. Multi hop communiqué is used, where data is transferred from upper zone’s CH to immediate lower zone’s CH until it reaches to the sink. Simulated tests demonstrate that proposed CCBH protocol shows evident improvement in terms of the network lifetime as compare to LBCN, LEACH, TCAC, and DSBCA protocols

Sign in / Sign up

Export Citation Format

Share Document