提高频率分配引擎的效率

G. Wyman, G.R. Bradbeer, S. Hurley, R. Taplin, D.H. Smith
{"title":"提高频率分配引擎的效率","authors":"G. Wyman, G.R. Bradbeer, S. Hurley, R. Taplin, D.H. Smith","doi":"10.1109/MILCOM.2001.985758","DOIUrl":null,"url":null,"abstract":"The electromagnetic spectrum is a limited resource which is rapidly becoming saturated, and with the trend to charge users, efficient use is critical. Military users must react to different allotments and adapt to the prevailing conditions. The objective of using available bandwidth efficiently, while, at the same time, minimising interference, gives rise to a number of variations of a problem usually referred to as the frequency assignment problem (FAP). Many algorithms have been developed in order to produce optimal or near optimal assignments of frequencies to defined sets of transmitters, but it is recognised that rigorous solutions are only possible for a very small population. Early assignment algorithms were limited in their application, constrained by the available processing speed and thus only considered a reduced set of constraints. The authors have developed a system for combat net radio that takes into account these extensions to the standard FAP It was concluded that the most effective algorithms start from a sequential solution and use a meta-heuristic algorithm such as tabu search or simulated annealing to find solutions for large network deployments.","PeriodicalId":136537,"journal":{"name":"2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2001-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Improving efficiency in frequency assignment engines\",\"authors\":\"G. Wyman, G.R. Bradbeer, S. Hurley, R. Taplin, D.H. Smith\",\"doi\":\"10.1109/MILCOM.2001.985758\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The electromagnetic spectrum is a limited resource which is rapidly becoming saturated, and with the trend to charge users, efficient use is critical. Military users must react to different allotments and adapt to the prevailing conditions. The objective of using available bandwidth efficiently, while, at the same time, minimising interference, gives rise to a number of variations of a problem usually referred to as the frequency assignment problem (FAP). Many algorithms have been developed in order to produce optimal or near optimal assignments of frequencies to defined sets of transmitters, but it is recognised that rigorous solutions are only possible for a very small population. Early assignment algorithms were limited in their application, constrained by the available processing speed and thus only considered a reduced set of constraints. The authors have developed a system for combat net radio that takes into account these extensions to the standard FAP It was concluded that the most effective algorithms start from a sequential solution and use a meta-heuristic algorithm such as tabu search or simulated annealing to find solutions for large network deployments.\",\"PeriodicalId\":136537,\"journal\":{\"name\":\"2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-10-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MILCOM.2001.985758\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.2001.985758","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

电磁频谱是一种有限的资源,正迅速趋于饱和,随着向用户收费的趋势,高效利用至关重要。军事用户必须对不同的分配作出反应,并适应当前的条件。有效利用可用带宽的目标,同时,最小化干扰,产生了许多变化的问题,通常称为频率分配问题(FAP)。已经开发了许多算法,以便为定义的发射机组产生最优或接近最优的频率分配,但人们认识到,严格的解决方案仅适用于非常小的群体。早期的分配算法在应用上受到限制,受到可用处理速度的限制,因此只考虑了一组简化的约束。作者已经开发了一个战斗网无线电系统,该系统考虑了标准FAP的这些扩展。结论是,最有效的算法从顺序解开始,并使用元启发式算法(如禁忌搜索或模拟退火)来寻找大型网络部署的解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Improving efficiency in frequency assignment engines
The electromagnetic spectrum is a limited resource which is rapidly becoming saturated, and with the trend to charge users, efficient use is critical. Military users must react to different allotments and adapt to the prevailing conditions. The objective of using available bandwidth efficiently, while, at the same time, minimising interference, gives rise to a number of variations of a problem usually referred to as the frequency assignment problem (FAP). Many algorithms have been developed in order to produce optimal or near optimal assignments of frequencies to defined sets of transmitters, but it is recognised that rigorous solutions are only possible for a very small population. Early assignment algorithms were limited in their application, constrained by the available processing speed and thus only considered a reduced set of constraints. The authors have developed a system for combat net radio that takes into account these extensions to the standard FAP It was concluded that the most effective algorithms start from a sequential solution and use a meta-heuristic algorithm such as tabu search or simulated annealing to find solutions for large network deployments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信