scholarly journals An Energy-Efficient Clustering Routing Protocol for Wireless Sensor Networks Based on AGNES with Balanced Energy Consumption Optimization

Sensors ◽  
2018 ◽  
Vol 18 (11) ◽  
pp. 3938 ◽  
Author(s):  
Zhidong Zhao ◽  
Kaida Xu ◽  
Guohua Hui ◽  
Liqin Hu
Keyword(s):  
Energy Consumption ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Initial Energy ◽  
Optimal Number ◽  
Wireless Sensor ◽  
Total Energy Consumption ◽  
Energy Consumption Optimization ◽  
Balanced Energy Consumption ◽  
Energy Efficient Clustering

To further prolong the lifetime of wireless sensor network (WSN), researchers from various countries have proposed many clustering routing protocols. However, the total network energy consumption of most protocols is not well minimized and balanced. To alleviate this problem, this paper proposes an energy-efficient clustering routing protocol in WSNs. To begin with, this paper introduces a new network structure model and combines the original energy consumption model to construct a new method to determine the optimal number of clusters for the total energy consumption minimization. Based on the balanced energy consumption, then we optimize the AGglomerative NESting (AGNES) algorithm, including: (1) introduction of distance variance, (2) the dual-cluster heads (D-CHs) division of the energy balance strategy, and (3) the node dormancy mechanism. In addition, the CHs priority function is constructed based on the residual energy and position of the node. Finally, we simulated this protocol in homogeneous networks (the initial energy = 0.4 J, 0.6 J and 0.8 J) and heterogeneous networks (the initial energy = 0.4–0.8 J). Simulation results show that our proposed protocol can reduce the network energy consumption decay rate, prolong the network lifetime, and improve the network throughput in the above two networks.

scholarly journals Energy-Efficient Clustering Routing Protocol for Wireless Sensor Networks Based on Yellow Saddle Goatfish Algorithm

Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1515 ◽  
Author(s):  
Alma Rodríguez ◽  
Carolina Del-Valle-Soto ◽  
Ramiro Velázquez
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Cluster Structure ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Energy Efficient Clustering

The usage of wireless sensor devices in many applications, such as in the Internet of Things and monitoring in dangerous geographical spaces, has increased in recent years. However, sensor nodes have limited power, and battery replacement is not viable in most cases. Thus, energy savings in Wireless Sensor Networks (WSNs) is the primary concern in the design of efficient communication protocols. Therefore, a novel energy-efficient clustering routing protocol for WSNs based on Yellow Saddle Goatfish Algorithm (YSGA) is proposed. The protocol is intended to intensify the network lifetime by reducing energy consumption. The network considers a base station and a set of cluster heads in its cluster structure. The number of cluster heads and the selection of optimal cluster heads is determined by the YSGA algorithm, while sensor nodes are assigned to its nearest cluster head. The cluster structure of the network is reconfigured by YSGA to ensure an optimal distribution of cluster heads and reduce the transmission distance. Experiments show competitive results and demonstrate that the proposed routing protocol minimizes the energy consumption, improves the lifetime, and prolongs the stability period of the network in comparison with the stated of the art clustering routing protocols.

scholarly journals Underwater Wireless Sensor Networks: An Energy-Efficient Clustering Routing Protocol Based on Data Fusion and Genetic Algorithms

2020 ◽  
Vol 11 (1) ◽  
pp. 312
Author(s):  
Xingxing Xiao ◽  
Haining Huang ◽  
Wei Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Genetic Algorithms ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Fusion ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Energy Efficient Clustering

Due to the limited battery energy of underwater wireless sensor nodes and the difficulty in replacing or recharging the battery underwater, it is of great significance to improve the energy efficiency of underwater wireless sensor networks (UWSNs). We propose a novel energy-efficient clustering routing protocol based on data fusion and genetic algorithms (GAs) for UWSNs. In the clustering routing protocol, the cluster head node (CHN) gathers the data from cluster member nodes (CMNs), aggregates the data through an improved back propagation neural network (BPNN), and transmits the aggregated data to a sink node (SN) through a multi-hop scheme. The effective multi-hop transmission path between the CHN and the SN is determined through the enhanced GA, thereby improving transmission efficiency and reducing energy consumption. This paper presents the GA based on a specific encoding scheme, a particular crossover operation, and an enhanced mutation operation. Additionally, the BPNN employed for data fusion is improved by adopting an optimized momentum method, which can reduce energy consumption through the elimination of data redundancy and the decrease of the amount of transferred data. Moreover, we introduce an optimized CHN selecting scheme considering residual energy and positions of nodes. The experiments demonstrate that our proposed protocol outperforms its competitors in terms of the energy expenditure, the network lifespan, and the packet loss rate.

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-efficient hierarchical routing in wireless sensor networks based on Fog Computing

2020 ◽  
Author(s):  
Ademola Abidoye ◽  
Boniface Kabaso
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transmission ◽  
Energy Efficient ◽  
Fog Computing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Hierarchical Routing

Abstract Wireless sensor networks (WSNs) have been recognized as one of the most essential technologies of the 21st century. The applications of WSNs are rapidly increasing in almost every sector because they can be deployed in areas where cable and power supply are difficult to use. In the literature, different methods have been proposed to minimize energy consumption of sensor nodes so as to prolong WSNs utilization. In this article, we propose an efficient routing protocol for data transmission in WSNs; it is called Energy-Efficient Hierarchical routing protocol for wireless sensor networks based on Fog Computing (EEHFC). Fog computing is integrated into the proposed scheme due to its capability to optimize the limited power source of WSNs and its ability to scale up to the requirements of the Internet of Things applications. In addition, we propose an improved ant colony optimization (ACO) algorithm that can be used to construct optimal path for efficient data transmission for sensor nodes. The performance of the proposed scheme is evaluated in comparison with P-SEP, EDCF, and RABACO schemes. The results of the simulations show that the proposed approach can minimize sensor nodes’ energy consumption, data packet losses and extends the network lifetime

