Ad Hoc路由维护的改进

A. Otakahn, M. Lertwatechakul
{"title":"Ad Hoc路由维护的改进","authors":"A. Otakahn, M. Lertwatechakul","doi":"10.1109/ISCIT.2008.4700161","DOIUrl":null,"url":null,"abstract":"Ad Hoc wireless network consists of mobile nodes that do not rely on any fixed network infrastructure. The dynamic route is allocated for a pair of nodes by Ad Hoc on-demand routing protocol (AODV), that establishes a route only when a source node want to transmit data. Routes in Ad Hoc network can be broken caused by a node in the route may move out of their neighbor's signal range or node's battery may be ran out. Many algorithms have been developed to solve the problem [1],[6], one of them is break avoidance algorithm (AODV-BA [1]). However, using AODV-BA protocol, an upstream node of the broken link has to buffer packets during the route maintenance process. In case that the route maintenance is unsuccessful, the source node must re-establish a new route. In this paper, we propose AODV Backup Route Discovery with 2 Levels of Threshold (AODV-2T). The protocol tests for the power of its own battery power and its neighbors' RF signal. And it would cooperate with the neighbors to find a backup route as to fix the weak link problem where the first threshold is met. Consequently, if the power of signal or battery is fallen below the second threshold level, AODV-2T node could switch the data packet transmission to the new route without any delay. AODV-2T can reduce connection tear-off that causes packets lost and more routing control overhead by 15-18 percent compared to the original AODV and AODV-BA.","PeriodicalId":215340,"journal":{"name":"2008 International Symposium on Communications and Information Technologies","volume":"133 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"An Improvement of Ad Hoc Route Maintenance\",\"authors\":\"A. Otakahn, M. Lertwatechakul\",\"doi\":\"10.1109/ISCIT.2008.4700161\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Ad Hoc wireless network consists of mobile nodes that do not rely on any fixed network infrastructure. The dynamic route is allocated for a pair of nodes by Ad Hoc on-demand routing protocol (AODV), that establishes a route only when a source node want to transmit data. Routes in Ad Hoc network can be broken caused by a node in the route may move out of their neighbor's signal range or node's battery may be ran out. Many algorithms have been developed to solve the problem [1],[6], one of them is break avoidance algorithm (AODV-BA [1]). However, using AODV-BA protocol, an upstream node of the broken link has to buffer packets during the route maintenance process. In case that the route maintenance is unsuccessful, the source node must re-establish a new route. In this paper, we propose AODV Backup Route Discovery with 2 Levels of Threshold (AODV-2T). The protocol tests for the power of its own battery power and its neighbors' RF signal. And it would cooperate with the neighbors to find a backup route as to fix the weak link problem where the first threshold is met. Consequently, if the power of signal or battery is fallen below the second threshold level, AODV-2T node could switch the data packet transmission to the new route without any delay. AODV-2T can reduce connection tear-off that causes packets lost and more routing control overhead by 15-18 percent compared to the original AODV and AODV-BA.\",\"PeriodicalId\":215340,\"journal\":{\"name\":\"2008 International Symposium on Communications and Information Technologies\",\"volume\":\"133 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Symposium on Communications and Information Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCIT.2008.4700161\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Communications and Information Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCIT.2008.4700161","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

自组织无线网络由不依赖任何固定网络基础设施的移动节点组成。动态路由是通过Ad Hoc按需路由协议(AODV)为一对节点分配的,只有当源节点需要传输数据时才建立路由。在Ad Hoc网络中,由于路由中的某个节点可能移动到其邻居的信号范围之外或节点的电池电量耗尽,导致路由中断。为了解决这个问题,已经开发了许多算法[1],[6],其中一种是中断避免算法(AODV-BA[1])。但是,使用AODV-BA协议,在路由维护过程中,链路上游节点需要对报文进行缓冲。如果路由维护失败,源节点必须重新建立路由。本文提出了一种基于二级阈值的AODV备份路由发现算法(AODV- 2t)。该协议测试自己的电池电量和邻居的射频信号。在满足第一个阈值的情况下,它会与邻居合作寻找一条备用路由来解决弱链路问题。因此,如果信号或电池的功率低于第二个阈值水平,AODV-2T节点可以毫无延迟地将数据包传输切换到新的路由上。与原始的AODV和AODV- ba相比,AODV- 2t可以减少导致数据包丢失和更多路由控制开销的连接撕裂,减少15- 18%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Improvement of Ad Hoc Route Maintenance
Ad Hoc wireless network consists of mobile nodes that do not rely on any fixed network infrastructure. The dynamic route is allocated for a pair of nodes by Ad Hoc on-demand routing protocol (AODV), that establishes a route only when a source node want to transmit data. Routes in Ad Hoc network can be broken caused by a node in the route may move out of their neighbor's signal range or node's battery may be ran out. Many algorithms have been developed to solve the problem [1],[6], one of them is break avoidance algorithm (AODV-BA [1]). However, using AODV-BA protocol, an upstream node of the broken link has to buffer packets during the route maintenance process. In case that the route maintenance is unsuccessful, the source node must re-establish a new route. In this paper, we propose AODV Backup Route Discovery with 2 Levels of Threshold (AODV-2T). The protocol tests for the power of its own battery power and its neighbors' RF signal. And it would cooperate with the neighbors to find a backup route as to fix the weak link problem where the first threshold is met. Consequently, if the power of signal or battery is fallen below the second threshold level, AODV-2T node could switch the data packet transmission to the new route without any delay. AODV-2T can reduce connection tear-off that causes packets lost and more routing control overhead by 15-18 percent compared to the original AODV and AODV-BA.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信