• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Communication Systems Software and Middleware >Path Diminution is Unavoidable in Node-Disjoint Multipath Routing with Single Route Discovery
【24h】

Path Diminution is Unavoidable in Node-Disjoint Multipath Routing with Single Route Discovery

机译：通过单路径发现，节点脱位多路径路由是不可避免的路径减析

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In an ad hoc network, identification of all node-disjoint paths between a given pair of nodes is a challenging task. The phenomena that a protocol is not able to identify all node-disjoint paths that exist between a given pair of nodes is called path diminution. In this paper, we discuss that path diminution is unavoidable when a protocol discovers multiple node-disjoint paths in a single route discovery. We discuss schemes to mitigate path diminution. However, no such scheme is guaranteed to discover all node-disjoint paths that exist between a given pair of nodes. We have proved that one cannot devise an efficient algorithm that is guaranteed to compute all node-disjoint paths between a given pair of nodes in a single route discovery.
机译：在ad hoc网络中，识别给定对节点之间的所有节点不相交路径是一个具有挑战性的任务。协议无法识别给定节点对之间存在的所有节点不相交路径的现象称为路径减速。在本文中，我们讨论在单个路由发现中发现多个节点不相交路径时，路径减速是不可避免的。我们讨论减缓路径减少的计划。但是，没有保证此类方案来发现给定对节点之间存在的所有节点不相交路径。我们已经证明，人们不能设计一种有效的算法，该算法保证在单路路由发现中计算给定的一对节点之间的所有节点不相交路径。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号