传感器网络:从基于拟阵基的依赖性分析到在线综合
Sensor Networks: from Dependence Analysis Via Matroid Bases to Online Synthesis
摘要:
考虑传感器选择和传感器融合这两个相关问题。在第一种情况下,给定一组传感器,人们希望识别传感器的子集,该子集虽然尺寸小,但捕获传感器收集的数据的本质。在第二种情况下,人们希望构建融合传感器,其利用来自传感器的数据(可能在丢弃依赖传感器之后),以创建比每个单独传感器更可靠的单个传感器。在这项工作中,我们严格定义的联合经验措施和增量解析传感器之间的依赖关系。我们表明,这些措施坚持多拟阵结构,这反过来又有利于传感器选择的有效算法的应用。我们建议一个随机和贪心算法的传感器选择。给定一个独立集,然后我们转向融合问题,并提出了一种新的指数加权算法的变体。在建议的算法中,一个竞争对一组增强的传感器,这使得它能够收敛到最好的融合传感器在一个家庭的传感器,而没有任何先验数据的传感器的性能。
英文摘要:
Consider the two related problems of sensor selection and sensor fusion. In the first, given a set of sensors, one wishes to identify a subset of the sensors, which while small in size, captures the essence of the data gathered by the sensors. In the second, one wishes to construct a fused sensor, which utilizes the data from the sensors (possibly after discarding dependent ones) in order to create a single sensor which is more reliable than each of the individual ones. In this work, we rigorously define the dependence among sensors in terms of joint empirical measures and incremental parsing. We show that these measures adhere to a polymatroid structure, which in turn facilitates the application of efficient algorithms for sensor selection. We suggest both a random and a greedy algorithm for sensor selection. Given an independent set, we then turn to the fusion problem, and suggest a novel variant of the exponential weighting algorithm. In the suggested algorithm, one competes against an augmented set of sensors, which allows it to converge to the best fused sensor in a family of sensors, without having any prior data on the sensors' performance.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。