机载因特网中的路由

Daniel Medina, F. Hoffmann, F. Rossetto, C. Rokitansky
{"title":"机载因特网中的路由","authors":"Daniel Medina, F. Hoffmann, F. Rossetto, C. Rokitansky","doi":"10.1109/ICNSURV.2010.5503320","DOIUrl":null,"url":null,"abstract":"The Airborne Internet is envisioned to be a large scale multihop wireless mesh network of civil aviation aircraft connected via long range highly directional air-to-air radio links. We propose a novel geographic load share routing metric to mitigate congestion in this network, taking into account the underlying link scheduling constraints with directional antennas. When forwarding packets for a given destination, a node considers not one but a set of next hop candidates, and spreads traffic among them based on queue dynamics. Our simulations show that introducing this flexibility in the routing function can greatly increase a node's ability to satisfy its bandwidth demands during link scheduling, yielding significant performance improvements in terms of network throughput and average packet delay. The ability to exploit this flexibility depends on the spatial reuse of the underlying network. For the simulated scenario, an increase in network throughput of 200% on average is shown, compared to a state-of-the-art geographic routing algorithm.","PeriodicalId":345677,"journal":{"name":"2010 Integrated Communications, Navigation, and Surveillance Conference Proceedings","volume":"172 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"Routing in the Airborne Internet\",\"authors\":\"Daniel Medina, F. Hoffmann, F. Rossetto, C. Rokitansky\",\"doi\":\"10.1109/ICNSURV.2010.5503320\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Airborne Internet is envisioned to be a large scale multihop wireless mesh network of civil aviation aircraft connected via long range highly directional air-to-air radio links. We propose a novel geographic load share routing metric to mitigate congestion in this network, taking into account the underlying link scheduling constraints with directional antennas. When forwarding packets for a given destination, a node considers not one but a set of next hop candidates, and spreads traffic among them based on queue dynamics. Our simulations show that introducing this flexibility in the routing function can greatly increase a node's ability to satisfy its bandwidth demands during link scheduling, yielding significant performance improvements in terms of network throughput and average packet delay. The ability to exploit this flexibility depends on the spatial reuse of the underlying network. For the simulated scenario, an increase in network throughput of 200% on average is shown, compared to a state-of-the-art geographic routing algorithm.\",\"PeriodicalId\":345677,\"journal\":{\"name\":\"2010 Integrated Communications, Navigation, and Surveillance Conference Proceedings\",\"volume\":\"172 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Integrated Communications, Navigation, and Surveillance Conference Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNSURV.2010.5503320\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Integrated Communications, Navigation, and Surveillance Conference Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNSURV.2010.5503320","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24

摘要

机载互联网被设想为民航飞机的大规模多跳无线网状网络,通过远程高定向空对空无线电链路连接。我们提出了一种新的地理负载共享路由度量来缓解该网络中的拥塞,同时考虑了定向天线的底层链路调度约束。节点在转发给定目的地的数据包时,考虑的不是一个,而是一组候选下一跳,并基于队列动态在候选下一跳之间进行流量分布。我们的模拟表明,在路由功能中引入这种灵活性可以大大提高节点在链路调度期间满足其带宽需求的能力,从而在网络吞吐量和平均数据包延迟方面产生显着的性能改进。利用这种灵活性的能力取决于底层网络的空间重用。对于模拟场景,与最先进的地理路由算法相比,网络吞吐量平均增加了200%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Routing in the Airborne Internet
The Airborne Internet is envisioned to be a large scale multihop wireless mesh network of civil aviation aircraft connected via long range highly directional air-to-air radio links. We propose a novel geographic load share routing metric to mitigate congestion in this network, taking into account the underlying link scheduling constraints with directional antennas. When forwarding packets for a given destination, a node considers not one but a set of next hop candidates, and spreads traffic among them based on queue dynamics. Our simulations show that introducing this flexibility in the routing function can greatly increase a node's ability to satisfy its bandwidth demands during link scheduling, yielding significant performance improvements in terms of network throughput and average packet delay. The ability to exploit this flexibility depends on the spatial reuse of the underlying network. For the simulated scenario, an increase in network throughput of 200% on average is shown, compared to a state-of-the-art geographic routing algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信