TY - JOUR
T1 - Multi-hop localization algorithm for large-scale underwater wireless sensor networks
AU - Ren, Yongji
AU - Yu, Ning
AU - Wang, Xiao
AU - Wu, Yinfeng
AU - Wan, Jiangwen
PY - 2012/6
Y1 - 2012/6
N2 - Although localization has been widely studied for terrestrial Wireless Sensor Networks (WSNs), the adverse aqueous environments, the harsh acoustic communications, and the large network scale all pose new challenges for Underwater WSNs (UWSNs) and make it necessary to develop new localization algorithms. In this paper, we propose a novel Multi-Hop Localization Algorithm (MHLA) for large-scale UWSNs. First, we transform the three dimensional (3D) localization problem into its two dimensional (2D) counterpart by employing node depth information and a simple projection technique. Then, we construct a weighted constrained multi-hop localization model. Next, based on the geometric constraint relationship between nodes, the bounding square rings of to-be-localized nodes are designed to estimate the feasible region. Finally, we search the close to the optimal values of nodes' coordinates through a lightweight grid-scanning procedure. Simulation results show that our scheme can achieve high localization accuracy with low computational complexity in large-scale UWSNs.
AB - Although localization has been widely studied for terrestrial Wireless Sensor Networks (WSNs), the adverse aqueous environments, the harsh acoustic communications, and the large network scale all pose new challenges for Underwater WSNs (UWSNs) and make it necessary to develop new localization algorithms. In this paper, we propose a novel Multi-Hop Localization Algorithm (MHLA) for large-scale UWSNs. First, we transform the three dimensional (3D) localization problem into its two dimensional (2D) counterpart by employing node depth information and a simple projection technique. Then, we construct a weighted constrained multi-hop localization model. Next, based on the geometric constraint relationship between nodes, the bounding square rings of to-be-localized nodes are designed to estimate the feasible region. Finally, we search the close to the optimal values of nodes' coordinates through a lightweight grid-scanning procedure. Simulation results show that our scheme can achieve high localization accuracy with low computational complexity in large-scale UWSNs.
KW - Grid-scanning
KW - Multi-hop localization
KW - Projection
KW - Three dimensional
KW - Underwater wireless sensor networks
UR - https://www.scopus.com/pages/publications/84862898954
U2 - 10.4156/ijact.vol4.issue10.34
DO - 10.4156/ijact.vol4.issue10.34
M3 - 文章
AN - SCOPUS:84862898954
SN - 2005-8039
VL - 4
SP - 289
EP - 296
JO - International Journal of Advancements in Computing Technology
JF - International Journal of Advancements in Computing Technology
IS - 10
ER -