scholarly journals ProLo: Localization via Projection for Three-Dimensional Mobile Underwater Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (6) ◽  
pp. 1414 ◽  
Author(s):  
Feng Zhou ◽  
Yushi Li ◽  
Hejun Wu ◽  
Zhimin Ding ◽  
Xiying Li

We study the problem of three-dimensional localization of the underwater mobile sensor networks using only range measurements without GPS devices. This problem is challenging because sensor nodes often drift with unknown water currents. Consequently, the moving direction and speed of a sensor node cannot be predicted. Moreover, the motion devices of the sensor nodes are not accurate in underwater environments. Therefore, we propose an adaptive localization scheme, ProLo, taking these uncertainties into consideration. This scheme applies the rigidity theory and maintains a virtual rigid structure through projection. We have proved the correctness of this three-dimensional localization scheme and also validated it using simulation. The results demonstrate that ProLo is promising for real mobile underwater sensor networks with various noises and errors.

Sensors ◽  
2020 ◽  
Vol 20 (15) ◽  
pp. 4293
Author(s):  
Junhai Luo ◽  
Yang Yang ◽  
Zhiyan Wang ◽  
Yanping Chen ◽  
Man Wu

As one of the important facilities for marine exploration, as well as environment monitoring, access control, and security, underwater wireless sensor networks (UWSNs) are widely used in related military and civil fields, since the sensor node localization is the basis of UWSNs’ application in various related fields. Therefore, the research of localization algorithms based on UWSNs has gradually become one of the research hotspots today. However, unlike terrestrial wireless sensor networks (WSNs), many terrestrial monitoring and localization technologies cannot be directly applied to the underwater environment. Moreover, due to the complexity and particularity of the underwater environment, the localization of underwater sensor nodes still faces challenges, such as the localization ratio of sensor nodes, time synchronization, localization accuracy, and the mobility of nodes. In this paper, we propose a mobility-assisted localization scheme with time synchronization-free feature (MALS-TSF) for three-dimensional (3D) large-scale UWSNs. In addition, the underwater drift of the sensor node is considered in this scheme. The localization scheme can be divided into two phases. In Phase I, anchor nodes are distributed in the monitoring area, reducing the monitoring cost. Then, we address a time-synchronization-free localization scheme, to obtain the coordinates of the unknown sensor nodes. In Phase II, we use the method of two-way TOA to locate the remaining ordinary sensor nodes. The simulation results show that MALS-TSF can achieve a relatively high localization ratio without time synchronization.


Sensors ◽  
2018 ◽  
Vol 18 (8) ◽  
pp. 2568 ◽  
Author(s):  
Ruisong Wang ◽  
Gongliang Liu ◽  
Wenjing Kang ◽  
Bo Li ◽  
Ruofei Ma ◽  
...  

Information acquisition in underwater sensor networks is usually limited by energy and bandwidth. Fortunately, the received signal can be represented sparsely on some basis. Therefore, a compressed sensing method can be used to collect the information by selecting a subset of the total sensor nodes. The conventional compressed sensing scheme is to select some sensor nodes randomly. The network lifetime and the correlation of sensor nodes are not considered. Therefore, it is significant to adjust the sensor node selection scheme according to these factors for the superior performance. In this paper, an optimized sensor node selection scheme is given based on Bayesian estimation theory. The advantage of Bayesian estimation is to give the closed-form expression of posterior density function and error covariance matrix. The proposed optimization problem first aims at minimizing the mean square error (MSE) of Bayesian estimation based on a given error covariance matrix. Then, the non-convex optimization problem is transformed as a convex semidefinite programming problem by relaxing the constraints. Finally, the residual energy of each sensor node is taken into account as a constraint in the optimization problem. Simulation results demonstrate that the proposed scheme has better performance than a conventional compressed sensing scheme.


Sensors ◽  
2019 ◽  
Vol 19 (5) ◽  
pp. 1039 ◽  
Author(s):  
Tariq Islam ◽  
Yong Kyu Lee

