A layered cluster based routing for an ad hoc environment

I. Jemili, A. Belghith, M. Mosbah
{"title":"A layered cluster based routing for an ad hoc environment","authors":"I. Jemili, A. Belghith, M. Mosbah","doi":"10.1109/AICCSA.2010.5587016","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"89 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AICCSA.2010.5587016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

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的优点。仿真结果表明,该方法能够降低控制开销,提高路由对拓扑变化的响应性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信