基于位置外推的无线机会网络中高效可靠的传播

A. Agbaria, R. Friedman
{"title":"基于位置外推的无线机会网络中高效可靠的传播","authors":"A. Agbaria, R. Friedman","doi":"10.1145/1755743.1755762","DOIUrl":null,"url":null,"abstract":"Data dissemination is an important service in ad-hoc networks. This work presents a novel approach that utilizes the positioning information and the velocity vector of the immediate neighbors at every node to extrapolate the geographic location of the surrounding nodes at any time in order to obtain efficient dissemination trees with low control overhead. The paper includes an extensive simulation study that compares our approach to other representative overlay and probabilistic forwarding approaches. It is shown that our approach behaves similar or better than the other approaches, and is especially useful in the following challenging environments: the message sizes are large, the network is dense, and nodes are highly mobile. Therefore, we believe that this protocol is appropriate for opportunistic networks.","PeriodicalId":198518,"journal":{"name":"International Workshop on Mobile Opportunistic Networks","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Efficient and reliable dissemination in wireless opportunistic networks by location extrapolation\",\"authors\":\"A. Agbaria, R. Friedman\",\"doi\":\"10.1145/1755743.1755762\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data dissemination is an important service in ad-hoc networks. This work presents a novel approach that utilizes the positioning information and the velocity vector of the immediate neighbors at every node to extrapolate the geographic location of the surrounding nodes at any time in order to obtain efficient dissemination trees with low control overhead. The paper includes an extensive simulation study that compares our approach to other representative overlay and probabilistic forwarding approaches. It is shown that our approach behaves similar or better than the other approaches, and is especially useful in the following challenging environments: the message sizes are large, the network is dense, and nodes are highly mobile. Therefore, we believe that this protocol is appropriate for opportunistic networks.\",\"PeriodicalId\":198518,\"journal\":{\"name\":\"International Workshop on Mobile Opportunistic Networks\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-02-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Workshop on Mobile Opportunistic Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1755743.1755762\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Mobile Opportunistic Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1755743.1755762","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

数据分发是自组织网络中的一项重要业务。本文提出了一种新的方法,利用每个节点的定位信息和相邻节点的速度矢量,随时推断周围节点的地理位置,以获得低控制开销的高效传播树。本文包括一个广泛的模拟研究,比较我们的方法与其他代表性的覆盖和概率转发方法。结果表明,我们的方法表现得与其他方法相似或更好,并且在以下具有挑战性的环境中特别有用:消息大小大,网络密集,节点高度移动。因此,我们认为该协议适用于机会主义网络。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient and reliable dissemination in wireless opportunistic networks by location extrapolation
Data dissemination is an important service in ad-hoc networks. This work presents a novel approach that utilizes the positioning information and the velocity vector of the immediate neighbors at every node to extrapolate the geographic location of the surrounding nodes at any time in order to obtain efficient dissemination trees with low control overhead. The paper includes an extensive simulation study that compares our approach to other representative overlay and probabilistic forwarding approaches. It is shown that our approach behaves similar or better than the other approaches, and is especially useful in the following challenging environments: the message sizes are large, the network is dense, and nodes are highly mobile. Therefore, we believe that this protocol is appropriate for opportunistic networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信