Optimization of DSR routing protocol in MANET using passive clustering

Amit Barve, Ashwin Kini, Onkar Ekbote, J. Abraham
{"title":"Optimization of DSR routing protocol in MANET using passive clustering","authors":"Amit Barve, Ashwin Kini, Onkar Ekbote, J. Abraham","doi":"10.1109/CCINTELS.2016.7878193","DOIUrl":null,"url":null,"abstract":"Routing algorithms in Mobile Ad hoc Networks like DSR, AODV use flooding as the primary mechanism for discovery of routes in the network. In flooding, each node forwards flood packets to its neighbors so as to ensure that the packets reach the intended destination. Forwarding of redundant flood packets create extra overhead on network bandwidth. However, only a subset of nodes need to forward the packet to make it reach its destination. Clustering has been proven as an efficient mechanism to reduce flooding overhead in MANETs. Active Clustering algorithms use explicit control packets to create and maintain clusters whereas passive clustering piggybacks the control information in the outgoing data packets thus significantly reducing control overhead. The proposed algorithm integrates Passive Clustering with DSR routing protocol. Route Discovery phase of DSR floods the Route Request packets in the entire network. However, the proposed algorithm creates the clusters in the network in the initial phase of Route Discovery process and once the clusters are formed only a subset of nodes will forward the Route Request packets. This approach reduces the overhead on bandwidth by curtailing the flooding of packets and thereby increasing the packet delivery ratio. The simulation results show that optimized DSR algorithm enhances the packet delivery ratio by minimum of 20% and reduces the RREQ flooding by a minimum of 30%.","PeriodicalId":158982,"journal":{"name":"2016 2nd International Conference on Communication Control and Intelligent Systems (CCIS)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 2nd International Conference on Communication Control and Intelligent Systems (CCIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCINTELS.2016.7878193","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

Routing algorithms in Mobile Ad hoc Networks like DSR, AODV use flooding as the primary mechanism for discovery of routes in the network. In flooding, each node forwards flood packets to its neighbors so as to ensure that the packets reach the intended destination. Forwarding of redundant flood packets create extra overhead on network bandwidth. However, only a subset of nodes need to forward the packet to make it reach its destination. Clustering has been proven as an efficient mechanism to reduce flooding overhead in MANETs. Active Clustering algorithms use explicit control packets to create and maintain clusters whereas passive clustering piggybacks the control information in the outgoing data packets thus significantly reducing control overhead. The proposed algorithm integrates Passive Clustering with DSR routing protocol. Route Discovery phase of DSR floods the Route Request packets in the entire network. However, the proposed algorithm creates the clusters in the network in the initial phase of Route Discovery process and once the clusters are formed only a subset of nodes will forward the Route Request packets. This approach reduces the overhead on bandwidth by curtailing the flooding of packets and thereby increasing the packet delivery ratio. The simulation results show that optimized DSR algorithm enhances the packet delivery ratio by minimum of 20% and reduces the RREQ flooding by a minimum of 30%.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于被动聚类的MANET中DSR路由协议优化
移动自组织网络中的路由算法(如DSR、AODV)使用泛洪作为网络中路由发现的主要机制。在泛洪中,每个节点将泛洪报文转发给相邻节点,以确保报文到达预定的目的地。转发冗余的flood报文会增加网络带宽开销。但是,只有一部分节点需要转发数据包以使其到达目的地。聚类已被证明是一种有效的机制,以减少泛洪开销在manet。主动聚类算法使用显式控制数据包来创建和维护集群,而被动聚类则在传出数据包中承载控制信息,从而大大减少了控制开销。该算法将被动聚类与DSR路由协议相结合。DSR的路由发现阶段将路由请求报文在整个网络中扩散。然而,该算法在路由发现过程的初始阶段在网络中创建集群,一旦集群形成,只有一部分节点将转发路由请求数据包。这种方法减少了数据包的泛滥,从而提高了数据包的传送率,从而减少了带宽开销。仿真结果表明,优化后的DSR算法使分组投递率提高了至少20%,使RREQ泛洪降低了至少30%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
60 Gbps transmission with reduced power and lower frequency in lightwave systems using negative dispersion optical fiber Design, fabrication and evaluation of low density, broadband microwave absorbing composite for X & Ku band Biometric personal identification system using biomedical sensors Automatic age detection based on facial images A 40 nm CMOS V-band VCO with on-chip body bias voltage control technique
×
引用
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