Channel assignment in cellular radio networks

Mathar, Rudolf; Mattfeldt, J.

doi:10.1109/25.260746

Cited by 129 publications

(54 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Mathar and Mattfeldt (1993) the model is (distance) MB-FAP with only hard co-channel constraints. The authors propose a non standard definition of a neighborhood in order to guarantee convergency of the method.…”

Section: Mi-fap Inmentioning

confidence: 99%

See 1 more Smart Citation

Models and solution techniques for frequency assignment problems

et al. 2007

View full text Add to dashboard Cite

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.This survey gives an overview of the models and methods that the literature provides on the topic. We present a broad description of the practical settings in which frequency assignment is applied. We also present a classification of the different models and formulations described in the literature, such that the common features of the models are emphasized. The solution methods are divided in two parts. Optimization and lower bounding techniques on the one hand, and heuristic search techniques on the other hand. The literature is classified according to the used methods. Again, we emphasize the common features, used in the different papers. The quality of the solution methods is compared, whenever possible, on publicly available benchmark instances. This is an updated version of a paper that appeared in 4OR 1, 261-317, 2003.

show abstract

Section: Mi-fap Inmentioning

confidence: 99%

“…This approach has been modeled independently by Mathar and Mattfeldt (1993), and Chang and Kim (1997), who use a weighted combination of blocking probabilities in the objective function. This problem is known as the Minimum Blocking Frequency Assignment Problem (MB-FAP).…”

Section: 1mentioning

confidence: 99%

Models and solution techniques for frequency assignment problems

et al. 2007

View full text Add to dashboard Cite

show abstract

“…From then on, a large number of articles have been published devoted to the study of the frequency assignment problem and its connections to graph labelings, in particular, to the class of -labelings and its generalizations: Over 100 references on the subject are provided in a very comprehensive survey [3]. In addition to graph theory and combinatorial techniques, other interesting approaches in studying these labelings include neural networks [7], [14]; genetic algorithms [17], and simulated annealing [18]. Most of these papers are considering the values of on particular classes of graphs.…”

Section: Introductionmentioning

confidence: 99%

A New Approach to the $L(2,1)$-Labeling of Some Products of Graphs

Shiu

Shao

Poon

et al. 2008

IEEE Trans. Circuits Syst. II

View full text Add to dashboard Cite

Abstract-The frequency assignment problem is to assign a frequency which is a nonnegative integer to each radio transmitter so that interfering transmitters are assigned frequencies whose separation is not in a set of disallowed separations. This frequency assignment problem can be modelled with vertex labelings of graphs. An ( 2 1 . In this paper, we develop a dramatically new approach on the analysis of the adjacency matrices of the graphs to estimate the upper bounds of -numbers of the four standard graph products. By the new approach, we can achieve more accurate results and with significant improvement of the previous bounds.Index Terms-Channel assignment, (2 1)-labeling, Cartesian product, lexicographic product, direct product, strong product.

show abstract

“…For a large-scale system an approach for the optimal solution is impractical. Thus a simplification of the problem or an approximation technique have been used, such as neural network based algorithms [16,17,18], simulations [19,20], and genetic algorithms [9,21,22,23]. Many authors have studied lower bounds for SM.…”

Section: Introductionmentioning

confidence: 99%

Analytical Approach for Channel Assignments in Cellular Networks

Shakhov

Choo

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In the present paper channel assignments in cellular architectures are considered. This is quite important in cell and channel planning since reusing channels in cells allows to manage resources and to serve users effectively in the system. The optimal solution is offered here for the case of co-channel interference. Previous solutions on co-channel interference are based on regular hexagonal models for service areas. A novel technique is employed in this work that does not depend upon any geometric form of cells. It is obtained that the optimal number of channels equals the density of a special graph. Earlier analytical results on span minimization show lower bounds meanwhile we provide the upper bound in this paper.

show abstract

Channel assignment in cellular radio networks

Cited by 129 publications

References 19 publications

Models and solution techniques for frequency assignment problems

Models and solution techniques for frequency assignment problems

A New Approach to the $L(2,1)$-Labeling of Some Products of Graphs

Analytical Approach for Channel Assignments in Cellular Networks

Contact Info

Product

Resources

About