Barrier coverage in Wireless Sensor Networks (WSNs) plays a pivotal role in surveillance and security applications. It serves as a fundamental mechanism for identifying and detecting potential intruders who endeavor to infiltrate a sensor barrier. Achieving -strong barrier coverage is a vital indicator of a WSN’s capability to detect unauthorized intrusions. This paper establishes efficient -strong barrier coverage in hybrid wireless multimedia sensor networks, referred to as MMS-KSB. The primary goal is to identify a minimal number of mobile sensors to obtain -barrier coverage. Exhibiting the combinatorial structure, previous research on building -strong barrier has failed to provide a polynomial time solution for the considered problem and resorted to approximation algorithms. We, therefore, introduce a precise algorithm, named ExA-KSB, and provide theoretical analysis to substantiate that our proposed method achieves an exact solution with polynomial time complexity. Furthermore, we conduct comprehensive experiments to evaluate the efficacy of our algorithm by comparing it with existing approaches. Numerical results demonstrate that ExA-KSB surpasses previous algorithms, and offers superior solution quality with competitive computational efficiency.

中文翻译：

---

异构无线多媒体传感器网络中实现强障碍覆盖的多项式时间复杂度的高效精确方法


无线传感器网络 (WSN) 中的障碍覆盖在监控和安全应用中发挥着关键作用。它是识别和检测试图渗透传感器屏障的潜在入侵者的基本机制。实现强大的屏障覆盖是无线传感器网络检测未经授权的入侵能力的重要指标。本文建立了混合无线多媒体传感器网络的高效强屏障覆盖，简称MMS-KSB。主要目标是确定最少数量的移动传感器以获得障碍覆盖。展示组合结构，先前关于构建强势垒的研究未能为所考虑的问题提供多项式时间解决方案，而诉诸于近似算法。因此，我们引入了一种名为 ExA-KSB 的精确算法，并提供理论分析来证实我们提出的方法以多项式时间复杂度实现了精确解。此外，我们进行了全面的实验，通过与现有方法进行比较来评估我们算法的有效性。数值结果表明 ExA-KSB 超越了以前的算法，并提供了卓越的解决方案质量和具有竞争力的计算效率。