The improvement of coverage quality in the construction of multiple-barrier coverage is a critical problem in a wireless sensor network. In this article, we investigate the K -barrier coverage construction problem in passive bistatic radar sensor networks. In contrast to traditional bistatic radar networks, the transmitters in a passive bistatic radar network are predeployed and noncooperative. To construct K barriers, we need to deploy receivers that couple with predeployed transmitters to build continuous barriers. In this work, we focus on the minimum number of receivers problem of constructing K -barrier coverage, where the minimum number of receivers is based on the predeployed transmitters. To handle this problem, we first investigate the optimal placement of receivers between adjacent transmitters for a sub-barrier formation and then determine the optimal placement of receivers for the one-barrier construction. For multiple-barrier coverage construction, we introduce a weighted transmitter graph (WTG) to describe the relation among different transmitters, where the weight in the graph is the minimum number of receivers needed for these two transmitters for a sub-barrier formation. Based on WTG, the minimum receivers problem changes to a problem of how to find K -disjoint paths with the minimum total weight in the graph. For large-scale networks, we also propose two efficient heuristic algorithms to solve the corresponding problem. Finally, we conduct extensive experiments to validate the correctness and the efficiency of the proposed algorithms.

中文翻译：

---

无源双基地雷达传感器网络中 K 势垒覆盖的最佳接收器布置

多屏障覆盖建设中覆盖质量的提高是无线传感器网络中的一个关键问题。在本文中，我们调查了ķ-无源双基地雷达传感器网络中的屏障覆盖构建问题。与传统的双基地雷达网络相比，无源双基地雷达网络中的发射器是预先部署的且不合作的。构造ķ屏障，我们需要部署与预先部署的发射器耦合的接收器，以构建连续的屏障。在这项工作中，我们专注于构造的最小接收器数量问题ķ- 屏障覆盖，其中接收器的最小数量基于预先部署的发射器。为了解决这个问题，我们首先研究相邻发射机之间接收器的最佳放置以形成子屏障，然后确定接收器的最佳放置以形成单屏障。对于多屏障覆盖构建，我们引入加权发射器图（WTG）来描述不同发射器之间的关系，其中图中的权重是这两个发射器形成子屏障所需的最小接收器数量。基于WTG，最小接收者问题转变为如何找到的问题ķ- 图中总权重最小的不相交路径。对于大规模网络，我们还提出了两种有效的启发式算法来解决相应的问题。最后，我们进行了广泛的实验来验证所提出算法的正确性和效率。