scispace - formally typeset
Journal ArticleDOI

A unified approach to the assignment of radio channels on a regular hexagonal grid

R.A. Leese
- 01 Nov 1997 - 
- Vol. 46, Iss: 4, pp 968-980
TLDR
The main aim is to investigate the interplay between the cochannel and adjacent channel separations without restricting the assignments unnecessarily, and to develop an algorithm which assigns channels on any cochannel lattice so that the adjacent channel separation is maximized.
Abstract
In radio systems, quality of service is achieved by assigning channels with reference to a set of protection ratios, which in a simplified setting may be replaced with frequency-distance bounds. This paper considers the assignment problem on a lattice of hexagonal cells, with the allowed assignments generated by regular tilings of a single polyhex. The main aim is to investigate the interplay between the cochannel and adjacent channel separations without restricting the assignments unnecessarily. The outcome is a unified framework in which all previous results appear as particular cases. The possible cochannel lattices are carefully classified, and then an algorithm is developed, which assigns channels on any cochannel lattice so that the adjacent channel separation is maximized. In this way, a library of the best assignments can be compiled. The results are of relevance to a range of applications, including both broadcast and mobile systems.

read more

Citations
More filters
Journal ArticleDOI

Planning effective cellular mobile radio networks

TL;DR: An optimization framework based on simulated annealing is used for site selection and for base-station configuration and shows that cellular network design problems are tractable for realistic problem instances.
Journal ArticleDOI

Graph labeling and radio channel assignment

TL;DR: In this paper, the authors consider the problem of finding labelings of minimum span, given a graph and a set of constraints, and obtain optimal labelings for up to three levels of constraint.
Book

Fundamentals of Mobile Data Networks

TL;DR: This unique text provides a comprehensive and systematic introduction to the theory and practice of mobile data networks.
Journal ArticleDOI

FASoft: A system for discrete channel frequency assignment

TL;DR: FASoft as discussed by the authors is a system for discrete channel frequency assignment that incorporates state-of-the-art heuristics, sequential assignment algorithms, and a maximal clique algorithm to aid in the assignment process.
Journal ArticleDOI

Improving heuristics for the frequency assignment problem

TL;DR: It is shown that for many types of problem optimal assignments can be found by a process of assigning these subgraphs first, fixing the assignment and then extending the assignment to the full problem.
References
More filters
Book

An Introduction to the Theory of Numbers

G. H. Hardy
TL;DR: The fifth edition of the introduction to the theory of numbers has been published by as discussed by the authors, and the main changes are in the notes at the end of each chapter, where the author seeks to provide up-to-date references for the reader who wishes to pursue a particular topic further and to present a reasonably accurate account of the present state of knowledge.
Journal ArticleDOI

Frequency assignment: Theory and applications

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.
Journal ArticleDOI

Advanced mobile phone service: The cellular concept

TL;DR: In this paper, a cellular system operating within a limited block of frequency spectrum can meet the objectives of a large-scale mobile-telephone service designed with attention to cost restraint.
Journal ArticleDOI

Some lower bounds for a class of frequency assignment problems

TL;DR: Lower bounds for the number of frequencies required by solutions of certain frequency assignment problems were derived in this article, which constitute generalizations of the clique number to problems including adjacent channel and co-site constraints as well as preassigned and blocked frequencies.