• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Symposium on Computer and Information Sciences(ISCIS 2004); 20041027-29; Kemer-Antalya(TR) >Finding Breach Paths Using the Watershed Segmentation Algorithm in Surveillance Wireless Sensor Networks
【24h】

Finding Breach Paths Using the Watershed Segmentation Algorithm in Surveillance Wireless Sensor Networks

机译：在监视无线传感器网络中使用分水岭分割算法查找突破路径

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

摘要

Considering wireless sensor networks for border surveillance, one of the major concerns is sensing coverage. Breach probability can be used as a measure to analyze the tradeoffs and to determine the required number of sensors to be deployed to obtain a certain security level. In this paper, the sensing coverage of surveillance wireless sensor networks is studied by utilizing a well-known image processing technique. By applying the watershed segmentation algorithm to the sensing coverage graph, the contour points, which are followed by the breach paths, are found. To determine the weakest breach path by utilizing the contour points, Dijkstra's shortest path algorithm is used. Under uniformly distributed random deployment, the breach probability is evaluated against the sensor model parameters, field width and the number of sensors deployed.
机译：考虑到用于边界监视的无线传感器网络，主要关注的问题之一是传感范围。违反概率可以用作衡量折衷和确定要部署以获得一定安全级别的传感器所需数量的一种度量。在本文中，利用一种众所周知的图像处理技术来研究监视无线传感器网络的感测范围。通过将分水岭分割算法应用于感测覆盖图，可以找到轮廓点，随后是违规路径。为了利用轮廓点确定最弱的违规路径，使用了Dijkstra的最短路径算法。在均匀分布的随机部署下，将根据传感器模型参数，场宽和部署的传感器数量评估破坏概率。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号