Many applications of underwater sensor networks (UWSNs), such as target tracking, reconnaissance and surveillance, and marine life monitoring require information about the geographic locations of the sensed data. This makes the localization of sensor nodes a crucial part of such underwater sensing missions. In the case of mobile UWSNs, the problem becomes challenging, not only due to a need for the periodic tracking of nodes, but also due to network partitioning as a result of the pseudo-random mobility of nodes. In this work, we propose an energy efficient solution for localizing nodes in partitioned networks. Energy consumption is minimized by clustering unlocalized partitioned nodes and allowing only clusterheads to carry out a major part of the localization procedure on behalf of the whole cluster. Moreover, we introduce a retransmission control scheme that reduces energy consumption by controlling unnecessary transmission. The major design goal of our work is to maximize localization coverage while keeping communication overheads at a minimum, thus achieving better energy efficiency. The major contributions of this paper include a clustering technique for localizing partitioned nodes and a retransmission control strategy that reduces unnecessary transmissions.


Sensors ◽  
2019 ◽  
Vol 19 (9) ◽  
pp. 2135 ◽  
Author(s):  
Tariq Islam ◽  
Yong Kyu Lee

Knowledge about the geographic coordinates of underwater sensor nodes is of primary importance for many applications and protocols of under water sensor networks (UWSNs) thus making localization of sensor nodes a crucial part of underwater network design. In case of mobile underwater sensor network, location estimation becomes challenging not only due to the need for periodic tracking of nodes, but also due to network partitioning caused by the pseudo-random mobility of nodes. Our proposed technique accomplishes the task of localization in two stages: (1) relative localization of sensor nodes with respect to a reference node at regular intervals during sensing operation. (2) Offline absolute localization of sensor nodes using absolute coordinates of the reference node and relative locations estimated during stage 1. As our protocol deals with mobile underwater sensor networks that may introduce network partitioning, we also propose a partition handling routine to deal with network partitions to achieve high localization coverage. The major design goal of our work is to maximize localization coverage while keeping communication overhead minimum, thus achieving better energy efficiency. Major contributions of this paper are: (1) Two energy efficient relative localization techniques, and (2) A partition handling strategy that ensures localization of partitioned nodes.


2013 ◽  
Vol 05 (01) ◽  
pp. 1350005
Author(s):  
XIANLING LU ◽  
DEYING LI ◽  
YI HONG ◽  
WENPING CHEN

Localization is one of the fundamental tasks for underwater sensors networks (USNs). It is required for data tagging, target detection, route protocols, and so on. In this paper, we propose an efficient low-cost range-free localization scheme for 3D underwater sensor networks (3D-LRLS) without any additional hardware infrastructure. In our scheme, each anchor node has variable transmission power levels. At first, the power levels of each anchor are decided by the Delaunay triangulation for the network space. Then, ordinary sensors listen to the beacons sent from the anchor nodes. Based on the beacon messages, each node calculates its location individually by a low computational complexity method. The extensive simulation results demonstrate that 3D-LRLS is efficient in terms of both localization ratio and localization accuracy.


Author(s):  
Meiyan Zhang ◽  
Wenyu Cai

Background: Effective 3D-localization in mobile underwater sensor networks is still an active research topic. Due to the sparse characteristic of underwater sensor networks, AUVs (Autonomous Underwater Vehicles) with precise positioning abilities will benefit cooperative localization. It has important significance to study accurate localization methods. Methods: In this paper, a cooperative and distributed 3D-localization algorithm for sparse underwater sensor networks is proposed. The proposed algorithm combines with the advantages of both recursive location estimation of reference nodes and the outstanding self-positioning ability of mobile AUV. Moreover, our design utilizes MMSE (Minimum Mean Squared Error) based recursive location estimation method in 2D horizontal plane projected from 3D region and then revises positions of un-localized sensor nodes through multiple measurements of Time of Arrival (ToA) with mobile AUVs. Results: Simulation results verify that the proposed cooperative 3D-localization scheme can improve performance in terms of localization coverage ratio, average localization error and localization confidence level. Conclusion: The research can improve localization accuracy and coverage ratio for whole underwater sensor networks.


2016 ◽  
Vol 1 (2) ◽  
pp. 1-7
Author(s):  
Karamjeet Kaur ◽  
Gianetan Singh Sekhon

