• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Communications in Computing(CIC'05); 20050627-30; Las Vegas,NV(US) >Size Optimal Strategies for Capturing an Intruder in Mesh Networks
【24h】

Size Optimal Strategies for Capturing an Intruder in Mesh Networks

机译：捕获网状网络中入侵者的大小最佳策略

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper we consider the problem of capturing an intruder in a networked environment. The intruder is defined as a mobile entity that moves inside the network and escapes from a team of collaborative agents. The agents travel asynchronously and try to coordinate their moves in order to capture the intruder. We consider as a topology a m x n-Mesh; we first show some lower bounds on the number of agents, number of moves, and time required to capture the intruder. We then consider two models: one in which the only knowledge that an agent has is local to the node it resides, the other in which agents have visibility, i.e., are allowed to "see" the state of their neighbours. One of our goals is to understand what is the impact of visibility on complexity. All our strategies, in both models, are optimal in terms of number of agents employed and number of moves performed; moreover, the visibility power enables the agents to drastically speed up computation, and thus we also obtain an optimal time bound.
机译：在本文中，我们考虑了在网络环境中捕获入侵者的问题。入侵者定义为在网络内部移动并脱离协作代理团队的移动实体。特工异步移动并尝试协调他们的行动，以捕获入侵者。我们将m x n-Mesh作为拓扑。我们首先在探员数量，移动数量和捕获入侵者所需的时间上显示一些下限。然后，我们考虑两种模型：一种模型，其中代理所具有的唯一知识是它所驻留的节点本地的，另一种模型中的代理具有可见性，即被允许“查看”其邻居的状态。我们的目标之一是了解可见性对复杂性的影响。在这两种模型中，我们所有的策略在雇用的特工数量和执行的动作数量方面都是最优的。此外，可见性功能使代理能够大大加快计算速度，因此我们还可以获得最佳时限。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号