基于非合作博弈的栅栏信息覆盖虚拟节点组合算法

摘要

Neighboring sensors can collaborate with each other to form a virtual sensor based on cooperative sensing and data fusion, which may increase the length of information barrier. A distributed algorithm DVSF for virtual sensor formation based on non-cooperative games was devised. In order to increase the total length of information barrier of the networks, the DVSF chooses appropriate neighboring sensors to form virtual sensors, and it improves the performance of barrier information coverage of the networks. Simulations of the approach demonstrate the effectiveness and the convergence of DVSF.%邻近节点通过协作感知和信息融合组成虚拟节点,能够增加信息覆盖栅栏长度.基于非合作博弈模型,设计了一种完全分布式的虚拟节点组合算法DVSF算法.DVSF算法面向栅栏信息覆盖应用,以尽量增加整个网络的信息覆盖栅栏长度为目标,将合适的邻近节点组合成虚拟节点,提升了整个网络的栅栏信息覆盖性能.仿真实验验证了DVSF算法的有效性和收敛性.