Topic
Frequency assignment
About: Frequency assignment is a research topic. Over the lifetime, 823 publications have been published within this topic receiving 12779 citations.
Papers published on a yearly basis
1 / 2
Papers
1 Dec 1980
TL;DR: This paper introduces the minimum-order approach to frequency assignment and presents a theory which relates this approach to the traditional one, and shows that many frequency assignment problems are equivalent to generalized graph coloring problems.
Abstract: In this paper we introduce the minimum-order approach to frequency assignment and present a theory which relates this approach to the traditional one. This new approach is potentially more desirable than the traditional one. We model assignment problems as both frequency-distance constrained and frequency constrained optimization problems. The frequency constrained approach should be avoided if distance separation is employed to mitigate interference. A restricted class of graphs, called disk graphs, plays a central role in frequency-distance constrained problems. We introduce two generalizations of chromatic number and show that many frequency assignment problems are equivalent to generalized graph coloring problems. Using these equivalences and recent results concerning the complexity of graph coloring, we classify many frequency assignment problems according to the "execution time efficiency" of algorithms that may be devised for their solution. We discuss applications to important real world problems and identify areas for further work.
1,478 citations
TL;DR: In this article, the authors developed different modeling ideas for each of the features of the problem, such as the handling of interference among radio signals, the availability of frequencies, and the optimization criterion.
Abstract: Wireless communication is used in many different situations such as mobile telephony, radio and TV broadcasting, satellite communication, wireless LANs, and military operations. In each of these situations a frequency assignment problem arises with application specific characteristics. Researchers have developed different modeling ideas for each of the features of the problem, such as the handling of interference among radio signals, the availability of frequencies, and the optimization criterion.
386 citations
TL;DR: In this paper, the authors present a suite of simplified versions of radio link frequency assignment problems (RLFAP) starting from data on a real network Roisnel93 and also introduce the GRAPH instances which were generated during the CALMA project.
Abstract: The problem of radio frequency assignment is to provide communication channels from limited spectral resources whilst keeping to a minimum the interference suffered by those whishing to communicate in a given radio communication network. This problem is a combinatorial (NP-hard) optimization problem. In 1993, the CELAR (the French ’’Centre d‘Electronique de l‘Armement‘‘) built a suite of simplified versions of Radio Link Frequency Assignment Problems (RLFAP) starting from data on a real network Roisnel93. Initially designed for assessing the performances of several Constraint Logic Programming languages, these benchmarks have been made available to the public in the framework of the European EUCLID project CALMA (Combinatorial Algorithms for Military Applications). These problems should look very attractive to the CSP community: the problem is simple to represent, all constraints are binary and involve finite domain variables. They nevertheless have some of the flavors of real problems (including large size and several optimization criteria). This paper gives essential facts about the CELAR instances and also introduces the GRAPH instances which were generated during the CALMA project.
207 citations
TL;DR: Efficient approximation algorithms for the distance-2 coloring problem for various geometric graphs including those that naturally model a large class of packet radio networks, including (r,s)-civilized graphs, planar graphs, graphs with bounded genus, etc.
Abstract: We consider the frequency assignment (broadcast scheduling) problem for packet radio networks. Such networks are naturally modeled by graphs with a certain geometric structure. The problem of broadcast scheduling can be cast as a variant of the vertex coloring problem (called the distance-2 coloring problem) on the graph that models a given packet radio network. We present efficient approximation algorithms for the distance-2 coloring problem for various geometric graphs including those that naturally model a large class of packet radio networks. The class of graphs considered include (r, s)-civilized graphs, planar graphs, graphs with bounded genus, etc.
202 citations
1 Nov 2008
TL;DR: Experimental evaluations carried out using a framework for radio coverage prediction and system level simulation for WiMAX macrocell/femtocell scenarios show the boost in the system capacity when using DFP and femtocells.
Abstract: Femtocells have been recently proposed as a potential good solution to increase not only indoor radio coverage, but also system capacity. In this paper, a framework for radio coverage prediction and system level simulation for WiMAX macrocell/femtocell scenarios is presented. Furthermore, the feasibility of the co-channel deployment of WiMAX femtocell in an existing WiMAX macrocell network is investigated, and a method for interference avoidance based on DFP (dynamic frequency planning) is proposed. The resulting impact of DFP in a macrocell/femtocell scenario compared with other frequency assignment strategies is analyzed. Experimental evaluations carried out using our framework show the boost in the system capacity when using DFP and femtocells.
174 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2025 | 1 |
| 2024 | 3 |
| 2023 | 10 |
| 2022 | 13 |
| 2021 | 6 |
| 2020 | 12 |