首页> 外文会议>2010 IEEE/ACS International Conference on Computer Systems and Applications >A layered cluster based routing for an ad hoc environment
【24h】

A layered cluster based routing for an ad hoc environment

机译:临时环境的基于分层群集的路由

获取原文

摘要

The intrinsic characteristics of ad hoc networks, such as the frequent connectivity changes and the strict bandwidth and power constraints, impose further challenges, especially for routing tasks. Besides, existing routing algorithms devoted to ad hoc networks and based on proactive or reactive schemes suffer from scalability due to their intrinsic mechanisms. The control overhead induced by routing packets is a primary factor, since it increases with the number of nodes, especially in large and dense networks evolving in a dynamic environment. Relying on a virtual infrastructure seems a promising approach to overcome the scalability problem. The basic idea consists on assigning additional tasks to a limited set of dominating nodes, satisfying specific requirements. In this paper, we present a routing algorithm, which exploits the benefits of our clustering algorithm TBCA. Conducted simulations show the ability of our new approach to reduce the control overhead and improve the reactivity of routing to the topology changes.
机译:自组织网络的固有特性(例如频繁的连接性更改以及严格的带宽和功率约束)带来了进一步的挑战,尤其是对于路由任务。此外,现有的专门用于ad hoc网络并基于主动或反应方案的路由算法由于其内在机制而遭受了可伸缩性的困扰。路由数据包引起的控制开销是一个主要因素,因为它随着节点数量的增加而增加,尤其是在动态环境中发展的大型密集网络中。依靠虚拟基础架构似乎是解决可伸缩性问题的一种有前途的方法。基本思想是将附加任务分配给一组有限的支配节点,以满足特定要求。在本文中,我们提出了一种路由算法,该算法利用了我们的聚类算法TBCA的优势。进行的仿真表明,我们的新方法能够减少控制开销并提高路由到拓扑更改的反应性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号