Solving Minimum Cost Three-Dimensional Localization Problem in Ocean Sensor Networks

Chao Zhang, Yingjian Liu, Zhongwen Guo and Yu Wang

International Journal of Distributed Sensor Networks, 2014, vol. 10, issue 5, 452718

Abstract: 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.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1155/2014/452718 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:10:y:2014:i:5:p:452718

DOI: 10.1155/2014/452718

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().