ECRPW: Energy-Efficient Clustering Routing Protocol Based on Weight for WSNs

2012 ◽  
Vol 182-183 ◽  
pp. 823-828
Author(s):  
Xiang Ping Gu ◽  
Rong Lin Hu
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Distance Threshold ◽  
Cluster Heads ◽  
Cluster Scheme ◽  
Energy Efficient Clustering ◽  
Routing Tree ◽  
Better Than

ECRPW (energy-efficient clustering routing protocol based on weight) routing protocol is presented to avoid the characteristic of limited energy for wireless sensor networks. It takes nodes’ residual energy into consideration during the process of cluster heads being elected. The constraint of distance threshold is used to optimize cluster scheme. Furthermore, it also sets up the routing tree based on cluster heads’ weight. We simulate and analyze LEACH and ECRPW in NS2. The results show that the performance of ECRPW is better than LEACH.

An Energy-Efficient Clustering Algorithm Using Fuzzy C-Means and Genetic Fuzzy System for Wireless Sensor Network

2016 ◽  
Vol 26 (01) ◽  
pp. 1750004 ◽  
Author(s):  
Ayub Shokrollahi ◽  
Babak Mazloom-Nezhad Maybodi
Keyword(s):  
Energy Consumption ◽  
Fuzzy System ◽  
Energy Efficient ◽  
Clustering Algorithm ◽  
Wireless Sensor ◽  
Cluster Center ◽  
Fcm Algorithm ◽  
Fuzzy C Means ◽  
Genetic Fuzzy System ◽  
Energy Efficient Clustering

The energy efficiency in wireless sensor networks (WSNs) is a fundamental challenge. Cluster-based routing is an energy saving method in this type of networks. This paper presents an energy-efficient clustering algorithm based on fuzzy c-means algorithm and genetic fuzzy system (ECAFG). By using FCM algorithm, the clusters are formed, and then cluster heads (CHs) are selected utilizing GFS. The formed clusters will be remaining static but CHs are selected at the beginning of each round. FCM algorithm forms balanced clusters and distributes the consumed energy among them. Using static clusters also reduces the data overhead and consequently the energy consumption. In GFS, nodes energy, the distance from nodes to the base station and the distance from each node to its corresponding cluster center are considered as determining factors in CHs selection. Then, genetic algorithm is also used to obtain fuzzy if–then rules of GFS. Consequently, the system performance is improved and appropriate CHs can be selected, hence energy dissipation is reduced. The simulation results show that ECAFG, compared with the existing methods, significantly reduces the energy consumption of the sensor nodes, and prolongs the network lifetime.

Energy Efficient Multi-Hop Wireless Sensor Networks with CMIMO-SM Scheme

2014 ◽  
Vol 666 ◽  
pp. 322-326
Author(s):  
Yu Yang Peng ◽  
Jae Ho Choi
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Optimal Number ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Improve Energy Efficiency ◽  
Output System

Energy efficiency is one of the important hot issues in wireless sensor networks. In this paper, a multi-hop scheme based on a cooperative multi-input multi-outputspatial modulation technique is proposed in order to improve energy efficiency in WSN. In this scheme, the sensor nodes are grouped into clusters in order to achieve a multi-input multi-output system; and a simple forwarding transmission scenario is considered so that the intermediate clusters only forward packets originated from the source cluster down to the sink cluster. In order to verify the performance of the proposed system, the bit energy consumption formula is derived and the optimal number of hopsis determined. By qualitative experiments, the obtained results show that the proposed scheme can deliver the data over multiple hops consuming optimal energy consumption per bit.

Energy-Efficient Routing Protocol of Wireless Sensor Network for Industrial Application

2013 ◽  
Vol 579-580 ◽  
pp. 732-739
Author(s):  
Zhi Yan Ma ◽  
Guang You Yang ◽  
Jing Jing Zhou ◽  
Xiong Gan
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Time Slot ◽  
Data Gathering ◽  
Base Station ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Death Time ◽  
Leach Protocol ◽  
Energy Efficient Clustering

An energy-efficient wireless sensor routing protocol (Energy-efficient clustering hierarchy routing protocol, EECH) for industrial field is proposed based on LEACH protocol according to the energy inefficiency of existing routing protocols and the characteristics of industrial field applications. The EECH protocol takes full advantages of the node clustering and time slot distribution in LEACH and implements the functions such as clustering, multi hop time slot distribution, node sleeping and data gathering. The cluster heads can be evenly distributed in the area with the geography location information of the wireless nodes, so that the optimal data gathering path can be established. Meanwhile, the EECH protocol can reduce the conflict in data receiving/transmitting and the energy consumption of the nodes, and extend the network lifetime through the multi hop time slot distribution and node sleep mechanism. The simulation results have shown that the death time of the first node in EECH protocol is extended double time than that of LEACH protocol. When most of the nodes dies, the amount of received data of the base station node is more than twice as much as the LEACH protocol, which has verified the energy efficiency characteristic of the EECH protocol.

Sign in / Sign up

Export Citation Format

Share Document