首页> 外文OA文献 >A self-organizable topology maintenance protocol for mobile group communications in mobile next-generation networks
【2h】

A self-organizable topology maintenance protocol for mobile group communications in mobile next-generation networks

机译:用于移动下一代网络中的移动组通信的自组织拓扑维护协议

摘要

The explosive growth of mobile and wireless communications has attracted interests in the integration of mobile and wireless networks with wired ones and the wired Internet in particular. In order to deal with the scalability and reliability issues for group communication services in such a network environment, many existing protocols divide the whole group into subgroups and organize them into a tree-based hierarchy. A special node in each subgroup is responsible for collecting acknowledgement messages and locally retransmitting lost messages within the subgroup. However, the tree-based hierarchy has the single point of failure problem, which may seriously affect the performance of group communications. We propose a RingNet hierarchy of proxies that is a combination of logical trees and logical rings. The proposed hierarchy has the self-organization property because it can heal itself as quickly as possible in the presence of failures. Therefore, it has no single point of failure problem. We formally prove that, with high probability of 99.899%, the proposed hierarchy with up to 10 000 proxies directly attached by a large number of mobile hosts only needs simple and efficient procedures to repair broken logical rings when the node failure probability is bounded by 0.1%. We also validate the proposed protocol by extensive simulations, which show that the proposed protocol scales very well when the size of the network becomes large, and that it is highly resilient to failures when the node failure probability becomes large.
机译:移动和无线通信的爆炸性增长吸引了人们对将移动和无线网络与有线网络特别是有线Internet集成的兴趣。为了处理这种网络环境中的组通信服务的可伸缩性和可靠性问题,许多现有协议将整个组划分为子组,并将它们组织为基于树的层次结构。每个子组中的一个特殊节点负责收集确认消息,并在子组中本地重新传输丢失的消息。但是,基于树的层次结构具有单点故障问题,这可能会严重影响组通信的性能。我们提出了一个RingNet代理层次结构,该层次结构是逻辑树和逻辑环的组合。所提出的层次结构具有自组织特性,因为它可以在出现故障时尽快地自我修复。因此,它没有单点故障问题。我们正式证明,当节点故障概率受0.1限制时,由大量移动主机直接附加的多达10000个代理的建议层次结构,具有99.899%的高概率,仅需要简单而有效的过程即可修复损坏的逻辑环。 %。我们还通过广泛的仿真验证了所提出的协议,该仿真表明,当网络规模变大时,提出的协议可以很好地扩展;当节点出现故障的概率变大时,它对故障具有高度的弹性。

著录项

  • 作者

    Wang G; Cao J; Chan KCC;

  • 作者单位
  • 年度 2006
  • 总页数
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号