Underwater sensor networks are envisioned to enable a broad category of underwater applications such as pollution tracking, offshore exploration, and oil spilling. Such applications require precise location information as otherwise the sensed data might be meaningless. On the other hand, security critical issue as underwater sensor networks are typically deployed in harsh environments. Localization is one of the latest research subjects in UWSNs since many useful applying UWSNs, e.g., event detecting. Now day’s large number of localization methods arrived for UWSNs. However, few of them take place stability or security criteria. In purposed work taking up localization in underwater such that various wireless sensor nodes get localize to each other. RSS based localization technique used remove malicious nodes from the communication intermediate node list based on RSS threshold value. Purposed algorithm improves more throughput and less end to end delay without degrading energy dissipation at each node. The simulation is conducted in MATLAB and it suggests optimal result as comparison of end to end delay with and without malicious node.


2021 ◽  
Vol 15 (1) ◽  
pp. 1-26
Author(s):  
Sudip Misra ◽  
Tamoghna Ojha ◽  
Madhusoodhanan P

Node localization is a fundamental requirement in underwater sensor networks (UWSNs) due to the ineptness of GPS and other terrestrial localization techniques in the underwater environment. In any UWSN monitoring application, the sensed information produces a better result when it is tagged with location information. However, the deployed nodes in UWSNs are vulnerable to many attacks, and hence, can be compromised by interested parties to generate incorrect location information. Consequently, using the existing localization schemes, the deployed nodes are unable to autonomously estimate the precise location information. In this regard, similar existing schemes for terrestrial wireless sensor networks are not applicable to UWSNs due to its inherent mobility, limited bandwidth availability, strict energy constraints, and high bit-error rates. In this article, we propose SecRET , a <underline>Sec</underline>ure <underline>R</underline>ange-based localization scheme empowered by <underline>E</underline>vidence <underline>T</underline>heory for UWSNs. With trust-based computations, the proposed scheme, SecRET , enables the unlocalized nodes to select the most reliable set of anchors with low resource consumption. Thus, the proposed scheme is adaptive to many attacks in UWSN environment. NS-3 based performance evaluation indicates that SecRET maintains energy-efficiency of the deployed nodes while ensuring efficient and secure localization, despite the presence of compromised nodes under various attacks.


2019 ◽  
Vol 11 (21) ◽  
pp. 6171 ◽  
Author(s):  
Jangsik Bae ◽  
Meonghun Lee ◽  
Changsun Shin

With the expansion of smart agriculture, wireless sensor networks are being increasingly applied. These networks collect environmental information, such as temperature, humidity, and CO2 rates. However, if a faulty sensor node operates continuously in the network, unnecessary data transmission adversely impacts the network. Accordingly, a data-based fault-detection algorithm was implemented in this study to analyze data of sensor nodes and determine faults, to prevent the corresponding nodes from transmitting data; thus, minimizing damage to the network. A cloud-based “farm as a service” optimized for smart farms was implemented as an example, and resource management of sensors and actuators was provided using the oneM2M common platform. The effectiveness of the proposed fault-detection model was verified on an integrated management platform based on the Internet of Things by collecting and analyzing data. The results confirm that when a faulty sensor node is not separated from the network, unnecessary data transmission of other sensor nodes occurs due to continuous abnormal data transmission; thus, increasing energy consumption and reducing the network lifetime.


2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Jian Chen ◽  
Jie Jia ◽  
Yingyou Wen ◽  
Dazhe Zhao

Energy hole is an inherent problem caused by heavier traffic loads of sensor nodes nearer the sink because of more frequent data transmission, which is strongly dependent on the topology induced by the sensor deployment. In this paper, we propose an autonomous sensor redeployment algorithm to balance energy consumption and mitigate energy hole for unattended mobile sensor networks. First, with the target area divided into several equal width coronas, we present a mathematical problem modeling sensor node layout as well as transmission pattern to maximize network coverage and reduce communication cost. And then, by calculating the optimal node density for each corona to avoid energy hole, a fully distributed movement algorithm is proposed, which can achieve an optimal distribution quickly only by pushing or pulling its one-hop neighbors. The simulation results demonstrate that our algorithm achieves a much smaller average moving distance and a much longer network lifetime than existing algorithms and can eliminate the energy hole problem effectively.


Sign in / Sign up

Export Citation Format

Share Document