This paper considers a set of sensors, which as a group are tasked with taking measurements of the environment and sending a small subset of the measurements to a centralized data fusion center, where the measurements will be used to estimate the overall state of the environment. The sensors' goal is to send the most informative set of measurements so that the estimate is as accurate as possible. This problem is formulated as a submodular maximization problem, for which there exists a well-studied greedy algorithm, where each sensor sequentially chooses a set of measurements from its own local set, and communicates its decision to the future sensors in the sequence. In this work, sensors can additionally share measurements with one another, in order to augment the decision set of each sensor. We explore how this increase in communication can be exploited to improve the results of the nominal greedy algorithm. Specifically, we show that this measurement passing can improve the quality of the resulting measurement set by up to a factor of $n+1$, where $n$ is the number of sensors.
翻译:本文审议一组传感器,作为一个小组,负责测量环境,并将一小部分测量结果送至中央数据集集中心,测量结果将用于估计环境的总体状况。传感器的目标是发送一套最丰富的测量数据,以便尽可能准确地估计估计。这个问题被作为一个亚模式最大化问题提出,对此存在着一种经过充分研究的贪婪算法,每个传感器从自己的本地数据集中依次选择一套测量数据,并将决定告知未来的传感器。在这项工作中,传感器可以相互分享测量数据,以便增加每个传感器的决策数据集。我们探索如何利用这种通信的增加来改进名义贪婪算法的结果。具体地说,我们表明,这种测量通过这种测量可以提高由一个系数设定的测量质量,达到1美元+1美元,其中1美元是传感器的数量。