Trustworthy routing with the AODV protocol

A. Pirzada, A. Datta, C. McDonald
{"title":"Trustworthy routing with the AODV protocol","authors":"A. Pirzada, A. Datta, C. McDonald","doi":"10.1109/INCC.2004.1366570","DOIUrl":null,"url":null,"abstract":"Ad-hoc networks come into existence when two or more wireless mobile nodes agree to pass packets for each other. The wireless range of these nodes is usually limited to hundred of meters; however, with mutual cooperation these nodes are able to provide extended communication coverage. Ad-hoc on-demand distance vector (AODV) is a routing protocol frequently used to establish such networks. The correct execution of the protocol requires sustained benevolent behaviour by all participating nodes. This is difficult to achieve and malicious nodes frequently tamper with the AODV routing process. We propose a novel and pragmatic method for establishing trustworthy routes in an AODV based ad-hoc network without necessitating the use of cryptography. We accentuate that our model is most appropriate for ad-hoc networks that can be established on the fly without requiring a dedicated trust infrastructure or pre-configuration of nodes.","PeriodicalId":337263,"journal":{"name":"2004 International Networking and Communication Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 International Networking and Communication Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INCC.2004.1366570","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

Ad-hoc networks come into existence when two or more wireless mobile nodes agree to pass packets for each other. The wireless range of these nodes is usually limited to hundred of meters; however, with mutual cooperation these nodes are able to provide extended communication coverage. Ad-hoc on-demand distance vector (AODV) is a routing protocol frequently used to establish such networks. The correct execution of the protocol requires sustained benevolent behaviour by all participating nodes. This is difficult to achieve and malicious nodes frequently tamper with the AODV routing process. We propose a novel and pragmatic method for establishing trustworthy routes in an AODV based ad-hoc network without necessitating the use of cryptography. We accentuate that our model is most appropriate for ad-hoc networks that can be established on the fly without requiring a dedicated trust infrastructure or pre-configuration of nodes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用AODV协议的可靠路由
当两个或多个无线移动节点同意相互传递数据包时,Ad-hoc网络就出现了。这些节点的无线范围通常限制在几百米以内;然而,通过相互合作,这些节点能够提供扩展的通信覆盖。Ad-hoc按需距离矢量(AODV)是一种经常用于建立这种网络的路由协议。协议的正确执行需要所有参与节点的持续善意行为。这是很难实现的,恶意节点经常篡改AODV路由过程。我们提出了一种新颖实用的方法,在不需要使用加密技术的情况下,在基于AODV的ad-hoc网络中建立可信路由。我们强调,我们的模型最适合即时建立的ad-hoc网络,而不需要专用的信任基础设施或节点的预配置。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Overview of MPLS technology and traffic engineering applications Multislot scheduling algorithm in ATM networks A high-capacity scheduling algorithm for systems employing embedded modulation A new video indexing and retrieval method for temporal textures using block-based cooccurrence statistics FLeSMA: a firewall level spam mitigation approach through a genetic classifier 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