贪婪地理转发在无人航空Ad-Hoc网络中的性能

R. Shirani, M. St-Hilaire, T. Kunz, Yifeng Zhou, Jun Li, L. Lamont
{"title":"贪婪地理转发在无人航空Ad-Hoc网络中的性能","authors":"R. Shirani, M. St-Hilaire, T. Kunz, Yifeng Zhou, Jun Li, L. Lamont","doi":"10.1109/CNSR.2011.31","DOIUrl":null,"url":null,"abstract":"The availability of accurate location information (for airborne purposes) in unmanned aeronautical ad-hoc networks (UAANETs) makes it possible to deploy geographic routing mechanisms as the main communication protocol in such networks. However, the performance of geographic routing is not obvious, especially for sparse networks (i.e., networks with low connectivity levels). In this paper, the main goal is to explore the effects of network sparsity on the performance of greedy geographic forwarding and to determine in different scenarios the percentage of source-destination pairs that can successfully establish communication based on greedy geographic forwarding only. To that end, Monte Carlo simulations have been performed to collect statistics in estimating the performance of UAANETs in sparse situations. Simulation results show that greedy geographic forwarding can be used for less critical applications of UAANETs. However, for applications with guaranteed delivery requirements, other alternatives should be combined with greedy geographic forwarding.","PeriodicalId":272359,"journal":{"name":"2011 Ninth Annual Communication Networks and Services Research Conference","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"59","resultStr":"{\"title\":\"The Performance of Greedy Geographic Forwarding in Unmanned Aeronautical Ad-Hoc Networks\",\"authors\":\"R. Shirani, M. St-Hilaire, T. Kunz, Yifeng Zhou, Jun Li, L. Lamont\",\"doi\":\"10.1109/CNSR.2011.31\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The availability of accurate location information (for airborne purposes) in unmanned aeronautical ad-hoc networks (UAANETs) makes it possible to deploy geographic routing mechanisms as the main communication protocol in such networks. However, the performance of geographic routing is not obvious, especially for sparse networks (i.e., networks with low connectivity levels). In this paper, the main goal is to explore the effects of network sparsity on the performance of greedy geographic forwarding and to determine in different scenarios the percentage of source-destination pairs that can successfully establish communication based on greedy geographic forwarding only. To that end, Monte Carlo simulations have been performed to collect statistics in estimating the performance of UAANETs in sparse situations. Simulation results show that greedy geographic forwarding can be used for less critical applications of UAANETs. However, for applications with guaranteed delivery requirements, other alternatives should be combined with greedy geographic forwarding.\",\"PeriodicalId\":272359,\"journal\":{\"name\":\"2011 Ninth Annual Communication Networks and Services Research Conference\",\"volume\":\"75 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"59\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Ninth Annual Communication Networks and Services Research Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CNSR.2011.31\",\"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 Ninth Annual Communication Networks and Services Research Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CNSR.2011.31","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 59

摘要

在无人航空自组织网络(uaanet)中精确位置信息(用于机载目的)的可用性使得在此类网络中部署地理路由机制作为主要通信协议成为可能。然而,地理路由的性能并不明显,特别是对于稀疏网络(即低连接水平的网络)。本文的主要目标是探讨网络稀疏度对贪婪地理转发性能的影响,并确定在不同场景下,仅基于贪婪地理转发就能成功建立通信的源-目的对的百分比。为此,进行了蒙特卡罗模拟,以收集估计稀疏情况下uaanet性能的统计数据。仿真结果表明,贪婪地理转发可以用于不太关键的uaanet应用。然而,对于有保证交付需求的应用程序,其他替代方案应与贪婪地理转发相结合。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The Performance of Greedy Geographic Forwarding in Unmanned Aeronautical Ad-Hoc Networks
The availability of accurate location information (for airborne purposes) in unmanned aeronautical ad-hoc networks (UAANETs) makes it possible to deploy geographic routing mechanisms as the main communication protocol in such networks. However, the performance of geographic routing is not obvious, especially for sparse networks (i.e., networks with low connectivity levels). In this paper, the main goal is to explore the effects of network sparsity on the performance of greedy geographic forwarding and to determine in different scenarios the percentage of source-destination pairs that can successfully establish communication based on greedy geographic forwarding only. To that end, Monte Carlo simulations have been performed to collect statistics in estimating the performance of UAANETs in sparse situations. Simulation results show that greedy geographic forwarding can be used for less critical applications of UAANETs. However, for applications with guaranteed delivery requirements, other alternatives should be combined with greedy geographic forwarding.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信