...
首页> 外文期刊>IEEE transactions on mobile computing >A Self-Repairing Tree Topology Enabling Content-Based Routing in Mobile Ad Hoc Networks
【24h】

A Self-Repairing Tree Topology Enabling Content-Based Routing in Mobile Ad Hoc Networks

机译:一种自修复树拓扑,可在移动Ad Hoc网络中实现基于内容的路由

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

获取外文期刊封面封底 >>

       

摘要

Content-based routing (CBR) provides a powerful and flexible foundation for distributed applications. Its communication model, based on implicit addressing, fosters decoupling among the communicating components, therefore meeting the needs of many dynamic scenarios, including mobile ad hoc networks (MANETs). Unfortunately, the characteristics of the CBR model are only rarely met by available systems, which typically assume that application-level routers are organized in a tree-shaped network with a fixed topology. In this paper we present COMAN, a protocol to organize the nodes of a MANET in a tree-shaped network able to i) self-repair to tolerate the frequent topological reconfigurations characteristic of MANETs; ii) achieve this goal through repair strategies that minimize the changes that may impact the CBR layer exploiting the tree. COMAN is implemented and publicly available. Here we report about its performance in simulated scenarios as well as in real-world experiments. The results confirm that its characteristics enable reliable and efficient CBR on MANETs.
机译:基于内容的路由(CBR)为分布式应用程序提供了强大而灵活的基础。其基于隐式寻址的通信模型促进了通信组件之间的解耦,因此满足了许多动态场景的需求,包括移动自组织网络(MANET)。不幸的是,可用系统很少满足CBR模型的特征,这些系统通常假定应用程序级路由器是在具有固定拓扑的树形网络中组织的。在本文中,我们提出了COMAN,一种在树形网络中组织MANET节点的协议,该协议能够:i)自修复以容忍MANET的频繁拓扑重配置特性; ii)通过最大限度地减少可能影响利用树的CBR层的更改的修复策略来实现此目标。 COMAN已实现并公开可用。在这里,我们将报告其在模拟场景以及实际实验中的性能。结果证实,其特性可在MANET上实现可靠且高效的CBR。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号