Use of dynamic flight paths to enhance support to priority subscribers on a communications UAV

P. Charlesworth, S. M. Allen
{"title":"Use of dynamic flight paths to enhance support to priority subscribers on a communications UAV","authors":"P. Charlesworth, S. M. Allen","doi":"10.1109/MILCOM.2012.6415606","DOIUrl":null,"url":null,"abstract":"Airborne communications nodes are often proposed as a component in future communications networks. This paper proposes that, in any ground network served by such a node, there is an optimum location for an airborne communications node. The paper examines the example of a Medium Altitude/Long Endurance (MALE) UAV carrying an airborne communications node which supports a community of mobile subscribers. Consider the case of a power-limited communications payload being flown on a UAV in support of a large community of mobile subscribers. Each subscriber is connected to the UAV payload by a two-way radio link. Radio links are only activated when there is traffic to be exchanged, thus the RF power demanded from the payload is changing regularly. An algorithm has been developed which attempts to maximize coverage of the subscriber community by moving the UAV between waypoints at which coverage is maximized. The algorithm, called Select Locally Optimum Waypoints (SLOW), estimates the future locations of subscribers from historic traffic and location data, and uses this information to move to waypoints at which the greatest number of links can be supported within the available RF power, and to the required signal quality. This improves the overall coverage of the subscriber community. This paper considers the performance of the algorithm in different conditions. Initially the performance of the algorithm is assessed against the maximum RF power available from the payload. The paper considers the case where all subscribers are given equal weighting, and then addresses the case where 20% of subscribers are given priority access to the payload. The paper also considers how the algorithm responds to different traffic patterns and concludes with a brief assessment of the airspace implications of allowing the UAV to track the mobile subscribers.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"16 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"MILCOM 2012 - 2012 IEEE Military Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.2012.6415606","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Airborne communications nodes are often proposed as a component in future communications networks. This paper proposes that, in any ground network served by such a node, there is an optimum location for an airborne communications node. The paper examines the example of a Medium Altitude/Long Endurance (MALE) UAV carrying an airborne communications node which supports a community of mobile subscribers. Consider the case of a power-limited communications payload being flown on a UAV in support of a large community of mobile subscribers. Each subscriber is connected to the UAV payload by a two-way radio link. Radio links are only activated when there is traffic to be exchanged, thus the RF power demanded from the payload is changing regularly. An algorithm has been developed which attempts to maximize coverage of the subscriber community by moving the UAV between waypoints at which coverage is maximized. The algorithm, called Select Locally Optimum Waypoints (SLOW), estimates the future locations of subscribers from historic traffic and location data, and uses this information to move to waypoints at which the greatest number of links can be supported within the available RF power, and to the required signal quality. This improves the overall coverage of the subscriber community. This paper considers the performance of the algorithm in different conditions. Initially the performance of the algorithm is assessed against the maximum RF power available from the payload. The paper considers the case where all subscribers are given equal weighting, and then addresses the case where 20% of subscribers are given priority access to the payload. The paper also considers how the algorithm responds to different traffic patterns and concludes with a brief assessment of the airspace implications of allowing the UAV to track the mobile subscribers.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用动态飞行路径增强对通信无人机上优先用户的支持
机载通信节点经常被提议作为未来通信网络的一个组成部分。本文提出,在任何由这种节点服务的地面网络中,都存在一个机载通信节点的最优位置。本文研究了一种携带机载通信节点的中高空/长航时(MALE)无人机的例子,该节点支持一个移动用户社区。考虑在无人机上飞行功率有限的通信有效载荷以支持大型移动用户社区的情况。每个用户通过双向无线电链路连接到无人机有效载荷。无线电链路只有在有通信要交换时才会被激活,因此负载所需的射频功率是有规律地变化的。已经开发了一种算法,该算法通过在覆盖最大化的航路点之间移动无人机来尝试最大化用户社区的覆盖。该算法被称为选择局部最优路径点(SLOW),它根据历史流量和位置数据估计用户的未来位置,并利用这些信息移动到可用射频功率范围内可支持最大数量链路的路径点,并达到所需的信号质量。这提高了订户社区的总体覆盖率。本文考虑了该算法在不同条件下的性能。最初,算法的性能是根据有效载荷提供的最大射频功率进行评估的。本文考虑了所有订阅者被赋予相同权重的情况,然后讨论了20%的订阅者被赋予优先访问负载的情况。本文还考虑了该算法如何响应不同的流量模式,并对允许无人机跟踪移动用户的空域影响进行了简要评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An Open Standard for Ka-band Interoperable Satellite Antennas An approach to data correlation using JC3IEDM model The U.s. Army and Network-centric Warfare a Thematic Analysis of the Literature Technology diffusion and military users: Perceptions that predict adoption Cooperative Multi-tree Sleep Scheduling for Surveillance in Wireless Sensor Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1