scholarly journals An Uneven Node Self-Deployment Optimization Algorithm for Maximized Coverage and Energy Balance in Underwater Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1368 ◽  
Author(s):  
Luoheng Yan ◽  
Yuyao He ◽  
Zhongmin Huangfu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Balance ◽  
Optimization Algorithm ◽  
Growth Ring ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Connected Network ◽  
Deployment Optimization

The underwater wireless sensor networks (UWSNs) have been applied in lots of fields such as environment monitoring, military surveillance, data collection, etc. Deployment of sensor nodes in 3D UWSNs is a crucial issue, however, it is a challenging problem due to the complex underwater environment. This paper proposes a growth ring style uneven node depth-adjustment self-deployment optimization algorithm (GRSUNDSOA) to improve the coverage and reliability of UWSNs, meanwhile, and to solve the problem of energy holes. In detail, a growth ring style-based scheme is proposed for constructing the connective tree structure of sensor nodes and a global optimal depth-adjustment algorithm with the goal of comprehensive optimization of both maximizing coverage utilization and energy balance is proposed. Initially, the nodes are scattered to the water surface to form a connected network on this 2D plane. Then, starting from sink node, a growth ring style increment strategy is presented to organize the common nodes as tree structures and each root of subtree is determined. Meanwhile, with the goal of global maximizing coverage utilization and energy balance, all nodes depths are computed iteratively. Finally, all the nodes dive to the computed position once and a 3D underwater connected network with non-uniform distribution and balanced energy is constructed. A series of simulation experiments are performed. The simulation results show that the coverage and reliability of UWSN are improved greatly under the condition of full connectivity and energy balance, and the issue of energy hole can be avoided effectively. Therefore, GRSUNDSOA can prolong the lifetime of UWSN significantly.

scholarly journals Survey of Localizations Algorithms in Underwater Wireless Sensor Network

2021 ◽  
pp. 403-409
Author(s):  
Sitanshu Kumar ◽  
Dr. Sunil Rathod
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Optimization Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Sensing Element ◽  
Localization Algorithms

The main objective of this research paper is to review and analyze the different existing localization algorithms techniques that are used to overcome the localization issue in the wireless sensor network. Underwater Wireless sensor networks consists up of small sensor nodes that are placed in huge quantity over a large water surface region to perform several tasks like sensing the data and communicate with other devices. Most of the applications of underwater wireless sensor networks like forest fire detection required the exact position of the sensing element. The main motive of the localization process is to localize the coordinates to the every node with unidentified location in the sensing area of underwater. In this paper, we have discussed various localization algorithms for localizing the sensor nodes like particle swarm optimization; bees optimization algorithm, bat algorithm, cuckoo optimization and butterfly optimization algorithm etc. are reviewed. The detail analysis of these techniques in terms of localization error, computation time and amount of localized nodes has been discussed in this paper.

scholarly journals A Novel Coverage Optimization Strategy Based on Grey Wolf Algorithm Optimized by Simulated Annealing for Wireless Sensor Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Yong Zhang ◽  
Li Cao ◽  
Yinggao Yue ◽  
Yong Cai ◽  
Bo Hang
Keyword(s):  
Wireless Sensor Networks ◽  
Simulated Annealing ◽  
Sensor Networks ◽  
Optimization Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Grey Wolf ◽  
Grey Wolf Optimization ◽  
Coverage Optimization ◽  
Grey Wolf Algorithm

The coverage optimization problem of wireless sensor network has become one of the hot topics in the current field. Through the research on the problem of coverage optimization, the coverage of the network can be improved, the distribution redundancy of the sensor nodes can be reduced, the energy consumption can be reduced, and the network life cycle can be prolonged, thereby ensuring the stability of the entire network. In this paper, a novel grey wolf algorithm optimized by simulated annealing is proposed according to the problem that the sensor nodes have high aggregation degree and low coverage rate when they are deployed randomly. Firstly, the mathematical model of the coverage optimization of wireless sensor networks is established. Secondly, in the process of grey wolf optimization algorithm, the simulated annealing algorithm is embedded into the grey wolf after the siege behavior ends and before the grey wolf is updated to enhance the global optimization ability of the grey wolf algorithm and at the same time improve the convergence rate of the grey wolf algorithm. Simulation experiments show that the improved grey wolf algorithm optimized by simulated annealing is applied to the coverage optimization of wireless sensor networks. It has better effect than particle swarm optimization algorithm and standard grey wolf optimization algorithm, has faster optimization speed, improves the coverage of the network, reduces the energy consumption of the nodes, and prolongs the network life cycle.

scholarly journals A data forwarding algorithm based on Markov thought in underwater wireless sensor networks

2017 ◽  
Vol 13 (2) ◽  
pp. 155014771769198
Author(s):  
Dongwei Li ◽  
Jingli Du ◽  
Linfeng Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Success Rate ◽  
Three Dimensional ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Data Forwarding ◽  
Bottom To Top

