A Review and Analysis of Localization Techniques in Underwater Wireless Sensor Networks

In recent years,there has been a rapid growth in Underwater Wireless Sensor Networks(UWSNs).The focus of research in this area is now on solving the problems associated with large-scale UWSN.One of the major issues in such a network is the localization of underwater nodes.Localization is required for tracking objects and detecting the target.It is also considered tagging of data where sensed contents are not found of any use without localization.This is useless for application until the position of sensed content is confirmed.This article’s major goal is to review and analyze underwater node localization to solve the localization issues in UWSN.The present paper describes various existing localization schemes and broadly categorizes these schemes as Centralized and Distributed localization schemes underwater.Also,a detailed subdivision of these localization schemes is given.Further,these localization schemes are compared from different perspectives.The detailed analysis of these schemes in terms of certain performance metrics has been discussed in this paper.At the end,the paper addresses several future directions for potential research in improving localization problems of UWSN.

A Three-Dimensional Range-Free Localization Algorithm Based on Mobile Beacons for Wireless Sensor Networks

In wireless sensor networks （WSNs） the position information of individual nodes is a matter of vital importance because allows the implementation of necessary network functions such as routing, querying and other applications. The objective of this paper is to propose an algorithm of three-dimensional distributed range-free localization for WSNs, using a mobile beacon （MB） equipped with a rotary and tilting directional antenna. This algorithm, denominated as the three-dimensional azimuthally defined area localization algorithm （3D- ADAL）, is executed in each sensor node and is based only on the analysis of the information received from the MB, therefore is energy efficient and contributes to extend the lifetime of the sensor network. Additionally the proposed algorithm has the advantage of being simple and economical. The simulation results show that the proposed algorithm is a practical, effective and accurate method for a three-dimensional location of sensor nodes in a WSN.

A Systematic Overview of Underwater Wireless Sensor Networks:Applications,Challenge and Research Perspectives

Underwater Wireless Sensor Networks(UWSNs)are becoming increasingly popular in marine applications due to advances in wireless and microelectronics technology.However,UWSNs present challenges in processing,energy,and memory storage due to the use of acoustic waves for communication,which results in long delays,significant power consumption,limited bandwidth,and packet loss.This paper provides a comprehensive review of the latest advancements in UWSNs,including essential services,common platforms,critical elements,and components such as localization algorithms,communication,synchronization,security,mobility,and applications.Despite significant progress,reliable and flexible solutions are needed to meet the evolving requirements of UWSNs.The purpose of this paper is to provide a framework for future research in the field of UWSNs by examining recent advancements,establishing a standard platform and service criteria,using a taxonomy to determine critical elements,and emphasizing important unresolved issues.

Privacy Preserving Solution for the Asynchronous Localization of Underwater Sensor Networks

Location estimation of underwater sensor networks(USNs)has become a critical technology,due to its fundamental role in the sensing,communication and control of ocean volume.However,the asynchronous clock,security attack and mobility characteristics of underwater environment make localization much more challenging as compared with terrestrial sensor networks.This paper is concerned with a privacy-preserving asynchronous localization issue for USNs.Particularly,a hybrid network architecture that includes surface buoys,anchor nodes,active sensor nodes and ordinary sensor nodes is constructed.Then,an asynchronous localization protocol is provided,through which two privacy-preserving localization algorithms are designed to estimate the locations of active and ordinary sensor nodes.It is worth mentioning that,the proposed localization algorithms reveal disguised positions to the network,while they do not adopt any homomorphic encryption technique.More importantly,they can eliminate the effect of asynchronous clock,i.e.,clock skew and offset.The performance analyses for the privacy-preserving asynchronous localization algorithms are also presented.Finally,simulation and experiment results reveal that the proposed localization approach can avoid the leakage of position information,while the location accuracy can be significantly enhanced as compared with the other works.

Grid-Based Localization Mechanism with Mobile Reference Node in Wireless Sensor Networks

