Национальный цифровой ресурс Руконт - межотраслевая электронная библиотека (ЭБС) на базе технологии Контекстум (всего произведений: 634757)
Контекстум
.
Информационно-управляющие системы  / №3 2016

HEURISTICS OF CHANNEL ALLOCATION IN RADIO NETWORKS (160,00 руб.)

0   0
Первый авторLyandres Vladimir
Страниц4
ID384677
АннотацияAny radio network (cell) providing service to a geographical region is associated with certain interference environment described by so-called compatibility matrix which, in turn, defines the required frequency limitations between separate cells. An engineering approach to fixed channel allocation (frequency planning) could be described as a trial to find such a frequency plan which would satisfy all the matrix constraints and would have the shortest width (span). The combinatorial nature of this problem makes it unrealistic to obtain the optimal solution. The only way to solve it is to use a certain set of heuristic algorithms based on the features of the compatibility matrix.
УДК621.396
Lyandres, V. HEURISTICS OF CHANNEL ALLOCATION IN RADIO NETWORKS / V. Lyandres // Информационно-управляющие системы .— 2016 .— №3 .— С. 49-52 .— URL: https://rucont.ru/efd/384677 (дата обращения: 25.04.2024)

Предпросмотр (выдержки из произведения)

МОДЕЛИРОВАНИЕ СИСТЕМ И ПРОЦЕССОВ UDC 621.396 doi:10.15217/issn1684-8853.2016.3.47 HEURISTICS OF CHANNEL ALLOCATION IN RADIO NETWORKS Vladimir Lyandresa, PhD, Professor, lyandres@ee.bgu.ac.il aBen-Gurion University of the Negev, POB 653, 1, Ben Gurion St., Beer Sheva, 74105, Israel environment described by so-called compatibility matrix which, in turn, defines the required frequency limitations between separate cells. <...> An engineering approach to fixed channel allocation (frequency planning) could be described as a trial to find such a frequency plan which would satisfy all the matrix constraints and would have the shortest width (span). <...> The combinatorial nature of this problem makes it unrealistic to obtain the optimal solution. <...> The only way to solve it is to use a certain set of heuristic algorithms based on the features of the compatibility matrix. <...> They all implement sequential trials to assign frequencies to networks, according to a certain ordering of the latter. <...> As the tools for achieving an "almost best" frequency plan, i.e. the lower bound of its span, two adaptive random search algorithms were proposed and tested. <...> The proposed adaptive random search algorithms provide that the frequency planning system is estimated to be close to "almost optimal". <...> Practical relevance: Real frequency assignment problems should be solved by a set of heuristic algorithms with subsequent choice of the best result. <...> Keywords — Frequency Planning, Adjacent Constraints, Sequential Scheduling Algorithms, Adaptive Random Search. <...> The Spectrum Manager (SM), trying to solve the problem of the efficient use of the frequency resource allocated for the service, must take into account certain constraints providing an interference-free environment for each of the applicants for assignment. <...> In radio networks, for transmitters located at different sites, the frequency plan to be sought must answer, first of all, to the set of frequency-distance separation conditions, or so-called adjacent constraints: ff ijm  , ip jq (1) where the double index designates the allocation of the channel with frequency fi to the p-th applicant, fj to the q-th one correspondingly. <...> In the frame№ 3, 2016 work of the first of them SM tries to minimize the number of applicants which did not succeed to obtain a free-interference assignment with the help of frequency band with the given length F. The purpose <...>