Solving Minimum Cost Three-Dimensional Localization Problem in Ocean Sensor Networks
Localization is one of the most fundamental problems in wireless sensor networks (including ocean sensor networks). Current localization algorithms mainly focus on how to localize as many sensors as possible given a set of mobile or static anchor nodes and distance measurements. In this paper, we co...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-05-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2014/452718 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849701796810850304 |
|---|---|
| author | Chao Zhang Yingjian Liu Zhongwen Guo Yu Wang |
| author_facet | Chao Zhang Yingjian Liu Zhongwen Guo Yu Wang |
| author_sort | Chao Zhang |
| collection | DOAJ |
| description | Localization is one of the most fundamental problems in wireless sensor networks (including ocean sensor networks). Current localization algorithms mainly focus on how to localize as many sensors as possible given a set of mobile or static anchor nodes and distance measurements. In this paper, we consider an optimization problem, the minimum cost three-dimensional (3D) localization problem , in an ocean sensor network, which aims to localize all underwater sensors using the minimum number of anchor nodes or the minimum travel distance of the surface vessel which deploys and measures the anchors. Given the hardness of 3D localization, we propose a set of greedy methods to pick the anchor set and its visiting sequence. Aiming at minimizing the localization errors, we also adopt a confidence-based approach for all proposed methods to deal with noisy ranging measurements (which is very common in ocean sensor networks) and possible flip ambiguity. Our simulation results demonstrate the efficiency of all proposed methods. |
| format | Article |
| id | doaj-art-261e4bd88029446fa5d18c0274aecb6e |
| institution | DOAJ |
| issn | 1550-1477 |
| language | English |
| publishDate | 2014-05-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-261e4bd88029446fa5d18c0274aecb6e2025-08-20T03:17:51ZengWileyInternational Journal of Distributed Sensor Networks1550-14772014-05-011010.1155/2014/452718452718Solving Minimum Cost Three-Dimensional Localization Problem in Ocean Sensor NetworksChao Zhang0Yingjian Liu1Zhongwen Guo2Yu Wang3 Department of Computer Science, University of North Carolina at Charlotte, 9201 University City Boulevard, Charlotte, NC 28223, USA Department of Computer Science and Technology, Ocean University of China, 238 Songling Road, Qingdao 266100, China Department of Computer Science and Technology, Ocean University of China, 238 Songling Road, Qingdao 266100, China Department of Computer Science, University of North Carolina at Charlotte, 9201 University City Boulevard, Charlotte, NC 28223, USALocalization is one of the most fundamental problems in wireless sensor networks (including ocean sensor networks). Current localization algorithms mainly focus on how to localize as many sensors as possible given a set of mobile or static anchor nodes and distance measurements. In this paper, we consider an optimization problem, the minimum cost three-dimensional (3D) localization problem , in an ocean sensor network, which aims to localize all underwater sensors using the minimum number of anchor nodes or the minimum travel distance of the surface vessel which deploys and measures the anchors. Given the hardness of 3D localization, we propose a set of greedy methods to pick the anchor set and its visiting sequence. Aiming at minimizing the localization errors, we also adopt a confidence-based approach for all proposed methods to deal with noisy ranging measurements (which is very common in ocean sensor networks) and possible flip ambiguity. Our simulation results demonstrate the efficiency of all proposed methods.https://doi.org/10.1155/2014/452718 |
| spellingShingle | Chao Zhang Yingjian Liu Zhongwen Guo Yu Wang Solving Minimum Cost Three-Dimensional Localization Problem in Ocean Sensor Networks International Journal of Distributed Sensor Networks |
| title | Solving Minimum Cost Three-Dimensional Localization Problem in Ocean Sensor Networks |
| title_full | Solving Minimum Cost Three-Dimensional Localization Problem in Ocean Sensor Networks |
| title_fullStr | Solving Minimum Cost Three-Dimensional Localization Problem in Ocean Sensor Networks |
| title_full_unstemmed | Solving Minimum Cost Three-Dimensional Localization Problem in Ocean Sensor Networks |
| title_short | Solving Minimum Cost Three-Dimensional Localization Problem in Ocean Sensor Networks |
| title_sort | solving minimum cost three dimensional localization problem in ocean sensor networks |
| url | https://doi.org/10.1155/2014/452718 |
| work_keys_str_mv | AT chaozhang solvingminimumcostthreedimensionallocalizationprobleminoceansensornetworks AT yingjianliu solvingminimumcostthreedimensionallocalizationprobleminoceansensornetworks AT zhongwenguo solvingminimumcostthreedimensionallocalizationprobleminoceansensornetworks AT yuwang solvingminimumcostthreedimensionallocalizationprobleminoceansensornetworks |