4.8 Article

Optimizing Anchor Node Deployment for Fingerprint Localization With Low-Cost and Coarse-Grained Communication Chips

期刊

IEEE INTERNET OF THINGS JOURNAL
卷 9, 期 16, 页码 15297-15311

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JIOT.2022.3148198

关键词

Location awareness; Wireless communication; Wireless sensor networks; Optimization; Estimation; Computational complexity; Receivers; Deployment optimization; minimum attribute reduction; wireless indoor positioning (WIP)

资金

  1. NSFC Major Project [71991460]
  2. NSFC [61874120]
  3. Project of Guangxi Natural Science Foundation [2019JJA170064]
  4. Science and Technology Innovation Program of Hunan Province [2020SK2026]
  5. Scientific Research Fund of Hunan Provincial Education Department [19A278]
  6. NSERC Discovery [341548]

向作者/读者索取更多资源

This article discusses the optimal anchor node deployment problem for fingerprint localization in wireless indoor positioning systems using off-the-shelf communication chips. Two deployment algorithms, ANDAs and WANDA, are proposed to minimize the number of anchor nodes while satisfying adaptive localization precision, unique fingerprint, and other requirements. Simulation and experimental results show the effectiveness and superiority of ANDA and WANDA.
A part of off-the-shelf wireless communication chips can only provide very coarse-grained information of the distance range between the transmitter and receiver. Exploiting such chips for precise wireless indoor positioning (WIP) becomes very valuable since their costs are comparatively low. For the WIP systems built on the coarse-grained communication chips, this article discusses the optimal anchor node deployment problem for fingerprint localization. The problem is very challenging since it implies three particularly important requirements of adaptive localization precision, unique fingerprint, and a minimum number of anchor nodes. To minimize the required number of anchor nodes while satisfying the three requirements, we propose two anchor node deployment algorithms, namely, ANDAs and WANDA, both of which are developed for mediate and large-area deployment, respectively. We first prove the effectiveness of the chip in maintaining robust fingerprints and formulate the deployment optimization problem as a minimum attribute reduction problem. Then, to deal with the high computational complexity involved, ANDA is proposed by significantly reducing the search space of the optimization problem. To practically address the combination explosion problem for large-area deployment, the idea of area partitioning is adopted. Investigating anchor nodes at different grid vertices in subareas that may have different sharing degrees, WANDA is proposed to achieve an overall anchor node deployment optimization. Simulation and experimental results demonstrate the validity and the superiority of ANDA and WANDA over counterparts. For large-area deployment, compared to ANDA, WANDA can further decrease the total amount of anchor nodes by 17%.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据