A Study on Ad-Hoc on-Demand Distance Vector AODV Protocol

R. Madhanmohan
{"title":"A Study on Ad-Hoc on-Demand Distance Vector AODV Protocol","authors":"R. Madhanmohan","doi":"10.31142/IJTSRD24006","DOIUrl":null,"url":null,"abstract":"Copyright © 2019 by author(s) and International Journal of Trend in Scientific Research and Development Journal. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (CC BY 4.0) (http://creativecommons.org/licenses/ by/4.0) ABSTRACT AODV is a very simple, efficient, and effective routing protocol for Mobile Ad-hoc Networks which do not have fixed topology. This algorithm was motivated by the limited bandwidth that is available in the media that are used for wireless communications. It borrows most of the advantageous concepts from DSR and DSDV algorithms. The on demand route discovery and route maintenance from DSR and hop-by-hop routing, usage of node sequence numbers from DSDV make the algorithm cope up with topology and routing information. Obtaining the routes purely on-demand makes AODV a very useful and desired algorithm for MANETs.","PeriodicalId":14446,"journal":{"name":"International Journal of Trend in Scientific Research and Development","volume":"25 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Trend in Scientific Research and Development","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31142/IJTSRD24006","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Copyright © 2019 by author(s) and International Journal of Trend in Scientific Research and Development Journal. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (CC BY 4.0) (http://creativecommons.org/licenses/ by/4.0) ABSTRACT AODV is a very simple, efficient, and effective routing protocol for Mobile Ad-hoc Networks which do not have fixed topology. This algorithm was motivated by the limited bandwidth that is available in the media that are used for wireless communications. It borrows most of the advantageous concepts from DSR and DSDV algorithms. The on demand route discovery and route maintenance from DSR and hop-by-hop routing, usage of node sequence numbers from DSDV make the algorithm cope up with topology and routing information. Obtaining the routes purely on-demand makes AODV a very useful and desired algorithm for MANETs.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Ad-Hoc按需距离矢量AODV协议研究
版权所有©2019由作者和《国际科学研究与发展趋势杂志》所有。摘要AODV是一种非常简单、高效、有效的路由协议,适用于没有固定拓扑结构的移动Ad-hoc网络。该算法的动机是用于无线通信的媒体中可用的有限带宽。它借鉴了DSR和DSDV算法的大部分优势概念。基于DSR和逐跳路由的按需路由发现和维护,以及基于DSDV的节点序列号的使用,使该算法能够很好地处理拓扑和路由信息。纯按需获取路由使AODV算法成为一种非常有用和理想的manet算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Status of Secondary Sector in Nabarangpur, Odisha Factors Influencing Smallholder Potato Farmers’ Choice Decisions of Market Outlets in Musanze and Nyabihu Districts, Rwanda: A Multivariate Probit MODEL Maintenance and other Operating Expenses (MOOE) and School Based Management (SBM) Performance of Secondary Schools in Samar Island Biogas Production from Decanter Cake of Palm Oil Mill from South India Estimating the Survival Function of HIV/AIDS Patients using Weibull Model
×
引用
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