A LOW-COST RANGE-FREE LOCALIZATION SCHEME FOR THREE-DIMENSIONAL UNDERWATER SENSOR NETWORKS

2013 ◽  
Vol 05 (01) ◽  
pp. 1350005
Author(s):  
XIANLING LU ◽  
DEYING LI ◽  
YI HONG ◽  
WENPING CHEN
Keyword(s):  
Sensor Networks ◽  
Low Cost ◽  
Three Dimensional ◽  
Underwater Sensor Networks ◽  
Transmission Power ◽  
Localization Accuracy ◽  
Localization Scheme ◽  
Variable Transmission ◽  
Anchor Nodes ◽  
Range Free

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.

scholarly journals Hexahedral Localization (HL): A Three-Dimensional Hexahedron Localization Based on Mobile Beacons

2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
Linlan Liu ◽  
Haili Zhang ◽  
Xiaotian Geng ◽  
Xin Shu
Keyword(s):  
Wireless Sensor Networks ◽  
Three Dimensional ◽  
High Accuracy ◽  
Wireless Sensor ◽  
Localization Accuracy ◽  
Localization Scheme ◽  
Future Work ◽  
Range Free ◽  
Mobile Beacons ◽  
Dimensional Range

In wireless sensor networks, localization is one of the fundamental technologies and is essential to its applications. In this paper, we propose a three-dimensional range-free localization scheme named hexahedral localization. In the scheme, the space is divided into a lot of hexahedrons. Then, all the unknown nodes are located by utilizing the perpendicular properties of the trajectory. The contribution of our scheme can be summarized into two points. First, it fills the gap of shortage of three-dimensional localization based on mobile beacons. Second, it brings in the outstanding localization accuracy. The simulation result reveals that this localization scheme has the relative high accuracy. At the end of the paper, the performance and error of our scheme are analyzed in aim of improving in the future work.

scholarly journals Decomposition Based Localization for Anisotropic Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-16 ◽  
Author(s):  
Baojian Gao ◽  
Xiaoning Zhao ◽  
Jun Wang ◽  
Xiaojiang Chen
Keyword(s):  
Sensor Networks ◽  
Euclidean Distance ◽  
Low Cost ◽  
Recognition Algorithm ◽  
Node Localization ◽  
Hop Count ◽  
Localization Accuracy ◽  
Localization Algorithms ◽  
Anisotropic Network ◽  
Range Free

Range-free localization algorithms have caused widespread attention due to their low cost and low power consumption. However, such schemes heavily depend on the assumption that the hop count distance between two nodes correlates well with their Euclidean distance, which will be satisfied only in isotropic networks. When the network is anisotropic, holes or obstacles will lead to the estimated distance between nodes deviating from their Euclidean distance, causing a serious decline in localization accuracy. This paper develops HCD-DV-Hop for node localization in anisotropic sensor networks. HCD-DV-Hop consists of two steps. Firstly, an anisotropic network is decomposed into several different isotropic subnetworks, by using the proposed Hop Count Based Decomposition (HCD) scheme. Secondly, DV-Hop algorithm is carried out in each subnetwork for node localization. HCD first uses concave/convex node recognition algorithm and cleansing criterion to obtain the optimal concave and convex nodes based on boundary recognition, followed by segmentation of the network’s boundary. Finally, the neighboring boundary nodes of the optimal concave nodes flood the network with decomposition messages; thus, an anisotropic network is decomposed. Extensive simulations demonstrated that, compared with range-free DV-Hop algorithm, HCD-DV-Hop can effectively reduce localization error in anisotropic networks without increasing the complexity of the algorithm.

scholarly journals Two-Phase Time Synchronization-Free Localization Algorithm for Underwater Sensor Networks

2017 ◽  
Author(s):  
Junhai Luo ◽  
Liying Fan
Keyword(s):  
Sensor Networks ◽  
Time Synchronization ◽  
Sensor Nodes ◽  
Second Phase ◽  
Underwater Sensor Networks ◽  
Localization Algorithm ◽  
Two Phase ◽  
Phase Time ◽  
Anchor Nodes ◽  
Range Free

Underwater Sensor Networks (UWSNs) can enable a broad range of applications such as resource monitoring, disaster prevention, and navigation-assisted. It is especially relevant for sensor nodes location in UWSNs. Global Positioning System (GPS) is not suitable for using in UWSNs because of the underwater propagation problems. Hence some localization algorithms based on the precise time synchronization between sensor nodes have been proposed which are not feasible for UWSNs. In this paper, we propose a localization algorithm called Two-Phase Time Synchronization-Free Localization Algorithm (TP-TSFLA). TP-TSFLA contains two phases, namely, range-based estimation phase and range-free evaluation phase. In the first phase, we address a time synchronization-free localization scheme base on the Particle Swarm Optimization (PSO) algorithm to decrease the localization error. In the second phase, we propose a Circle-based Range-Free Localization Algorithm (CRFLA) to locate the unlocalized sensor nodes which cannot obtain the location information through the first phase. In the second phase, sensor nodes which are localized in the first phase act as the new anchor nodes to help realize localization. Hence in this algorithm, we use a small number of mobile beacons to help achieve location without any other anchor nodes. Besides, to improve the precision of the range-free method, an extension of CRFLA by designing a coordinate adjustment scheme is updated. The simulation results show that TP-TSFLA can achieve a relative high localization ratio without time synchronization.

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
Keyword(s):  
Sensor Networks ◽  
Sensor Node ◽  
Three Dimensional ◽  
Mobile Sensor Networks ◽  
Sensor Nodes ◽  
Underwater Sensor Networks ◽  
Water Currents ◽  
Localization Scheme ◽  
Moving Direction ◽  
Gps Devices

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.

