使用速度和距离增强AODV路由

Second International Conference on the Innovative Computing Technology (INTECH 2012) Pub Date : 2012-09-01 DOI:10.1109/INTECH.2012.6457757

B. Ahmed, Z. Ouadoudi, R. Mohamed, O. Mohamed

{"title":"使用速度和距离增强AODV路由","authors":"B. Ahmed, Z. Ouadoudi, R. Mohamed, O. Mohamed","doi":"10.1109/INTECH.2012.6457757","DOIUrl":null,"url":null,"abstract":"In the standard AODV protocol, the shortest path is always selected. But this shortest path is the easiest broken one. In this paper, we propose an improvement of AODV protocol called AMAODV(Adaptative Mobility aware AODV). This protocol is based on considering the distance and relative velocity between each node and one hop neighbor. Which permits to avoid losing route. Through the simulation, it is confirmed that this improvement has higher package delivery fraction than basic AODV protocol.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Enhancements in AODV routing using velocity and distance\",\"authors\":\"B. Ahmed, Z. Ouadoudi, R. Mohamed, O. Mohamed\",\"doi\":\"10.1109/INTECH.2012.6457757\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the standard AODV protocol, the shortest path is always selected. But this shortest path is the easiest broken one. In this paper, we propose an improvement of AODV protocol called AMAODV(Adaptative Mobility aware AODV). This protocol is based on considering the distance and relative velocity between each node and one hop neighbor. Which permits to avoid losing route. Through the simulation, it is confirmed that this improvement has higher package delivery fraction than basic AODV protocol.\",\"PeriodicalId\":369113,\"journal\":{\"name\":\"Second International Conference on the Innovative Computing Technology (INTECH 2012)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Second International Conference on the Innovative Computing Technology (INTECH 2012)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INTECH.2012.6457757\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INTECH.2012.6457757","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

在标准AODV协议中，总是选择最短路径。但这条最短路径是最容易被破坏的。在本文中，我们提出了一种改进的AODV协议，称为AMAODV(adaptive Mobility aware AODV)。该协议基于考虑每个节点与单跳邻居之间的距离和相对速度。这样可以避免丢失路线。通过仿真验证，该改进方案比基本的AODV协议具有更高的包裹投递率。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Enhancements in AODV routing using velocity and distance

In the standard AODV protocol, the shortest path is always selected. But this shortest path is the easiest broken one. In this paper, we propose an improvement of AODV protocol called AMAODV(Adaptative Mobility aware AODV). This protocol is based on considering the distance and relative velocity between each node and one hop neighbor. Which permits to avoid losing route. Through the simulation, it is confirmed that this improvement has higher package delivery fraction than basic AODV protocol.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Second International Conference on the Innovative Computing Technology (INTECH 2012)

自引率

0.00%

发文量