The underwater wireless sensor networks composed of sensor nodes are deployed underwater for monitoring and gathering submarine data. Since the underwater environment is usually unpredictable, making the nodes move or be damaged easily, such that there are several vital objectives in the data forwarding issue, such as the delivery success rate, the error rate, and the energy consumption. To this end, we propose a data forwarding algorithm based on Markov thought, which logically transforms the underwater three-dimensional deployment model into a two-dimensional model, and thus the nodes are considered to be hierarchically deployed. The data delivery is then achieved through a “bottom to top” forwarding mode, where the delivery success rate is improved and the energy consumption is reduced because the established paths are more stable, and the proposed algorithm is self-adaptive to the dynamic routing loads.

scholarly journals An Energy-Balanced Mechanism for Hierarchical Routing in Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Zhenjiang Zhang ◽  
Yanan Wang ◽  
Fuxing Song ◽  
Wenyu Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Balance ◽  
Cluster Head ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sink Node ◽  
Hierarchical Routing ◽  
Cluster Heads

In wireless sensor networks (WSNs), energy-constrained sensor nodes are always deployed in hazardous and inaccessible environments, making energy management a key problem for network design. The mechanism of RNTA (redundant node transmission agents) lacks an updating mechanism for the redundant nodes, causing an unbalanced energy distribution among sensor nodes. This paper presents an energy-balanced mechanism for hierarchical routing (EBM-HR), in which the residual energy of redundant nodes is quantified and made hierarchic, so that the cluster head can dynamically select the redundant node with the highest residual energy grade as a relay to complete the information transmission to the sink node and achieve an intracluster energy balance. In addition, the network is divided into several layers according to the distances between cluster heads and the sink node. Based on the energy consumption of the cluster heads, the sink node will decide to recluster only in a certain layer so as to achieve an intercluster energy balance. Our approach is evaluated by a simulation comparing the LEACH algorithm to the HEED algorithm. The results demonstrate that the BEM-HR mechanism can significantly boost the performance of a network in terms of network lifetime, data transmission quality, and energy balance.

scholarly journals Low-Energy Secure Routing Protocol for WSNs Based on Multiobjective Ant Colony Optimization Algorithm

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Xueli Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Ant Colony Optimization Algorithm

As one of the three pillars of information technology, wireless sensor networks (WSNs) have been widely used in environmental detection, healthcare, military surveillance, industrial data sampling, and many other fields due to their unparalleled advantages in deployment cost, network power consumption, and versatility. The advent of the 5G standard and the era of Industry 4.0 have brought new opportunities for the development of wireless sensor networks. However, due to the limited power capacity of the sensor nodes themselves, the harsh deployment environment will bring a great difficulty to the energy replenishment of the sensor nodes, so the energy limitation problem has become a major factor limiting its further development; how to improve the energy utilization efficiency of WSNs has become an urgent problem in the scientific and industrial communities. Based on this, this paper researches the routing technology of wireless sensor networks, from the perspective of improving network security, and reducing network energy consumption, based on the study of ant colony optimization algorithm, further studies the node trust evaluation mechanism, and carries out the following research work: (1) study the energy consumption model of wireless sensor networks; (2) basic ant colony algorithm improvement; (3) multiobjective ant colony algorithm based on wireless sensor routing algorithm optimization. In this study, the NS2 network simulator is used as a simulation tool to verify the performance of the research algorithm. Compared with existing routing algorithms, the simulation results show that the multiobjective ant colony optimization algorithm has better performance in evaluation indexes such as life cycle, node energy consumption, node survival time, and stability compared with the traditional algorithm and the dual cluster head ant colony optimization algorithm.

A Taxonomy of Routing Techniques in Underwater Wireless Sensor Networks

2012 ◽  
pp. 119-147
Author(s):  
Muhammad Ayaz ◽  
Azween Abdullah ◽  
Ibrahima Faye
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Dynamic Environment ◽  
Vital Role ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Underwater Sensor Networks ◽  
Underwater Wireless Sensor Networks ◽  
Sea Bed ◽  
Application Requirements

Underwater Wireless Sensor Networks (UWSNs) are finding different applications for offshore exploration and ocean monitoring. In most of these applications, the network consists of a significant number of sensor nodes deployed at different depth levels throughout the area of interest. Sensor nodes on the sea bed cannot communicate directly with the nodes near the surface level, so they require multihop communication assisted by an appropriate routing scheme. However, this appropriateness not only depends on network resources and application requirements, but environment constraints are involved as well. These factors all provide a platform where a resource aware routing strategy plays a vital role in fulfilling different application requirements with dynamic environment conditions. Realizing this fact, much of the attention has been given to construct a reliable scheme, and many routing protocols have been proposed in order to provide efficient route discoveries between the source and sink. In this chapter, the authors present a review and comparison of different algorithms proposed recently for underwater sensor networks. Later on, all of these have been classified into different groups according to their characteristics and functionalities.

Sign in / Sign up

Export Citation Format

Share Document