{"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}
引用次数: 0
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.