scholarly journals Energy-Efficient Relay-Based Void Hole Prevention and Repair in Clustered Multi-AUV Underwater Wireless Sensor Network

2021 ◽  
Vol 2021 ◽  
pp. 1-20
Author(s):  
Amir Chaaf ◽  
Mohammed Saleh Ali Muthanna ◽  
Ammar Muthanna ◽  
Soha Alhelaly ◽  
Ibrahim A. Elgendy ◽  
...  
Keyword(s):  
Energy Consumption ◽  
Energy Efficient ◽  
Autonomous Underwater Vehicles ◽  
Average Energy ◽  
Packet Transmission ◽  
Wireless Sensor ◽  
Current Status ◽  
Maximum Matching ◽  
Sleep Scheduling ◽  
Relay Nodes

Underwater wireless sensor networks (UWSNs) enable various oceanic applications which require effective packet transmission. In this case, sparse node distribution, imbalance in terms of overall energy consumption between the different sensor nodes, dynamic network topology, and inappropriate selection of relay nodes cause void holes. Addressing this problem, we present a relay-based void hole prevention and repair (ReVOHPR) protocol by multiple autonomous underwater vehicles (AUVs) for UWSN. ReVOHPR is a global solution that implements different phases of operations that act mutually in order to efficiently reduce and identify void holes and trap relay nodes to avoid it. ReVOHPR adopts the following operations as ocean depth (levels)-based equal cluster formation, dynamic sleep scheduling, virtual graph-based routing, and relay-assisted void hole repair. For energy-efficient cluster forming, entropy-based eligibility ranking (E2R) is presented, which elects stable cluster heads (CHs). Then, dynamic sleep scheduling is implemented by the dynamic kernel Kalman filter (DK2F) algorithm in which sleep and active modes are based on the node’s current status. Intercluster routing is performed by maximum matching nodes that are selected by dual criteria, and also the data are transmitted to AUV. Finally, void holes are detected and repaired by the bicriteria mayfly optimization (BiCMO) algorithm. The BiCMO focuses on reducing the number of holes and data packet loss and maximizes the quality of service (QoS) and energy efficiency of the network. This protocol is timely dealing with node failures in packet transmission via multihop routing. Simulation is implemented by the NS3 (AquaSim module) simulator that evaluates the performance in the network according to the following metrics: average energy consumption, delay, packet delivery rate, and throughput. The simulation results of the proposed REVOHPR protocol comparing to the previous protocols allowed to conclude that the REVOHPR has considerable advantages. Due to the development of a new protocol with a set of phases for data transmission, energy consumption minimization, and void hole avoidance and mitigation in UWSN, the number of active nodes rate increases with the improvement in overall QoS.

scholarly journals REVOHPR: Relay-based Void Hole Prevention and Repair by Virtual Routing in Clustered Multi-AUV Underwater Wireless Sensor Network

2021 ◽  
Author(s):  
Amir Chaaf ◽  
Mohammed Saleh Ali Muthanna ◽  
Ammar Muthanna ◽  
Soha Alhelaly ◽  
Ibrahim A. Elgendy ◽  
...  
Keyword(s):  
Autonomous Underwater Vehicles ◽  
Cluster Formation ◽  
Average Energy ◽  
Dynamic Network ◽  
Packet Transmission ◽  
Wireless Sensor ◽  
Current Status ◽  
Maximum Matching ◽  
Sleep Scheduling ◽  
Relay Nodes

