一种用于manet中路径发现的定向八卦协议

R. Beraldi
{"title":"一种用于manet中路径发现的定向八卦协议","authors":"R. Beraldi","doi":"10.1109/ICDCSW.2006.6","DOIUrl":null,"url":null,"abstract":"In this paper we present a gossip based protocol for path discovery in Mobile Ad Hoc Networks (MANETs). While in the classical gossip algorithm each node forwards a packet with the same probability, our proposal is characterized by a variable gossiping probability, which is high enough only for sustaining the spreading process towards the destination. No external location service, e.g. via GPS, is required to determine the gossip probability at each node; rather, the estimation is done from the \"inside\" of the network by using periodic beacons. The paper reports a simulation study and a mathematical model for better understanding the property of the directional gossip process.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"320 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A directional gossip protocol for path discovery in MANETs\",\"authors\":\"R. Beraldi\",\"doi\":\"10.1109/ICDCSW.2006.6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we present a gossip based protocol for path discovery in Mobile Ad Hoc Networks (MANETs). While in the classical gossip algorithm each node forwards a packet with the same probability, our proposal is characterized by a variable gossiping probability, which is high enough only for sustaining the spreading process towards the destination. No external location service, e.g. via GPS, is required to determine the gossip probability at each node; rather, the estimation is done from the \\\"inside\\\" of the network by using periodic beacons. The paper reports a simulation study and a mathematical model for better understanding the property of the directional gossip process.\",\"PeriodicalId\":333505,\"journal\":{\"name\":\"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)\",\"volume\":\"320 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDCSW.2006.6\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCSW.2006.6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

本文提出了一种基于八卦的移动自组织网络(manet)路径发现协议。在经典的八卦算法中,每个节点以相同的概率转发数据包,而我们的提议具有可变的八卦概率,该概率仅足以维持向目的地的传播过程。不需要外部位置服务(例如通过GPS)来确定每个节点的八卦概率;相反,通过使用周期性信标,从网络的“内部”进行估计。为了更好地理解定向杂音过程的性质,本文报道了一项仿真研究和一个数学模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A directional gossip protocol for path discovery in MANETs
In this paper we present a gossip based protocol for path discovery in Mobile Ad Hoc Networks (MANETs). While in the classical gossip algorithm each node forwards a packet with the same probability, our proposal is characterized by a variable gossiping probability, which is high enough only for sustaining the spreading process towards the destination. No external location service, e.g. via GPS, is required to determine the gossip probability at each node; rather, the estimation is done from the "inside" of the network by using periodic beacons. The paper reports a simulation study and a mathematical model for better understanding the property of the directional gossip process.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信