基于AODV的manet协议性能分析

M. El-Azhari, Othman A. Al-Amoudi, M. Woodward, I. Awan
{"title":"基于AODV的manet协议性能分析","authors":"M. El-Azhari, Othman A. Al-Amoudi, M. Woodward, I. Awan","doi":"10.1109/WAINA.2009.82","DOIUrl":null,"url":null,"abstract":"Discovering and maintaining routes between nodes are one of the biggest challenges in MANETs the ultimate goal of the MANET community is to provide a set of standardized protocols that can be both robust and scalable. This paper proposes routing protocols based on the {heading direction angle + Number of Hops, Number of Hops + heading direction angle, the best heading direction angle route}. The first one is designed to calculate the angle direction and when the angles are the same take the best hop count. The second one is designed to calculate the best hop count and when the hops counts are the same take the best angle direction. The last one is designed to calculate the average of all heading direction angles in the route and find the best route from the source to the destination. We measure the performance of the proposed approach by comparing it with the well known On-Demand (reactive) routing protocol (AODV).","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Performance Analysis in AODV Based Protocols for MANETs\",\"authors\":\"M. El-Azhari, Othman A. Al-Amoudi, M. Woodward, I. Awan\",\"doi\":\"10.1109/WAINA.2009.82\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Discovering and maintaining routes between nodes are one of the biggest challenges in MANETs the ultimate goal of the MANET community is to provide a set of standardized protocols that can be both robust and scalable. This paper proposes routing protocols based on the {heading direction angle + Number of Hops, Number of Hops + heading direction angle, the best heading direction angle route}. The first one is designed to calculate the angle direction and when the angles are the same take the best hop count. The second one is designed to calculate the best hop count and when the hops counts are the same take the best angle direction. The last one is designed to calculate the average of all heading direction angles in the route and find the best route from the source to the destination. We measure the performance of the proposed approach by comparing it with the well known On-Demand (reactive) routing protocol (AODV).\",\"PeriodicalId\":159465,\"journal\":{\"name\":\"2009 International Conference on Advanced Information Networking and Applications Workshops\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-05-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Advanced Information Networking and Applications Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WAINA.2009.82\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Advanced Information Networking and Applications Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WAINA.2009.82","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

摘要

发现和维护节点之间的路由是MANET最大的挑战之一,MANET社区的最终目标是提供一套既健壮又可扩展的标准化协议。提出了基于{航向角+跳数,跳数+航向角,最佳航向角路由}的路由协议。第一个是用来计算角度方向的,当角度相同时,取最佳跳数。第二个算法用于计算最佳跳数,当跳数相同时,取最佳角度方向。最后一种算法是计算路线中所有航向角的平均值,找到从源到目的的最佳路线。我们通过将所提出的方法与众所周知的按需路由协议(AODV)进行比较来衡量其性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Performance Analysis in AODV Based Protocols for MANETs
Discovering and maintaining routes between nodes are one of the biggest challenges in MANETs the ultimate goal of the MANET community is to provide a set of standardized protocols that can be both robust and scalable. This paper proposes routing protocols based on the {heading direction angle + Number of Hops, Number of Hops + heading direction angle, the best heading direction angle route}. The first one is designed to calculate the angle direction and when the angles are the same take the best hop count. The second one is designed to calculate the best hop count and when the hops counts are the same take the best angle direction. The last one is designed to calculate the average of all heading direction angles in the route and find the best route from the source to the destination. We measure the performance of the proposed approach by comparing it with the well known On-Demand (reactive) routing protocol (AODV).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信