Underwater Wireless Sensor Networks (UWSN) enables various oceanic applications which require effective packet transmission. In this case, sparse node distribution, dynamic network topology and inappropriate selection of relay nodes cause void holes. Addressing this problem, we present a Relay based Void Hole Prevention and Repair protocol (ReVOHPR) by multiple Autonomous Underwater Vehicles (AUV) for UWSN. ReVOHPR efficiently identifies and avoids void holes and trap relay nodes to avoid it. ReVOHPR adopts the following operations as Ocean Depth (levels) based Equal Cluster Formation, Dynamic Sleep Scheduling, Virtual Graph based Routing, and Relay Assisted Void Hole Repair. For energy efficient cluster forming, Entropy based Eligibility Ranking (E2R) is presented which elects stable cluster heads (CHs). Then, dynamic sleep scheduling is implemented Dynamic Kernel Kalman Filter (DK2F) algorithm in which Sleep and Active modes based on the nodes current status. Inter Cluster Routing is performed by maximum matching nodes which selects by Dual criteria and also data transmitted to AUV. Finally, void holes are detected and repair by Bi-Criteria Mayfly Optimization (BiCMO) algorithm. The BiCMO focuses on reducing the number of holes, data packet loss and maximizes Quality of Service (QoS) and energy efficiency of the networks. This protocol is timely deal with node failures in packet transmission via multi-hop routing. Simulation is implemented by NS3 (AquaSim module) simulator that evaluates the performance in network simulation for following metrics as average energy consumption, delay, packet delivery rate and throughput.

STBCP: An Energy Efficient Sub-threshold Bee Colony-based Protocol for Wireless Sensor Networks

2019 ◽  
Vol 9 (4) ◽  
pp. 443-453
Author(s):  
Ghazaleh Kia ◽  
Alireza Hassanzadeh
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Energy Efficient ◽  
Average Energy ◽  
Wireless Sensor ◽  
Battery Lifetime ◽  
Bee Colony

Background & Objective: In this paper, a new energy efficient LEACH-based protocol for wireless sensor network is presented. One of the main issues in Wireless Sensor Networks (WSNs) is the battery consumption. In fact, changing batteries is a time consuming task and expensive. It is even impossible in many remote WSNs. Methods: The main goal of the presented protocol is to decrease the energy consumption of each node and increase the network lifetime. Lower power consumption results in longer battery lifetime. This protocol takes the advantage of sub-threshold technique and bee colony algorithm in order to optimize the energy consumption of a WSN. Simulation results show that the energy consumption of the wireless sensor network reduces by 25 percent using STBCP in comparison with recent LEACHbased protocols. It has been shown that the average energy of the network remains balanced and the distribution of residual energy in each round is equitable. Conclusion: In addition, the lifetime of a network using STBCP protocol has been increased by 23 percent regarding recently presented routing protocols.

scholarly journals Energy Efficient Determinism in WSN through Reverse Packet Elimination

Sensors ◽  
2020 ◽  
Vol 20 (10) ◽  
pp. 2890 ◽  
Author(s):  
Fredrik Kvist ◽  
Andreas Ramstad Urke ◽  
Knut Øvsthus
Keyword(s):  
Energy Consumption ◽  
Energy Efficient ◽  
Average Energy ◽  
Wireless Sensor ◽  
Wired Networks ◽  
Average Latency ◽  
Average Energy Consumption ◽  
Algorithm Implementation ◽  
Installation Cost ◽  
Industrial Wireless Sensor Network

Recently, the industrial wireless sensor network (WSN) has gained attention as a complement to wired networks due to its flexibility and lower installation cost. We present a novel Reverse Packet Elimination (RPE) algorithm implementation at the IPv6 over the TSCH mode of IEEE 802.15.4e (6TiSCH) stack that increases reliability without significantly increasing energy consumption. RPE increases the reliability while conserving energy by transmitting a cancellation packet from the sink towards the sender to reduce unnecessary packets. The evaluation utilized mainly the 6TiSCH Simulator, with additional analytical assessments. We present several evaluation scenarios and compare WSN with and without RPE. In a WSN where each link had a packet reception rate of 70%, RPE increased the reliability with 11.8%. Furthermore, the average latency decreased with 39.1%. The average energy consumption increased with 19.8% when utilizing RPE. However, the network lifetime, i.e., the time before the first node experiences battery depletion increases slightly, which is a significant improvement compared to alternative replication mechanisms.

scholarly journals Energy Efficient Clustering for Wireless Sensor Networks using EASSR

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>

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 cutting parameter optimization

