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

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.

Download Full-text

Energy-efficient hierarchical routing in wireless sensor networks based on Fog Computing

10.21203/rs.3.rs-22873/v2 ◽

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

Download Full-text

An Improvement Routing Protocol Based LEACH for Wireless Sensor Networks

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.614.472 ◽

2014 ◽

Vol 614 ◽

pp. 472-475 ◽

Cited By ~ 2

Author(s):

Jin Gang Cao

Keyword(s):

Wireless Sensor Networks ◽

Energy Consumption ◽

Sensor Networks ◽

Routing Protocol ◽

Base Station ◽

Optimal Number ◽

Sensor Nodes ◽

Wireless Sensor ◽

Number Of Clusters ◽

Cluster Heads

Due to limited energy, computing ability, and memory of Wireless sensor Networks(WSN), routing issue is one of the key factors for WSN. LEACH is the first clustering routing protocol, which can efficiently reduce the energy consumption and prolong the lifetime of WSN, but it also has some disadvantage. This paper proposed an improvement based LEACH, called LEACH-T. According to different number of clusters, LEACH-T uses variable time slot for different clusters in steady-state phase, and single-hop or multi-hop to transmit data between cluster heads and Base Station. Also it considered residual energy of sensor nodes and the optimal number of clusters during selection of the cluster heads. The simulation results show that LEACH-T has better performance than LEACH for prolonging the lifetime and reducing the energy consumption.

Download Full-text

Energy-Efficient Multi-Disjoint Path Opportunistic Node Connection Routing Protocol in Wireless Sensor Networks for Smart Grids

Sensors ◽

10.3390/s19173789 ◽

2019 ◽

Vol 19 (17) ◽

pp. 3789 ◽

Cited By ~ 3

Author(s):

Anees ◽

Zhang ◽

Baig ◽

Lougou

Keyword(s):

Wireless Sensor Networks ◽

Energy Consumption ◽

Sensor Networks ◽

Real Time ◽

Routing Protocol ◽

Energy Efficient ◽

Smart Grids ◽

Sensor Nodes ◽

Wireless Sensor ◽

Disjoint Path

The gradual increase in the maturity of sensor electronics has resulted in the increasing demand for wireless sensor networks for many industrial applications. One of the industrial platforms for efficient usage and deployment of sensor networks is smart grids. The critical network traffic in smart grids includes both delay-sensitive and delay-tolerant data for real-time and non-real-time usage. To facilitate these traffic requirements, the asynchronous working–sleeping cycle of sensor nodes can be used as an opportunity to create a node connection. Efficient use of wireless sensor network in smart grids depends on various parameters like working–sleeping cycle, energy consumption, network lifetime, routing protocol, and delay constraints. In this paper, we propose an energy-efficient multi-disjoint path opportunistic node connection routing protocol (abbreviated as EMOR) for sensor nodes deployed in neighborhood area network. EMOR utilizes residual energy, availability of sensor node’s buffer size, working–sleeping cycle of the sensor node and link quality factor to calculate optimum path connectivity after opportunistic connection random graph and spanning tree formation. The multi-disjoint path selection in EMOR based on service differentiation of real-time and non-real-time traffic leads to an improvement in packet delivery rate, network lifetime, end-end delay and total energy consumption.

Download Full-text

Monitoring square and circular fields with sensors using energy-efficient cluster-based routing for underwater wireless sensor networks

International Journal of Distributed Sensor Networks ◽

10.1177/1550147717717189 ◽

2017 ◽

Vol 13 (7) ◽

pp. 155014771771718 ◽

Cited By ~ 13

Author(s):

Arshad Sher ◽

Nadeem Javaid ◽

Irfan Azam ◽

Hira Ahmad ◽

Wadood Abdul ◽

...

Keyword(s):

Wireless Sensor Networks ◽

Energy Consumption ◽

Sensor Networks ◽

Energy Efficient ◽

Search Algorithm ◽

Minimum Energy ◽

Sensor Nodes ◽

Wireless Sensor ◽

Underwater Wireless Sensor Networks ◽

Energy Efficient Clustering

In this article, to monitor the fields with square and circular geometries, three energy-efficient routing protocols are proposed for underwater wireless sensor networks. First one is sparsity-aware energy-efficient clustering, second one is circular sparsity-aware energy-efficient clustering, and the third one is circular depth–based sparsity-aware energy-efficient clustering routing protocol. All three protocols are proposed to minimize the energy consumption of sparse regions, whereas sparsity search algorithm is proposed to find sparse regions and density search algorithm is used to find dense regions of the network field. Moreover, clustering is performed in dense regions to minimize redundant transmissions of a data packet, while sink mobility is exploited to collect data from sensor nodes with an objective of minimum energy consumption. A depth threshold [Formula: see text] value is also used to minimize number of hops between source and destination for less energy consumption. Simulation results show that our schemes perform better than their counter-part schemes (depth-based routing and energy-efficient depth-based routing) in terms of energy efficiency.

