一种改进的移动自组网概率协议

Shibao Li, Li Lou, Li Hong
{"title":"一种改进的移动自组网概率协议","authors":"Shibao Li, Li Lou, Li Hong","doi":"10.1109/ICSPCC.2013.6663927","DOIUrl":null,"url":null,"abstract":"This paper proposes an improved AODV protocol with probabilistic forwarding by means of encounter records (ERPP-AODV) in Mobile Ad Hoc Networks (MANETs). With the help of encounter records, the broadcast is mainly restricted in the direction to destination node predicted by searching the node more recently encountered it. The forwarding probability is set dynamically based on the density of the nodes encountered destination. The simulation results show that our proposed protocol reduce the routing overhead and demonstrates good performance in other aspects.","PeriodicalId":124509,"journal":{"name":"2013 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2013)","volume":"432 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An improved probabilistic protocol for Mobile Ad Hoc Networks\",\"authors\":\"Shibao Li, Li Lou, Li Hong\",\"doi\":\"10.1109/ICSPCC.2013.6663927\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes an improved AODV protocol with probabilistic forwarding by means of encounter records (ERPP-AODV) in Mobile Ad Hoc Networks (MANETs). With the help of encounter records, the broadcast is mainly restricted in the direction to destination node predicted by searching the node more recently encountered it. The forwarding probability is set dynamically based on the density of the nodes encountered destination. The simulation results show that our proposed protocol reduce the routing overhead and demonstrates good performance in other aspects.\",\"PeriodicalId\":124509,\"journal\":{\"name\":\"2013 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2013)\",\"volume\":\"432 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2013)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSPCC.2013.6663927\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2013)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSPCC.2013.6663927","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种基于相遇记录的概率转发改进的移动自组织网络(manet) AODV协议(ERPP-AODV)。借助遇到记录,通过搜索最近遇到的节点,将广播主要限制在预测的目标节点方向上。转发概率根据所遇到目的地节点的密度动态设置。仿真结果表明,该协议减少了路由开销,并在其他方面表现出良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An improved probabilistic protocol for Mobile Ad Hoc Networks
This paper proposes an improved AODV protocol with probabilistic forwarding by means of encounter records (ERPP-AODV) in Mobile Ad Hoc Networks (MANETs). With the help of encounter records, the broadcast is mainly restricted in the direction to destination node predicted by searching the node more recently encountered it. The forwarding probability is set dynamically based on the density of the nodes encountered destination. The simulation results show that our proposed protocol reduce the routing overhead and demonstrates good performance in other aspects.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信