Consensus Based Detection in Sensor Networks : Topology Optimization under Practical Constraints
Consensus Based Detection in Sensor Networks : Topology Optimization under Practical Constraints
复制标题
传感器网络中基于共识的检测：实际约束下的拓扑优化
DOI：
--
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
José M. F. Moura
中科院分区：
文献类型：
--
作者：
S. Kar;José M. F. Moura
我们考虑传感器网络中可能具有相关传感器观测值的分布式假设检验问题。传感器间通信受到底层通信网络的限制，传感器仅与其邻居交换信息。该网络没有中央融合中心。我们表明，在合理的假设下，可以通过分布式迭代一致性算法在每个传感器本地计算全局测试统计量。我们考虑在不同的实际设计约束下针对迭代共识的收敛速度优化传感器网络拓扑的问题。对于具有固定传感器间通信成本的非随机拓扑，当底层通信图是规则的、通信无噪声并且整个网络中传感器间通信成本恒定时，拉马努金图类是最佳的。相反，当链路之间的通信表现出不同的成本时，链路可能会失败，通过求解半定规划优化问题获得总体通信成本约束下的最优拓扑。
We consider a distributed hypothesis testing problem in sensor networks with possibly correlated sensor observations. The intersensor communication is constrained by the underlying communication network to sensors exchanging information only with their neighbors. The network has no central fusion center. We show that, under reasonable assumptions, the global test statistic can be computed locally at each sensor by a distributed iterative consensus algorithm. We consider the problem of optimizing the sensor network topology with respect to the rate of convergence of iterative consensus under different practical design constraints. For nonrandom topologies with fixed intersensor communication costs, the class of Ramanujan graphs is optimal when the underlying communication graph is regular, the communication is noiseless, and the intersensor communication costs are constant across the network. In contrast, when communication among links exhibits different costs, links may fail, the optimal topology under an overall communication cost constraint is obtained by solving a semidefinite programming optimization problem.