Download Full-text

Energy-efficient hierarchical routing in wireless sensor networks based on Fog Computing

10.21203/rs.3.rs-22873/v1 ◽

2020 ◽

Cited By ~ 1

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

Download Full-text

Energy Efficient Clustering for Wireless Sensor Networks using EASSR

TELKOMNIKA Indonesian Journal of Electrical Engineering ◽

10.11591/tijee.v15i3.1574 ◽

2015 ◽

Vol 15 (3) ◽

pp. 554

Author(s):

Y. Chalapathi Rao ◽

Ch. Santhi Rani

Keyword(s):

Wireless Sensor Networks ◽

Energy Consumption ◽

Sensor Networks ◽

Network Lifetime ◽

Energy Efficient ◽

Average Energy ◽

Rechargeable Batteries ◽

Sensor Nodes ◽

Wireless Sensor ◽

Energy Efficient Clustering

<p>Wireless Sensor Networks (WSNs) consist of a large quantity of small and low cost sensor nodes powered by small non rechargeable batteries and furnish with various sensing devices. The cluster-based technique is one of the good perspectives to reduce energy consumption in WSNs. The lifetime of WSNs is maximized by using the uniform cluster location and balancing the network loading between the clusters. We have reviewed various energy efficient schemes apply in WSNs of which we concerted on clustering approach. So, in this paper we have discussed about few existing energy efficient clustering techniques and proposed an Energy Aware Sleep Scheduling Routing (EASSR) scheme for WSN in which some nodes are usually put to sleep to conserve energy, and this helps to prolong the network lifetime. EASSR selects a node as a cluster head if its residual energy is more than system average energy and have low energy consumption rate in existing round. The efforts of this scheme are, increase of network stability period, and minimize loss of sensed data. Performance analysis and compared statistic results show that EASSR has significant improvement over existing methods in terms of energy consumption, network lifetime and data units gathered at BS.</p>

Download Full-text

Energy-efficient hierarchical routing in wireless sensor networks based on fog computing

EURASIP Journal on Wireless Communications and Networking ◽

10.1186/s13638-020-01835-w ◽

2021 ◽

Vol 2021 (1) ◽

Author(s):

Ademola Philip 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

AbstractWireless sensor networks (WSNs) have been recognized as one of the most essential technologies of the twenty-first 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 the energy consumption of sensor nodes 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. 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 algorithm that can be used to construct an 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. We are aware that in WSNs, the certainty of the sensed data collected by a sensor node can vary due to many reasons such as environmental factors, drained energy, and hardware failures.

Download Full-text

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

Applied Sciences ◽

10.3390/app11010312 ◽

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.

Download Full-text

Performance Analysis of TBC-ACO Routing Protocol with Existing Routing Protocols of Wireless Sensor Networks

International Journal of Advanced Research in Computer Science and Software Engineering ◽

10.23956/ijarcsse.v7i8.46 ◽

2017 ◽

Vol 7 (8) ◽

pp. 169

Author(s):

A. Radhika ◽

D. Haritha

Keyword(s):

Energy Efficiency ◽

Wireless Sensor Networks ◽

Sensor Networks ◽

Swarm Intelligence ◽

Routing Protocol ◽

Routing Protocols ◽

Energy Efficient ◽

Sensor Nodes ◽

Wireless Sensor ◽

Congestion Aware

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN. Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.

Download Full-text

Calculating the Number of Cluster Heads Based on the Rate-Distortion Function in Wireless Sensor Networks

The Scientific World JOURNAL ◽

10.1155/2014/602875 ◽

2014 ◽

Vol 2014 ◽

pp. 1-7

Author(s):

Mingxin Yang ◽

Jingsha He ◽

Yuqiang Zhang

Keyword(s):

Wireless Sensor Networks ◽

Energy Consumption ◽

Sensor Networks ◽

Data Fusion ◽

Rate Distortion ◽

Distortion Function ◽

Sensor Nodes ◽

Wireless Sensor ◽

Wireless Sensor Nodes ◽

Cluster Heads

Due to limited resources in wireless sensor nodes, energy efficiency is considered as one of the primary constraints in the design of the topology of wireless sensor networks (WSNs). Since data that are collected by wireless sensor nodes exhibit the characteristics of temporal association, data fusion has also become a very important means of reducing network traffic as well as eliminating data redundancy as far as data transmission is concerned. Another reason for data fusion is that, in many applications, only some of the data that are collected can meet the requirements of the sink node. In this paper, we propose a method to calculate the number of cluster heads or data aggregators during data fusion based on the rate-distortion function. In our discussion, we will first establish an energy consumption model and then describe a method for calculating the number of cluster heads from the point of view of reducing energy consumption. We will also show through theoretical analysis and experimentation that the network topology design based on the rate-distortion function is indeed more energy-efficient.

Download Full-text