4,042 research outputs found
Color Filtering Localization for Three-Dimensional Underwater Acoustic Sensor Networks
Accurate localization for mobile nodes has been an important and fundamental
problem in underwater acoustic sensor networks (UASNs). The detection
information returned from a mobile node is meaningful only if its location is
known. In this paper, we propose two localization algorithms based on color
filtering technology called PCFL and ACFL. PCFL and ACFL aim at collaboratively
accomplishing accurate localization of underwater mobile nodes with minimum
energy expenditure. They both adopt the overlapping signal region of task
anchors which can communicate with the mobile node directly as the current
sampling area. PCFL employs the projected distances between each of the task
projections and the mobile node, while ACFL adopts the direct distance between
each of the task anchors and the mobile node. Also the proportion factor of
distance is proposed to weight the RGB values. By comparing the nearness
degrees of the RGB sequences between the samples and the mobile node, samples
can be filtered out. And the normalized nearness degrees are considered as the
weighted standards to calculate coordinates of the mobile nodes. The simulation
results show that the proposed methods have excellent localization performance
and can timely localize the mobile node. The average localization error of PCFL
can decline by about 30.4% than the AFLA method.Comment: 18 pages, 11 figures, 2 table
Localization Algorithms of Underwater Wireless Sensor Networks: A Survey
In Underwater Wireless Sensor Networks (UWSNs), localization is one of most important technologies since it plays a critical role in many applications. Motivated by widespread adoption of localization, in this paper, we present a comprehensive survey of localization algorithms. First, we classify localization algorithms into three categories based on sensor nodesā mobility: stationary localization algorithms, mobile localization algorithms and hybrid localization algorithms. Moreover, we compare the localization algorithms in detail and analyze future research directions of localization algorithms in UWSNs
Wireless Sensor Networks for Underwater Localization: A Survey
Autonomous Underwater Vehicles (AUVs) have widely deployed in marine investigation and ocean exploration in recent years. As the fundamental information, their position information is not only for data validity but also for many real-world applications. Therefore, it is critical for the AUV to have the underwater localization capability. This report is mainly devoted to outline the recent advance- ment of Wireless Sensor Networks (WSN) based underwater localization. Several classic architectures designed for Underwater Acoustic Sensor Network (UASN) are brie y introduced. Acoustic propa- gation and channel models are described and several ranging techniques are then explained. Many state-of-the-art underwater localization algorithms are introduced, followed by the outline of some existing underwater localization systems
Coverage and Connectivity in Three-Dimensional Networks
Most wireless terrestrial networks are designed based on the assumption that
the nodes are deployed on a two-dimensional (2D) plane. However, this 2D
assumption is not valid in underwater, atmospheric, or space communications. In
fact, recent interest in underwater acoustic ad hoc and sensor networks hints
at the need to understand how to design networks in 3D. Unfortunately, the
design of 3D networks is surprisingly more difficult than the design of 2D
networks. For example, proofs of Kelvin's conjecture and Kepler's conjecture
required centuries of research to achieve breakthroughs, whereas their 2D
counterparts are trivial to solve. In this paper, we consider the coverage and
connectivity issues of 3D networks, where the goal is to find a node placement
strategy with 100% sensing coverage of a 3D space, while minimizing the number
of nodes required for surveillance. Our results indicate that the use of the
Voronoi tessellation of 3D space to create truncated octahedral cells results
in the best strategy. In this truncated octahedron placement strategy, the
transmission range must be at least 1.7889 times the sensing range in order to
maintain connectivity among nodes. If the transmission range is between 1.4142
and 1.7889 times the sensing range, then a hexagonal prism placement strategy
or a rhombic dodecahedron placement strategy should be used. Although the
required number of nodes in the hexagonal prism and the rhombic dodecahedron
placement strategies is the same, this number is 43.25% higher than the number
of nodes required by the truncated octahedron placement strategy. We verify by
simulation that our placement strategies indeed guarantee ubiquitous coverage.
We believe that our approach and our results presented in this paper could be
used for extending the processes of 2D network design to 3D networks.Comment: To appear in ACM Mobicom 200
- ā¦