2021 ◽  
Author(s):  
Xingzheng Chen ◽  
Congbo Li ◽  
Ying Tang ◽  
Li Li ◽  
Hongcheng Li
Keyword(s):  
Energy Efficiency ◽  
Energy Consumption ◽  
Parameter Optimization ◽  
Energy Efficient ◽  
Cutting Parameters ◽  
Machining Process ◽  
Cutting Fluid ◽  
Current Status ◽  
Cutting Parameter ◽  
Cutting Parameter Optimization

AbstractMechanical manufacturing industry consumes substantial energy with low energy efficiency. Increasing pressures from energy price and environmental directive force mechanical manufacturing industries to implement energy efficient technologies for reducing energy consumption and improving energy efficiency of their machining processes. In a practical machining process, cutting parameters are vital variables set by manufacturers in accordance with machining requirements of workpiece and machining condition. Proper selection of cutting parameters with energy consideration can effectively reduce energy consumption and improve energy efficiency of the machining process. Over the past 10 years, many researchers have been engaged in energy efficient cutting parameter optimization, and a large amount of literature have been published. This paper conducts a comprehensive literature review of current studies on energy efficient cutting parameter optimization to fully understand the recent advances in this research area. The energy consumption characteristics of machining process are analyzed by decomposing total energy consumption into electrical energy consumption of machine tool and embodied energy of cutting tool and cutting fluid. Current studies on energy efficient cutting parameter optimization by using experimental design method and energy models are reviewed in a comprehensive manner. Combined with the current status, future research directions of energy efficient cutting parameter optimization are presented.

An Energy Efficient Estimation Algorithm for Wireless Sensor Network

2011 ◽  
Vol 216 ◽  
pp. 176-180
Author(s):  
Yong Ding ◽  
Yue Mei Su
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Estimation Algorithm ◽  
Efficient Estimation ◽  
Wireless Sensor ◽  
Estimation Algorithms ◽  
Current Energy

Wireless Sensor Networks functionality is closely related to network lifetime which depends on the energy consumption, so require energy- efficient protocols to improve the network lifetime. According to the analysis and summary of the current energy efficient estimation algorithms in wireless sensor network An energy-efficient algorithm is proposed,. Then this optimization algorithm proposed in the paper is adopted to improve the traditional diffusion routing protocol. Simulation results show that this algorithm is to effectively balance the network energy consumption, improve the network life-cycle and ensure the communication quality.

scholarly journals Energy-Efficient and Disjoint Multipath Using Face routing in Wireless Sensor Networks

Energies ◽  
2021 ◽  
Vol 14 (22) ◽  
pp. 7823
Author(s):  
Hyunchong Cho ◽  
Seungmin Oh ◽  
Yongje Shin ◽  
Euisin Lee
Keyword(s):  
Energy Consumption ◽  
Average Energy ◽  
Packet Transmission ◽  
Destination Node ◽  
Path Generation ◽  
Data Packets ◽  
Hole Area ◽  
Face Routing ◽  
Multiple Routes ◽  
Average Energy Consumption

In WSNs, multipath is well-known as a method to improve the reliability of packet delivery by making multiple routes from a source node to a destination node. To improve reliability and load-balancing, it is important to ensure that disjoint characteristics of multipath do not use same nodes during path generation. However, when multipath studies encounter a hole area from which is hard to transmit data packets, they have a problem with breaking the disjoint features of multipath. Although existing studies propose various strategies to bypass hole areas, they have side effects that significantly accelerate energy consumption and packet transmission delay. Therefore, to retain the disjoint feature of multipath, we propose a new scheme that can reduce delay and energy consumption for a node near a hole area using two approaches—global joint avoidance and local avoidance. This scheme uses global joint avoidance to generate a new path centered on a hole area and effectively bypasses the hole area. This scheme also uses local joint avoidance that does not select the same nodes during new path generation using a marking process. In simulations, the proposed scheme has an average 30% improvement in terms of average energy consumption and delay time compared to other studies.

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

Sign in / Sign up

Export Citation Format

Share Document