TY - JOUR
T1 - DisLoc
T2 - A Convex Partitioning Based Approach for Distributed 3-D Localization in Wireless Sensor Networks
AU - Fan, Jin
AU - Hu, Yidan
AU - Luan, Tom H.
AU - Dong, Mianxiong
N1 - Publisher Copyright:
© 2001-2012 IEEE.
PY - 2017/12/15
Y1 - 2017/12/15
N2 - Accurate localization in wireless sensor networks (WSNs) is fundamental to many applications, such as geographic routing and position-aware data processing. This, however, is challenging in large scale 3-D WSNs due to the irregular topology, such as holes in the path, of the network. The irregular topology may cause overestimated Euclidean distance between nodes as the communication path is bent and accordingly introduces severe errors in 3-D WSN localization. As an effort towards the issue, this paper develops a distributed algorithm to achieve accurate 3-D WSN localization. Our proposal is composed of two steps, segmentation and joint localization. In specific, the entire network is first divided into several subnetworks by applying the approximate convex partitioning. A spatial convex node recognition mechanism is developed to assist the network segmentation, which relies on the connectivity information only. After that, each subnetwork is accurately localized by using the multidimensional scaling-based algorithm. The proposed localization algorithm also applies a new 3-D coordinate transformation algorithm, which helps reduce the errors introduced by coordinate integration between subnetworks and improve the localization accuracy. Using extensive simulations, we show that our proposal can effectively segment a complex 3-D sensor network and significantly improve the localization rate in comparison with existing solutions.
AB - Accurate localization in wireless sensor networks (WSNs) is fundamental to many applications, such as geographic routing and position-aware data processing. This, however, is challenging in large scale 3-D WSNs due to the irregular topology, such as holes in the path, of the network. The irregular topology may cause overestimated Euclidean distance between nodes as the communication path is bent and accordingly introduces severe errors in 3-D WSN localization. As an effort towards the issue, this paper develops a distributed algorithm to achieve accurate 3-D WSN localization. Our proposal is composed of two steps, segmentation and joint localization. In specific, the entire network is first divided into several subnetworks by applying the approximate convex partitioning. A spatial convex node recognition mechanism is developed to assist the network segmentation, which relies on the connectivity information only. After that, each subnetwork is accurately localized by using the multidimensional scaling-based algorithm. The proposed localization algorithm also applies a new 3-D coordinate transformation algorithm, which helps reduce the errors introduced by coordinate integration between subnetworks and improve the localization accuracy. Using extensive simulations, we show that our proposal can effectively segment a complex 3-D sensor network and significantly improve the localization rate in comparison with existing solutions.
KW - 3D wireless sensor networks
KW - Convex partition
KW - localization
UR - https://www.scopus.com/pages/publications/85040582485
U2 - 10.1109/JSEN.2017.2763155
DO - 10.1109/JSEN.2017.2763155
M3 - 文章
AN - SCOPUS:85040582485
SN - 1530-437X
VL - 17
SP - 8412
EP - 8423
JO - IEEE Sensors Journal
JF - IEEE Sensors Journal
IS - 24
M1 - 8068189
ER -