arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2307.00840eess.SP
收藏

异构传感器的贪心选择

Greedy Selection for Heterogeneous Sensors

Kaushani Majumder, SibiRaj B. Pillai, Satish Mulleti

AI总结:

针对异构传感器网络中每组选择数量先验已知的问题,提出联合贪心选择算法,最差性能为最优的50%,双网络场景可达63%,实验误差降低4-10 dB。

摘要:

大规模传感器网络中所有传感器同时运行会消耗大量功率且计算成本高昂。因此,选择较少的传感器是可取的。在均匀网络中,贪心算法被广泛用于传感器选择,当优化子模度量时,其理论最差性能为最优性能的(1-1/e)约63%。对于由多组传感器组成的异构传感器网络(HSNs),大多数现有的传感器选择方法在所选传感器总价值的预算约束下优化性能。然而,在许多应用中,从每组中选择的传感器数量是先验已知的,而解决方案尚未得到充分探索。针对此问题,我们提出了一种联合贪心异构传感器选择算法。理论上,我们证明了所提算法在子模成本度量下的最差性能被限制在最优解的50%。在具有两个传感器网络的HSNs特殊情况下,当从一组中选择的传感器数量远小于另一组时,性能保证可提高到63%。为了通过实验验证我们的结果,我们提出了一种基于帧势测度的子模度量,该度量同时考虑了传感器测量之间的相关性及其异构性。当使用该性能度量时,我们证明了解决方案均方误差的理论界。我们通过仿真实验验证了我们的结果,考虑了受加性噪声和量化误差影响的线性和非线性测量模型。我们的实验表明,所提算法比现有方法的误差低4-10 dB。

英文摘要:

Simultaneous operation of all sensors in a large-scale sensor network is power-consuming and computationally expensive. Hence, it is desirable to select fewer sensors. A greedy algorithm is widely used for sensor selection in homogeneous networks with a theoretical worst-case performance of (1-1/e) ~ 63% of the optimal performance when optimizing submodular metrics. For heterogeneous sensor networks (HSNs) comprising multiple sets of sensors, most of the existing sensor selection methods optimize the performance constrained by a budget on the total value of the selected sensors. However, in many applications, the number of sensors to select from each set is known apriori, and solutions are not well-explored. For this problem, we propose a joint greedy heterogeneous sensor selection algorithm. Theoretically, we show that the worst-case performance of the proposed algorithm is bounded to 50% of the optimum for submodular cost metrics. In the special case of HSNs with two sensor networks, the performance guarantee can be improved to 63% when the number of sensors to select from one set is much smaller than the other. To validate our results experimentally, we propose a submodular metric based on the frame potential measure that considers both the correlation among the sensor measurements and their heterogeneity. We prove theoretical bounds for the mean squared error of the solution when this performance metric is used. We validate our results through simulation experiments considering both linear and non-linear measurement models corrupted by additive noise and quantization errors. Our experiments show that the proposed algorithm results in 4-10 dB lower error than existing methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