G. Wyman, G.R. Bradbeer, S. Hurley, R. Taplin, D.H. Smith
{"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":"88 1","pages":"0"},"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}
引用次数: 0
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.