Wireless sensor networks （WSNs） are based on monitoring or managing the sensing area by using the location information with sensor nodes. Most sensor nodes require hardware support or receive packets with location information to estimate their locations, which needs lots of time or costs. In this paper we proposed a localization mechanism using a mobile reference node （MRN） and trilateration in WSNs to reduce the energy consumption and location error. The simulation results demonstrate that the proposed mechanism can obtain more unknown nodes locations by the mobile reference node moving scheme and will decreases the energy consumption and average ocation error.

EXTENDED MONTE CARLO LOCALIZATION ALGORITHM FOR MOBILE SENSOR NETWORKS

A real-world localization system for wireless sensor networks that adapts for mobility and irregular radio propagation model is considered. The traditional range-based techniques and recent range-free localization schemes are not well competent for localization in mobile sensor networks, while the probabilistic approach of Bayesian filtering with particle-based density representations provides a comprehensive solution to such localization problem. Monte Carlo localization is a Bayesian filtering method that approximates the mobile node's location by a set of weighted particles. In this paper, an enhanced Monte Carlo localization algorithm-Extended Monte Carlo Localization (Ext-MCL) is proposed, i.e., the traditional Monte Carlo localization algorithm is improved and extended to make it suitable for the practical wireless network environment where the radio propagation model is irregular. Simulation results show the proposal gets better localization accuracy and higher localizable node number than previously proposed Monte Carlo localization schemes not only for ideal radio model, but also for irregular one.

New Localization Technique for Mobile Wireless Sensor Networks Using Sectorized Antenna

Recently, there has been much focus on mobile sensor networks, and we have even seen the development of small-profile sensing devices that are able to control their own movement. Although it has been shown that mobility alleviates several issues relating to sensor network coverage and connectivity, many challenges remain. Among these, the need for position estimation is perhaps the most important. It is too expensive to include a GPS receiver with every sensor node. Hence, localization schemes for sensor networks typically use a small number of seed nodes that know their location and protocols whereby other sensor nodes estimate their location from the messages they receive. In this paper, we propose a new technique to localize mobile sensor nodes using sectorized antenna. We consider that both sensor nodes and seeds are mobile, and argue that mobility can be exploited to improve the accuracy and precision of localization. It is tested extensively in a simulation environment and compared with other existing methods. The results of our experiments clearly indicate that our proposed approach can achieve a high accuracy without need of high density of seeds.

3-D Grid-Based Localization Technique in Mobile Sensor Networks

Considering the environmental protection, forest fire becomes a more and more serious problem and requires more concerns. This paper provides an efficient method for fire monitoring and detection in forests using wireless sensor network technology. The proposed technique estimates the location of a sensor node based on the current set of hop-count values, which are collected through the anchor nodes’ broadcast. Our algorithm incorporates two salient features;grid-based output and event-triggering mechanism, to improve the accuracy while reducing the power consumption. Through the computer simulation, the output region obtained from our algorithm can always cover the target node. In addition, the algorithm was implemented and tested with a set of Crossbow sensors. Experimental results demonstrated the high feasibility and worked well in real environment.

A Survey of Ranging Algorithms and Localization Schemes in Underwater Acoustic Sensor Network

Underwater Acoustic Sensor Network(UASN) has attracted significant attention because of its great influence on ocean exploration and monitoring. On account of the unique characteristics of underwater environment, localization, as one of the fundamental tasks in UASNs, is a more challenging work than in terrestrial sensor networks. A survey of the ranging algorithms and the network architectures varied with different applications in UASNs is provided in this paper. Algorithms used to estimate the coordinates of the UASNs nodes are classified into two categories: rangebased and range-free. In addition, we analyze the architectures of UASNs based on different applications, and compare their performances from the aspects of communication cost, accuracy, coverage and so on. Open research issues which would affect the accuracy of localization are also discussed, including MAC protocols, sound speed and time synchronization.

A New Distributed Localization Scheme for Wireless Sensor Networks

在无线传感器网络(WSN ) 的节点本地化是被对待一功能目标在纸从一个新奇观点追踪双。与在 WSN 的传统的追踪问题不同，使用静态的地点商品节点估计动人的目标，活动节点被用来帮助未知节点精确地发现他们的位置。一个新节点本地化计划虚拟烽火精力比率本地化(VB-ERL ) 和它为 WSN 的精炼被介绍。在计划，活动节点基于 Gauss-Markov 活动性模型搬到监视者地并且周期性地广播信息包。每个静态的未知节点在它的察觉到的范围收到虚拟烽火和精力，并且由发现一套超球面的交叉估计它的地点。模拟结果证明建议计划是有效的。

