基于AODV和DSDV的高效节能自适应路由协议(EPSAR):仿真与可行性分析

A. Jangra, N. Goel, Priyanka
{"title":"基于AODV和DSDV的高效节能自适应路由协议(EPSAR):仿真与可行性分析","authors":"A. Jangra, N. Goel, Priyanka","doi":"10.1109/IPTC.2011.13","DOIUrl":null,"url":null,"abstract":"Mobile ad hoc network especially follows multihopping mechanism for routing to make a path from source to destination. If we have a sound and solid routing path that would be efficient, reliable and adaptable to the different scenarios of network too by following the next hop mechanism and also should be the farthest node with in the cluster then we could achieve better performance by the network. This paper gives more emphasis on the same phenomenon by simulating the protocol EPSAR over ADOV (reactive) and DSDV (proactive) existing protocol and also elaborates the mobility issue. This paper also presents the couple of simulations of EPSAR over multiple network (i.e. grows in terms of number of node) and also examines the performance and the feasibility of EPSAR by considering the different network parameters i.e. Data Packet sent, Delivery Ratio and End-to-End Delay.","PeriodicalId":388589,"journal":{"name":"2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing","volume":"115 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Efficient Power Saving Adaptive Routing Protocol (EPSAR) for MANETs Using AODV and DSDV: Simulation and Feasibility Analysis\",\"authors\":\"A. Jangra, N. Goel, Priyanka\",\"doi\":\"10.1109/IPTC.2011.13\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mobile ad hoc network especially follows multihopping mechanism for routing to make a path from source to destination. If we have a sound and solid routing path that would be efficient, reliable and adaptable to the different scenarios of network too by following the next hop mechanism and also should be the farthest node with in the cluster then we could achieve better performance by the network. This paper gives more emphasis on the same phenomenon by simulating the protocol EPSAR over ADOV (reactive) and DSDV (proactive) existing protocol and also elaborates the mobility issue. This paper also presents the couple of simulations of EPSAR over multiple network (i.e. grows in terms of number of node) and also examines the performance and the feasibility of EPSAR by considering the different network parameters i.e. Data Packet sent, Delivery Ratio and End-to-End Delay.\",\"PeriodicalId\":388589,\"journal\":{\"name\":\"2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing\",\"volume\":\"115 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPTC.2011.13\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPTC.2011.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

特别是移动自组织网络采用多跳机制进行路由,形成从源到目的的路径。如果我们遵循下一跳机制,有一个高效、可靠、适应不同网络场景的路由路径,并且应该是集群中距离最远的节点,那么我们就可以实现更好的网络性能。本文通过在现有的ADOV (reactive)和DSDV (proactive)协议上模拟EPSAR协议,重点讨论了这一现象,并详细阐述了移动性问题。本文还介绍了EPSAR在多个网络(即随着节点数量的增长)上的几个仿真,并通过考虑不同的网络参数(即数据包发送、传输比和端到端延迟)来检验EPSAR的性能和可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Efficient Power Saving Adaptive Routing Protocol (EPSAR) for MANETs Using AODV and DSDV: Simulation and Feasibility Analysis
Mobile ad hoc network especially follows multihopping mechanism for routing to make a path from source to destination. If we have a sound and solid routing path that would be efficient, reliable and adaptable to the different scenarios of network too by following the next hop mechanism and also should be the farthest node with in the cluster then we could achieve better performance by the network. This paper gives more emphasis on the same phenomenon by simulating the protocol EPSAR over ADOV (reactive) and DSDV (proactive) existing protocol and also elaborates the mobility issue. This paper also presents the couple of simulations of EPSAR over multiple network (i.e. grows in terms of number of node) and also examines the performance and the feasibility of EPSAR by considering the different network parameters i.e. Data Packet sent, Delivery Ratio and End-to-End Delay.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A New Method for Impossible Differential Cryptanalysis of 7-Round AES-192 Automatic Summarization for Chinese Text Based on Sub Topic Partition and Sentence Features The Color Components' Exchanging on Different Color Spaces and the Using for Image Segmentation An Improved Multi-objective Population Migration Optimization Algorithm The Application of MapReduce in the Cloud Computing
×
引用
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