Adaptivity of Arod Routing Protocol in Sparse and Dense Ad-Hoc Networks

Kiran Modani, A. Katariya
{"title":"Adaptivity of Arod Routing Protocol in Sparse and Dense Ad-Hoc Networks","authors":"Kiran Modani, A. Katariya","doi":"10.1109/CICN.2011.21","DOIUrl":null,"url":null,"abstract":"The dynamics of an ad hoc network has became vital factor for protocol design because mobility of nodes leads to unstable routing, and consequently flows encounter fluctuations in resource availability on various paths during the lifetime of a session. This has become serious, especially for those protocols based on single-path reservation, as frequent reservation and restoration of reservation-based flows increase the instability of connections. Advances in wireless research are focusing more and more on the adaptation capability of routing protocols. These protocols are interrelated to each other among various performance measures such as those related to topological changes (link breakages, node mobility, etc.) and quality of service (QoS) parameters. Sometimes, dynamic ad hoc networks resemble a dense ad hoc network. At other times, they resemble sparse network where nodes are located far away from each other. Many real networks follow the structure of dynamic ad hoc networks. Military networks, wildlife tracking sensor networks, and vehicle networks are some of these examples. In dynamic ad hoc networks, conventional routing schemes fail when the network characteristics do not fall into their applicable scenarios. Previous research has proposed a variety of routing schemes for each specific network scenario. For instance, distributed routing tables are built for efficient multi-hop, single copy routing in static and dense networks. Mobility assisted multi-copy routings are proposed in sparse networks where contemporary paths might not exist. After having review on these protocol and using some specific characteristic from these protocol we have designed a new routing algorithm that can work well in dense as well as sparse network. With the advantages of the existing schemes in mind, we introduce a new routing scheme, Adaptive Routing in Dynamic ad hoc networks (AROD), which is a seamless integration of several existing schemes.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Computational Intelligence and Communication Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CICN.2011.21","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The dynamics of an ad hoc network has became vital factor for protocol design because mobility of nodes leads to unstable routing, and consequently flows encounter fluctuations in resource availability on various paths during the lifetime of a session. This has become serious, especially for those protocols based on single-path reservation, as frequent reservation and restoration of reservation-based flows increase the instability of connections. Advances in wireless research are focusing more and more on the adaptation capability of routing protocols. These protocols are interrelated to each other among various performance measures such as those related to topological changes (link breakages, node mobility, etc.) and quality of service (QoS) parameters. Sometimes, dynamic ad hoc networks resemble a dense ad hoc network. At other times, they resemble sparse network where nodes are located far away from each other. Many real networks follow the structure of dynamic ad hoc networks. Military networks, wildlife tracking sensor networks, and vehicle networks are some of these examples. In dynamic ad hoc networks, conventional routing schemes fail when the network characteristics do not fall into their applicable scenarios. Previous research has proposed a variety of routing schemes for each specific network scenario. For instance, distributed routing tables are built for efficient multi-hop, single copy routing in static and dense networks. Mobility assisted multi-copy routings are proposed in sparse networks where contemporary paths might not exist. After having review on these protocol and using some specific characteristic from these protocol we have designed a new routing algorithm that can work well in dense as well as sparse network. With the advantages of the existing schemes in mind, we introduce a new routing scheme, Adaptive Routing in Dynamic ad hoc networks (AROD), which is a seamless integration of several existing schemes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
稀疏和密集Ad-Hoc网络中Arod路由协议的自适应研究
自组织网络的动态性已成为协议设计的重要因素,因为节点的移动性导致路由不稳定,因此流在会话的生命周期内会遇到各种路径上资源可用性的波动。由于频繁的保留和基于保留的流的恢复增加了连接的不稳定性,这已经变得非常严重,特别是对于那些基于单路径保留的协议。无线研究的进展越来越关注路由协议的自适应能力。这些协议在各种性能度量之间相互关联,例如与拓扑变化(链路中断、节点移动等)和服务质量(QoS)参数相关的性能度量。有时,动态自组织网络类似于密集的自组织网络。在其他时候,它们类似于稀疏网络,节点彼此相距很远。许多实际网络都采用动态自组织网络的结构。军事网络、野生动物跟踪传感器网络和车辆网络就是其中的一些例子。在动态自组织网络中,当网络特性不符合应用场景时,传统的路由方案会失败。以前的研究已经针对每个特定的网络场景提出了各种路由方案。例如,分布式路由表是为了在静态和密集网络中实现高效的多跳、单副本路由而构建的。在现有路径不存在的稀疏网络中,提出了机动性辅助多拷贝路由。在回顾了这些协议的基础上,利用这些协议的一些特点,设计了一种新的路由算法,可以很好地工作在密集和稀疏网络中。考虑到现有路由方案的优点,我们提出了一种新的路由方案——动态自适应路由(AROD),它是几种现有路由方案的无缝集成。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An Optimized Fast Discrete Cosine Transform Approach with Various Iterations and Optimum Numerical Factors for Image Quality Evaluation Meta Search Engine Based on Prioritizor Simulation and Testing of Photovoltaic with Grid Connected System Segmentation of Left Ventricle of 2D Echocardiographic Image Using Active Contouring Effects of Shadowing on the Performances of Mobile Ad Hoc Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1