Localized Coverage Connectivity Based on Shape and Area Using Mobile Sensor Robots in Wireless Sensor Networks

A wireless sensor network (WSN) is spatially distributing independent sensors to monitor physical and environmental characteristics such as temperature, sound, pressure and also provides different applications such as battlefield inspection and biological detection. The Constrained Motion and Sensor (CMS) Model represents the features and explain k-step reach ability testing to describe the states. The description and calculation based on CMS model does not solve the problem in mobile robots. The ADD framework based on monitoring radio measurements creates a threshold. But the methods are not effective in dynamic coverage of complex environment. In this paper, a Localized Coverage based on Shape and Area Detection (LCSAD) Framework is developed to increase the dynamic coverage using mobile robots. To facilitate the measurement in mobile robots, two algorithms are designed to identify the coverage area, (i.e.,) the area of a coverage hole or not. The two algorithms are Localized Geometric Voronoi Hexagon (LGVH) and Acquaintance Area Hexagon (AAH). LGVH senses all the shapes and it is simple to show all the boundary area nodes. AAH based algorithm simply takes directional information by locating the area of local and global convex points of coverage area. Both these algorithms are applied to WSN of random topologies. The simulation result shows that the proposed LCSAD framework attains minimal energy utilization, lesser waiting time, and also achieves higher scalability, throughput, delivery rate and 8% maximal coverage connectivity in sensor network compared to state-of-art works.

Cooperative Nodes Localization for Three-Dimensional Underwater Wireless Sensor Network Based on Weighted Centroid Localization Algorithm

The underwater wireless sensor network(UWSN) has the features of mobility by drifting,less beacon nodes,longer time for localization and more energy consumption than the terrestrial sensor networks,which makes it more difficult to locate the nodes in marine environment.Aiming at the characteristics of UWSN,a kind of cooperative range-free localization method based on weighted centroid localization(WCL) algorithm for three-dimensional UWSN is proposed.The algorithm assigns the cooperative weights for the beacon nodes according to the received acoustic signal strength,and uses the located unknown nodes as the new beacon nodes to locate the other unknown nodes,so a fast localization can be achieved for the whole sensor networks.Simulation results indicate this method has higher localization accuracy than the centroid localization algorithm,and it needs less beacon nodes and achieves higher rate of effective localization.

Energy-Efficient Mobile Data Collection Adopting Node Cooperation in an Underwater Acoustic Sensor Network

This paper considers an underwater acoustic sensor network with one mobile surface node to collect data from multiple underwater nodes,where the mobile destination requests retransmission from each underwater node individually employing traditional automatic-repeat-request(ARQ) protocol.We propose a practical node cooperation(NC) protocol to enhance the collection efficiency,utilizing the fact that underwater nodes can overhear the transmission of others.To reduce the source level of underwater nodes,the underwater data collection area is divided into several sub-zones,and in each sub-zone,the mobile surface node adopting the NC protocol could switch adaptively between selective relay cooperation(SRC) and dynamic network coded cooperation(DNC) .The difference of SRC and DNC lies in whether or not the selected relay node combines the local data and the data overheard from undecoded node(s) to form network coded packets in the retransmission phase.The NC protocol could also be applied across the sub-zones due to the wiretap property.In addition,we investigate the effects of different mobile collection paths,collection area division and cooperative zone design for energy saving.The numerical results showthat the proposed NC protocol can effectively save energy compared with the traditional ARQ scheme.

Hierarchical self-localization of underwater wireless sensor network nodes

