Automatic frequency assignment for cellular telephones using constraint satisfaction techniques
Number of Authors: 3
1993 (English)In: ICLP'93, Int. Conf. on Logic Programming, The MIT Press , 1993, 1, , 18 p.647-665 p.Conference paper (Refereed)
We study the problem of automatic frequency assignment for cellular telephone systems. The frequency assignment problem is viewed as the problem to minimize the unsatisfied soft constraints in a constraint satisfaction problem (CSP) over a finite domain of frequencies involving co-channel, adjacent channel, and co-site constraints. The soft constraints are automatically derived from signal strength prediction data. The CSP is solved using a generalized graph coloring algorithm. Graph-theoretical results play a crucial role in making the problem tractable. Performance results from a real-world frequency assignment problem are presented. We develop the generalized graph coloring algorithm by stepwise refinement, starting from DSATUR and augmenting it with local propagation, constraint lifting, intelligent backtracking, redundancy avoidance, and iterative deepening.
Place, publisher, year, edition, pages
The MIT Press , 1993, 1. , 18 p.647-665 p.
MIT Press Series in Logic Programming
frequency assignment, constraints, graph coloring, intelligent backtracking, iterative deepening
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-22598OAI: oai:DiVA.org:ri-22598DiVA: diva2:1042163
ICLP'93, 10th International Conference on Logic Programming