arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1608.07329cs.NI
收藏

用于网络中事件检测和隔离的资源受限监视设备调度

Scheduling Resource-Bounded Monitoring Devices for Event Detection and Isolation in Networks

Waseem Abbas, Aron Laszka, Yevgeniy Vorobeychik, Xenofon Koutsoukos

摘要:

在联网系统中,通常部署诸如传感器之类的监视设备来监视各种目标位置。目标是物理空间中可能发生某些感兴趣的事件(如随机故障或攻击)的点。大多数情况下,这些设备具有有限的能量供应,并且它们可以在有限的持续时间内操作。因此,通过一组具有有限能量供应的监测设备对各种目标位置进行节能监测是联网系统中的关键问题。在本文中,我们研究了监控设备的优化调度,以最大限度地提高网络覆盖率,检测和隔离事件的目标,在给定的网络寿命。所考虑的监控设备只能在整个网络生命周期的一小部分时间内保持活动状态。我们制定的监控设备的调度问题作为一个图形标记的问题,这与其他现有的解决方案,使我们能够直接利用底层网络结构,探索覆盖范围和网络寿命之间的权衡。在这个方向上,首先,我们提出了一个贪婪的启发式解决图标记问题,然后提供一个博弈论的解决方案,以实现近最佳的图标记。此外,所提出的设置可以用于同时解决监控设备的调度和放置,与单独解决放置和调度问题相比,这产生了改进的性能。最后,我们展示了我们在各种网络上的结果,包括现实世界的配水网络。

英文摘要:

In networked systems, monitoring devices such as sensors are typically deployed to monitor various target locations. Targets are the points in the physical space at which events of some interest, such as random faults or attacks, can occur. Most often, these devices have limited energy supplies, and they can operate for a limited duration. As a result, energy-efficient monitoring of various target locations through a set of monitoring devices with limited energy supplies is a crucial problem in networked systems. In this paper, we study optimal scheduling of monitoring devices to maximize network coverage for detecting and isolating events on targets for a given network lifetime. The monitoring devices considered could remain active only for a fraction of the overall network lifetime. We formulate the problem of scheduling of monitoring devices as a graph labeling problem, which unlike other existing solutions, allows us to directly utilize the underlying network structure to explore the trade-off between coverage and network lifetime. In this direction, first we propose a greedy heuristic to solve the graph labeling problem, and then provide a game-theoretic solution to achieve near optimal graph labeling. Moreover, the proposed setup can be used to simultaneously solve the scheduling and placement of monitoring devices, which yields improved performance as compared to separately solving the placement and scheduling problems. Finally, we illustrate our results on various networks, including real-world water distribution networks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