Effective Sensors Deployment with Localization Accuracy Constraints

Effective Sensors Deployment with Localization Accuracy Constraints
复制标题

DOI:
10.1109/cse.2014.110
复制
发表时间:
2014-12
期刊:
2014 IEEE 17th International Conference on Computational Science and Engineering
影响因子:
--
通讯作者:
Riming Wang;Jiu-chao Feng
Riming Wang;Jiu-chao Feng
中科院分区:
其他
文献类型:
--
作者:
Riming Wang;Jiu-chao Feng

文献摘要

被引文献

相似文献

在无线定位问题中,在传感器网络实现之前,需要知道在给定定位精度约束条件下,即在1-c的置信水平下,要保证定位误差小于em,那么(1)最多和最少需要多少个已知位置的传感器(锚点)?(2)如何从可用的位置中为这些锚点选择最佳位置,以便在成本和定位性能之间获得良好的权衡?本文基于接收信号强度(RSS)测量对这两个问题进行了详细的研究,这有助于有效地放置锚点,减少网络安装的工作量。首先在锚点均匀随机分布的假设下,推导并验证了锚点的最小数目(至少锚点)和最大数目(最多锚点),然后将最优选择问题转化为一个二次规划问题,并进行了有效求解.数值结果验证了所提方法的有效性。
In wireless localization problems, prior to the implementation of the sensor networks, it is important and valuable to know that, given the localization accuracy constraints, i.e. To ensure the localization error lower than e m at the confidence level of 1-c, then (1) how many location-known sensors (anchors) needed at least and at most? (2) how to select out optimal locations for these anchors from the available locations in order to obtain a good trade off between cost and localization performance? These two questions are investigated in detail in this paper based on received signal strength (RSS) measurements, which help to place anchors effectively and reduce much effort in networks installation. The minimal number of anchors (anchors at least) and the sufficient number of anchors (anchors at most) are derived and validated under the assumption of uniformly and randomly distribution of anchors at first, then the optimal selection problem is formulated as a quadratic programming (QP) problem, which can be solved effectively. Numerical results demonstrated the validity of the proposed methods.