The follow-up application of underwater wireless sensor network is influenced by accuracy of self-localization of nodes. The self-localization of nodes is discussed in this paper. First of all, nodes of underwater wireless sensor network are classified into several levels according to the accuracy of position of nodes and the levels are from the first to the fifth in accordance with accuracy of nodes from high to low respectively. Secondly, the level of anchor nodes can be known by those unknown nodes from the information given by the anchor nodes themselves, At the same time the unknown nodes are able to be located in the area controlled by the first level of anchor nodes that are as the aggregation. Then the positioning algorithm is designed correspondingly in accordance with the accuracy level of nodes. Finally, the positioning algorithm is simulated and analyzed. The result shows that the unknown nodes can be located effectively by hierarchical control.

A survey on sensor localization

Localization is one of the fundamental problems in wireless sensor networks （WSNs）, since locations of the sensor nodes are critical to both network operations and most application level tasks. Although the GPS based localization schemes can be used to determine node locations within a few meters, the cost of GPS devices and non-availability of GPS signals in confined environments prevent their use in large scale sensor networks. There exists an extensive body of research that aims at obtaining locations as well as spatial relations of nodes in WSNs without requiring specialized hardware and/or employing only a limited number of anchors that are aware of their own locations. In this paper, we present a comprehensive survey on sensor localization in WSNs covering motivations, problem formulations, solution approaches and performance summary. Future research issues will also be discussed.

Three-Dimensional Ocean Sensor Networks:A Survey

The past decade has seen a growing interest in ocean sensor networks because of their wide applications in marine research,oceanography,ocean monitoring,offshore exploration,and defense or homeland security.Ocean sensor networks are generally formed with various ocean sensors,autonomous underwater vehicles,surface stations,and research vessels.To make ocean sensor network applications viable,efficient communication among all devices and components is crucial.Due to the unique characteristics of underwater acoustic channels and the complex deployment environment in three dimensional(3D) ocean spaces,new efficient and reliable communication and networking protocols are needed in design of ocean sensor networks.In this paper,we aim to provide an overview of the most recent advances in network design principles for 3D ocean sensor networks,with focuses on deployment,localization,topology design,and position-based routing in 3D ocean spaces.

3DT-PP:localization and path planning of mobile anchors over complex 3D terrains

Mobile anchors are widely used for localization in WSNs.However,special properties over 3D terrains limit the implementation of them.In this paper,a novel 3D localization algorithm is proposed,called 3 DT-PP,which utilizes path planning of mobile anchors over complex 3 D terrains,and simulations based upon the model of mountain surface network are conducted.The simulation results show that the algorithm decreases the position error by about 91%,8.7%and lowers calculation overhead by about 75%,1.3%,than the typical state-of-the-art localization algorithm(i.e.,'MDS-MAP','Landscape-3D').Thus,our algorithm is more potential in practical WSNs which are the characteristic of limited energy and 3D deployment.

Designing reduced beacon trajectory for sensor localization

Localization is one of the substantial issues in wireless sensor networks. The key problem for the mobile beacon localization is how to choose the appropriate beacon trajectory. However, little research has been done on it. In this paper, firstly, we deduce the number of positions for a beacon to send a packet according to the acreage of ROI (region of interest); and next we present a novel method based on virtual force to arrange the positions in arbitrary ROI; then we apply TSP (travelling salesman problem) algorithm to the positions sequence to obtain the optimal touring path, i.e. the reduced beacon trajectory. When a mobile beacon moves along the touring path, sending RF signals at every position, the sensors in ROI can work out their position with trilateration. Experimental results demonstrate that the localization method, based on the beacon reduced path, is efficient and has flexible accuracy.

MPLPK:A mobile path localization protocol based on key nodes

To alleviate the localization error introduced by irregular sensor network deployment,a new mobile path localization based on key nodes(MPLPK) protocol is proposed.It can recognize all concave/convex nodes in the network as fixed anchor nodes,and simplify the following localization process based on these key nodes.The MPLPK protocol is composed of three steps.After all key nodes are found in the network,a mobile node applying improved minimum spanning tree(MST)algorithm is introduced to traverse and locate them.By taking the concave/convex nodes as anchors,the complexity of the irregular network can be degraded.And the simulation results demonstrate that MPLPK has 20%to 40%accuracy improvements than connectivity-based and anchor-free three-dimensional localization(CATL) and approximate convex decomposition based localization(ACDL).