Secure Routing with the AODV Protocol

A. Pirzada, C. McDonald
{"title":"Secure Routing with the AODV Protocol","authors":"A. Pirzada, C. McDonald","doi":"10.1109/APCC.2005.1554018","DOIUrl":null,"url":null,"abstract":"Ad-hoc networks, due to their improvised nature, are frequently established in insecure environments, which makes them susceptible to attacks. These attacks are launched by participating malicious nodes against different network services. Routing protocols, which act as the binding force in these networks, are a common target of these nodes. Ad-hoc on-demand distance vector (AODV) is one of the widely used routing protocols that is currently undergoing extensive research and development. AODV is based on distance vector routing, but the updates are shared not on a periodic basis but on an as per requirement basis. The control packets contain a hop-count and sequence number field that identifies the freshness of routing updates. As these fields are mutable, it creates a potential vulnerability that is frequently exploited by malicious nodes to advertise better routes. Similarly, transmission of routing updates in clear text also discloses vital information about the network topology, which is again a potential security hazard. In this paper we present a novel and pragmatic scheme for securing the ad-hoc on-demand distance vector routing protocol that protects against a number of attacks carried out against mobile ad-hoc wireless networks","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"63","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 Asia-Pacific Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCC.2005.1554018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 63

Abstract

Ad-hoc networks, due to their improvised nature, are frequently established in insecure environments, which makes them susceptible to attacks. These attacks are launched by participating malicious nodes against different network services. Routing protocols, which act as the binding force in these networks, are a common target of these nodes. Ad-hoc on-demand distance vector (AODV) is one of the widely used routing protocols that is currently undergoing extensive research and development. AODV is based on distance vector routing, but the updates are shared not on a periodic basis but on an as per requirement basis. The control packets contain a hop-count and sequence number field that identifies the freshness of routing updates. As these fields are mutable, it creates a potential vulnerability that is frequently exploited by malicious nodes to advertise better routes. Similarly, transmission of routing updates in clear text also discloses vital information about the network topology, which is again a potential security hazard. In this paper we present a novel and pragmatic scheme for securing the ad-hoc on-demand distance vector routing protocol that protects against a number of attacks carried out against mobile ad-hoc wireless networks
使用AODV协议的安全路由
Ad-hoc网络由于其临时性质,经常建立在不安全的环境中,这使它们容易受到攻击。这些攻击是由参与的恶意节点针对不同的网络服务发起的。路由协议在这些网络中起着绑定作用,是这些节点的共同目标。Ad-hoc按需距离矢量(AODV)是目前应用广泛的路由协议之一,正在进行大量的研究和开发。AODV基于距离矢量路由,但更新不是定期共享的,而是根据需求共享的。控制包包含一个跳数和序列号字段,用来标识路由更新的新鲜度。由于这些字段是可变的,因此产生了一个潜在的漏洞,恶意节点经常利用这个漏洞来发布更好的路由。同样,以明文方式传输路由更新也会泄露网络拓扑的重要信息,这也是一个潜在的安全隐患。在本文中,我们提出了一种新颖实用的方案来保护ad-hoc按需距离矢量路由协议,该协议可以防止针对移动ad-hoc无线网络的许多攻击
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信