Optimized local route repair and congestion control in Mobile Ad hoc Network

P. Ranjan, R. L. Velusamy
{"title":"Optimized local route repair and congestion control in Mobile Ad hoc Network","authors":"P. Ranjan, R. L. Velusamy","doi":"10.1109/ICCCT2.2015.7292770","DOIUrl":null,"url":null,"abstract":"Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes which are autonomous, self organized and dynamic in nature. In this network due to mobility nodes are moving randomly, resulting in topology change. This topology change leads to frequent breakage of link. To repair the broken link AODV and DSR uses broadcasting mechanism. Broadcasting floods control packets. Flooding results in congestion due to limited buffer space, bandwidth, and battery power of mobile nodes. Congestion leads to dropping of packets resulting in decrease of network performance. Congestion can be avoided if the numbers of control packets are reduced. In this paper a new algorithm is proposed which avoid the congestion and repair the broken link by choosing a set of limited nodes for alternate route based on the quadrant position, battery status, queue length, and forwarding region. The proposed solution is termed as Improved Optimum Angle Selection AODV (IOAS-AODV) routing algorithm. This proposed solution is implemented, tested and the performance is analyzed. From the results it is observed that the proposed solution improves the routing performance such as throughput, end to end delay, routing overhead, and packet delivery ratio.","PeriodicalId":410045,"journal":{"name":"2015 International Conference on Computing and Communications Technologies (ICCCT)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Computing and Communications Technologies (ICCCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCT2.2015.7292770","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes which are autonomous, self organized and dynamic in nature. In this network due to mobility nodes are moving randomly, resulting in topology change. This topology change leads to frequent breakage of link. To repair the broken link AODV and DSR uses broadcasting mechanism. Broadcasting floods control packets. Flooding results in congestion due to limited buffer space, bandwidth, and battery power of mobile nodes. Congestion leads to dropping of packets resulting in decrease of network performance. Congestion can be avoided if the numbers of control packets are reduced. In this paper a new algorithm is proposed which avoid the congestion and repair the broken link by choosing a set of limited nodes for alternate route based on the quadrant position, battery status, queue length, and forwarding region. The proposed solution is termed as Improved Optimum Angle Selection AODV (IOAS-AODV) routing algorithm. This proposed solution is implemented, tested and the performance is analyzed. From the results it is observed that the proposed solution improves the routing performance such as throughput, end to end delay, routing overhead, and packet delivery ratio.
移动自组网中优化的本地路由修复和拥塞控制
移动自组织网络(MANET)是一组具有自治、自组织和动态特性的无线移动节点的集合。在这种网络中,由于节点的移动是随机的,导致拓扑结构的变化。这种拓扑变化导致链路频繁中断。为了修复断开的链路,AODV和DSR采用广播机制。广播泛洪控制报文。由于移动节点的缓冲空间、带宽和电池电量有限,泛洪会导致拥塞。拥塞会导致丢包,导致网络性能下降。减少控制报文的数量可以避免拥塞。本文提出了一种基于象限位置、电池状态、队列长度和转发区域选择一组有限节点作为备选路由来避免拥塞和修复断开链路的新算法。提出了一种改进的最优角度选择AODV (IOAS-AODV)路由算法。本文对该方案进行了实现、测试和性能分析。结果表明,该方案提高了路由性能,如吞吐量、端到端延迟、路由开销和分组分发率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信