首页> 外文期刊>IEEE/ACM Transactions on Networking >Breach-Free Sleep-Wakeup Scheduling for Barrier Coverage With Heterogeneous Wireless Sensors
【24h】

Breach-Free Sleep-Wakeup Scheduling for Barrier Coverage With Heterogeneous Wireless Sensors

机译:异构无线传感器的无障碍睡眠唤醒计划,用于障碍物覆盖

获取原文
获取原文并翻译 | 示例

摘要

Barrier Coverage plays a vital role in wireless sensor networks. Research on barrier coverage has mainly focused on the lifetime maximization and the critical conditions to achieve $k$ -Barrier Coverage under various sensing models. When sensors are randomly deployed along the boundary of an area of interest, they may form several disjoint barrier covers. To maximize the lifetime of barrier coverage, those barrier covers need to be scheduled to avoid a security problem, call breach. In a heterogeneous wireless sensor network, given a set of barrier-covers each with a lifetime, we study the problem of finding a lifetime-maximizing subset with a breach-free sleep-wakeup scheduling. We first prove that it can be judged in polynomial time whether a given sleep-wakeup schedule is breach-free or not, but given a set of barrier-covers, it is NP-Complete to determine whether there exists a breach-free schedule. Then, we show that the problem of finding a lifetime-maximizing breach-free schedule is equivalent to the maximum node weighted path problem in a directed graph, and design a parameterized algorithm. Experimental results show that our algorithm significantly outperforms the heuristics proposed in the literature.
机译:屏障覆盖在无线传感器网络中起着至关重要的作用。障碍物覆盖的研究主要集中在寿命最大化和在各种传感模型下达到$ k $的关键条件。当传感器沿着目标区域的边界随机部署时,它们可能会形成多个不相交的障碍物覆盖物。为了最大程度地延长隔离墙的使用寿命,需要安排这些隔离墙以避免出现安全问题(呼叫中断)。在异构无线传感器网络中,给定一组具有生命周期的屏障覆盖,我们研究了使用无中断睡眠唤醒计划来找到生命周期最大化子集的问题。我们首先证明,可以在多项式时间内判断给定的睡眠唤醒计划是否无违规,但是给定一组障碍覆盖物,确定是否存在无违规时间表是NP-Complete。然后,我们证明寻找有生命周期最大化的无违规时间表的问题与有向图中的最大节点加权路径问题等效,并设计了参数化算法。实验结果表明,我们的算法明显优于文献中提出的启发式算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号