scholarly journals Hard Decision-Based Cooperative Localization for Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (21) ◽  
pp. 4665 ◽  
Author(s):  
Zhaoyang Wang ◽  
Xuebo Jin ◽  
Xiaoyi Wang ◽  
Jiping Xu ◽  
Yuting Bai
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Large Scale ◽  
Low Cost ◽  
Distance Estimation ◽  
Wireless Sensor ◽  
Cooperative Localization ◽  
Localization Accuracy ◽  
Range Free ◽  
Hard Decision

Reliable and accurate localization of objects is essential for many applications in wireless networks. Especially for large-scale wireless sensor networks (WSNs), both low cost and high accuracy are targets of the localization technology. However, some range-free methods cannot be combined with a cooperative method, because these range-free methods are characterized by low accuracy of distance estimation. To solve this problem, we propose a hard decision-based cooperative localization method. For distance estimation, an exponential distance calibration formula is derived to estimate distance. In the cooperative phase, the cooperative method is optimized by outlier constraints from neighboring anchors. Simulations are conducted to verify the effectiveness of the proposed method. The results show that localization accuracy is improved in different scenarios, while high node density or anchor density contributes to the localization. For large-scale WSNs, the hard decision-based cooperative localization is proved to be effective.

Research on the Bounding-Inbox Localization Algorithm for Wireless Sensor Networks Based on RSSI

2011 ◽  
Vol 135-136 ◽  
pp. 814-819
Author(s):  
Xue Cun Yang ◽  
Yuan Bin Hou ◽  
Ling Hong Kong
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Underground Mine ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Simulating Experiment ◽  
The People ◽  
Anchor Nodes ◽  
Range Free

Aimed at the people localization in the underground mine, the bounding-inbox localization algorithm of wireless sensor networks based on RSSI is presented in this paper, which combines the merits of range-based and range-free localization methods. And, signal strength information between fixed anchor nodes and unknown ones is taken as the weights of bounding-inbox algorithm to calculate. The result of simulating experiment in underground mine environment proves that this algorithm is of less computing cost and can improve the localization accuracy.

Improved DV-Hop Localization Scheme for Randomly Deployed WSNs

2020 ◽  
Vol 10 (1) ◽  
pp. 94-109 ◽  
Author(s):  
Rekha Goyat ◽  
Mritunjay Kumar Rai ◽  
Gulshan Kumar ◽  
Hye-Jin Kim ◽  
Se-Jung Lim
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Research Area ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Error ◽  
Anchor Nodes ◽  
Least Energy ◽  
Range Free

Background: Wireless Sensor Networks (WSNs) is considered one of the key research area in the recent. Various applications of WSNs need geographic location of the sensor nodes. Objective: Localization in WSNs plays an important role because without knowledge of sensor nodes location the information is useless. Finding the accurate location is very crucial in Wireless Sensor Networks. The efficiency of any localization approach is decided on the basis of accuracy and localization error. In range-free localization approaches, the location of unknown nodes are computed by collecting the information such as minimum hop count, hop size information from neighbors nodes. Methods: Although various studied have been done for computing the location of nodes but still, it is an enduring research area. To mitigate the problems of existing algorithms, a range-free Improved Weighted Novel DV-Hop localization algorithm is proposed. Main motive of the proposed study is to reduced localization error with least energy consumption. Firstly, the location information of anchor nodes is broadcasted upto M hop to decrease the energy consumption. Further, a weight factor and correction factor are introduced which refine the hop size of anchor nodes. Results: The refined hop size is further utilized for localization to reduces localization error significantly. The simulation results of the proposed algorithm are compared with other existing algorithms for evaluating the effectiveness and the performance. The simulated results are evaluated in terms localization error and computational cost by considering different parameters such as node density, percentage of anchor nodes, transmission range, effect of sensing field and effect of M on localization error. Further statistical analysis is performed on simulated results to prove the validation of proposed algorithm. A paired T-test is applied on localization error and localization time. The results of T-test depicts that the proposed algorithm significantly improves the localization accuracy with least energy consumption as compared to other existing algorithms like DV-Hop, IWCDV-Hop, and IDV-Hop. Conclusion: From the simulated results, it is concluded that the proposed algorithm offers 36% accurate localization than traditional DV-Hop and 21 % than IDV-Hop and 13% than IWCDV-Hop.

Multi-AUV Aided Cooperative 3D-localization for Underwater Sensor Networks

2020 ◽  
Vol 13 (1) ◽  
pp. 80-90 ◽  
Author(s):  
Meiyan Zhang ◽  
Wenyu Cai
Keyword(s):  
Sensor Networks ◽  
Mean Squared Error ◽  
Autonomous Underwater Vehicles ◽  
Estimation Method ◽  
Location Estimation ◽  
Underwater Sensor Networks ◽  
Coverage Ratio ◽  
Minimum Mean Squared Error ◽  
3D Localization ◽  
Localization Scheme

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.

SecRET

2021 ◽  
Vol 15 (1) ◽  
pp. 1-26
Author(s):  
Sudip Misra ◽  
Tamoghna Ojha ◽  
Madhusoodhanan P
Keyword(s):  
Sensor Networks ◽  
Error Rates ◽  
Location Information ◽  
Underwater Sensor Networks ◽  
Node Localization ◽  
Limited Bandwidth ◽  
Secure Localization ◽  
Localization Scheme ◽  
Monitoring Application ◽  
Fundamental Requirement

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.

Sign in / Sign up

Export Citation Format

Share Document