TY - JOUR
T1 - A Novel Localization Approach for Irregular Wireless Sensor Networks Based on Anchor Segmentation
AU - Wang, Jing
AU - Cheng, Li
AU - Tu, Yuanfei
AU - Gu, Shenkai
N1 - Publisher Copyright:
© 2001-2012 IEEE.
PY - 2022/4/1
Y1 - 2022/4/1
N2 - Source localization has been a crucial fundamental service in wireless sensor networks (WSNs). Existing algorithms assume a regular region or controlled deployment. In practice, however, irregular network topologies often occurs, which greatly downgrade the localization performance. In this paper, we propose a new distributed localization approach based on Anchor Segmentation and Projection for Irregular networks (ASPI). The new framework is composed of three phases: anchor segmentation boarder construction, convex hull identification and projection-based localization. An anchor based network approximate convex segmentation method is proposed to reduce the consumption of network resources in the first two phases and an improved giftwrapping based convex hull identification method is provided to reduce the complexity. In the localization phase, we formulate the localization as a convex feasibility problem to avoid the multimodality in Maximum likelihood techniques and an alternative procedure is provided for inconsistent situation in the projection-based scheme. Experiments are conducted and the results demonstrate that our algorithm outperforms other existing solutions in irregular-shaped networks in higher accuracy with low complexity.
AB - Source localization has been a crucial fundamental service in wireless sensor networks (WSNs). Existing algorithms assume a regular region or controlled deployment. In practice, however, irregular network topologies often occurs, which greatly downgrade the localization performance. In this paper, we propose a new distributed localization approach based on Anchor Segmentation and Projection for Irregular networks (ASPI). The new framework is composed of three phases: anchor segmentation boarder construction, convex hull identification and projection-based localization. An anchor based network approximate convex segmentation method is proposed to reduce the consumption of network resources in the first two phases and an improved giftwrapping based convex hull identification method is provided to reduce the complexity. In the localization phase, we formulate the localization as a convex feasibility problem to avoid the multimodality in Maximum likelihood techniques and an alternative procedure is provided for inconsistent situation in the projection-based scheme. Experiments are conducted and the results demonstrate that our algorithm outperforms other existing solutions in irregular-shaped networks in higher accuracy with low complexity.
KW - Convex feasibility problem
KW - Convex segmentation
KW - Wireless sensor networks
UR - http://www.scopus.com/inward/record.url?scp=85123378847&partnerID=8YFLogxK
U2 - 10.1109/JSEN.2022.3143826
DO - 10.1109/JSEN.2022.3143826
M3 - 文章
AN - SCOPUS:85123378847
SN - 1530-437X
VL - 22
SP - 7267
EP - 7276
JO - IEEE Sensors Journal
JF - IEEE Sensors Journal
IS - 7
ER -