jn HCB频率分配

Peng Wang, B. Henz
{"title":"jn HCB频率分配","authors":"Peng Wang, B. Henz","doi":"10.1109/SARNOF.2018.8720489","DOIUrl":null,"url":null,"abstract":"Joint Aerial Layered Network (JALN) could provide crucial communication links when milsatcoms are degraded or lost. Antenna assignment problem for JALN High Capacity Backbone (HCB) has been studied in [1], [2] where each JALN aircraft has four mounting points for directional antennas. Another resource allocation problem arising is that how we can efficiently assign the frequencies to JALN HCB. Two-way traffic through a link is assigned to two disjoint frequency bands. Frequency Division Multiplexing Access (FDMA) is used to share bandwidth and avoid the interference among multiple transceivers on a single aerial platform. Two Frequency Assignment Problems (FAP) are considered in this work, which are called MMC-FAP and MS-FAP. MMC-FAP is to Minimize the frequency usage of the Most Congested aerial platform while accommodating the offered traffic demands and without violating the frequency constraints. MS-FAP is to Minimize the frequency Span in both frequency bands. By exploiting problem-specific properties, MMC-FAP can be formulated as a Mixed Integer Linear Programming (MILP) problem, which has a tight constraint space by explicitly finding all maximal cliques in the conflict graph. Then, binary search strategy is used to find an optimal solution of MS-FAP problem while MMC-FAP occurs as a sub-problem. Numerical experiments are used to show the performance of the proposed approach.","PeriodicalId":430928,"journal":{"name":"2018 IEEE 39th Sarnoff Symposium","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Frequency Assignment for JALN HCB\",\"authors\":\"Peng Wang, B. Henz\",\"doi\":\"10.1109/SARNOF.2018.8720489\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Joint Aerial Layered Network (JALN) could provide crucial communication links when milsatcoms are degraded or lost. Antenna assignment problem for JALN High Capacity Backbone (HCB) has been studied in [1], [2] where each JALN aircraft has four mounting points for directional antennas. Another resource allocation problem arising is that how we can efficiently assign the frequencies to JALN HCB. Two-way traffic through a link is assigned to two disjoint frequency bands. Frequency Division Multiplexing Access (FDMA) is used to share bandwidth and avoid the interference among multiple transceivers on a single aerial platform. Two Frequency Assignment Problems (FAP) are considered in this work, which are called MMC-FAP and MS-FAP. MMC-FAP is to Minimize the frequency usage of the Most Congested aerial platform while accommodating the offered traffic demands and without violating the frequency constraints. MS-FAP is to Minimize the frequency Span in both frequency bands. By exploiting problem-specific properties, MMC-FAP can be formulated as a Mixed Integer Linear Programming (MILP) problem, which has a tight constraint space by explicitly finding all maximal cliques in the conflict graph. Then, binary search strategy is used to find an optimal solution of MS-FAP problem while MMC-FAP occurs as a sub-problem. Numerical experiments are used to show the performance of the proposed approach.\",\"PeriodicalId\":430928,\"journal\":{\"name\":\"2018 IEEE 39th Sarnoff Symposium\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 39th Sarnoff Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SARNOF.2018.8720489\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 39th Sarnoff Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SARNOF.2018.8720489","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

联合空中分层网络(JALN)可以在军事卫星通信降级或丢失时提供关键的通信链路。[1],[2]研究了JALN高容量骨干网(HCB)的天线分配问题,其中每架JALN飞机有四个定向天线安装点。出现的另一个资源分配问题是我们如何有效地将频率分配给jann HCB。通过一条链路的双向业务被分配到两个不相交的频段。频分复用(Frequency Division Multiplexing Access, FDMA)是一种用于共享带宽和避免在一个空中平台上多个收发器之间相互干扰的技术。本文研究了MMC-FAP和MS-FAP两个频率分配问题。MMC-FAP是在不违反频率限制的情况下,尽量减少最拥挤空中平台的频率使用,同时适应提供的交通需求。MS-FAP是最小化两个频段的频率跨度。通过利用问题特定的性质,MMC-FAP可以被表述为一个混合整数线性规划(MILP)问题,该问题通过显式地找到冲突图中的所有最大团,具有严格的约束空间。然后,采用二分搜索策略寻找MS-FAP问题的最优解,而MMC-FAP作为子问题出现。数值实验验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Frequency Assignment for JALN HCB
Joint Aerial Layered Network (JALN) could provide crucial communication links when milsatcoms are degraded or lost. Antenna assignment problem for JALN High Capacity Backbone (HCB) has been studied in [1], [2] where each JALN aircraft has four mounting points for directional antennas. Another resource allocation problem arising is that how we can efficiently assign the frequencies to JALN HCB. Two-way traffic through a link is assigned to two disjoint frequency bands. Frequency Division Multiplexing Access (FDMA) is used to share bandwidth and avoid the interference among multiple transceivers on a single aerial platform. Two Frequency Assignment Problems (FAP) are considered in this work, which are called MMC-FAP and MS-FAP. MMC-FAP is to Minimize the frequency usage of the Most Congested aerial platform while accommodating the offered traffic demands and without violating the frequency constraints. MS-FAP is to Minimize the frequency Span in both frequency bands. By exploiting problem-specific properties, MMC-FAP can be formulated as a Mixed Integer Linear Programming (MILP) problem, which has a tight constraint space by explicitly finding all maximal cliques in the conflict graph. Then, binary search strategy is used to find an optimal solution of MS-FAP problem while MMC-FAP occurs as a sub-problem. Numerical experiments are used to show the performance of the proposed approach.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信