Solving a constraint satisfaction problem for frequency assignment in low power FM broadcasting

Authors:
Surgwon Sohn;Geun-Sik Jo
Affiliations:
Division of Computer Engineering, Hoseo University, Asan, Korea;School of Computer Science & Engineering, Inha University, Incheon, Korea
Venue:
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Year:
2006

Citing 5
Cited 1

Automatic frequency assignment for cellular telephones using constraint satisfaction techniques

ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Bounds for the frequency assignment problem

Discrete Mathematics
Frequency Assignment for Cellular Mobile Systems Using Constraint Satisfaction Techniques

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
An enumerative algorithm for the frequency assignment problem

Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
A noisy chaotic neural network for solving combinatorial optimization problems: stochastic chaotic simulated annealing

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Channel and Time Slot Allocation for Dense RFID Networks

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm to solve the frequency assignment problem for low power FM broadcasting. To get a good suboptimal solution, some heuristics such as k-coloring variable ordering and mostly-used value ordering rule are provided. They enforce the backtracking process in a constraint satisfaction problem, so both the search space and computing time are greatly reduced. A lot of outstanding work on graph coloring problems has been achieved, and the theoretical lower bound of the chromatic number of random graph is one of them. Comparison between the theoretical lower bound and our computed approximate solution has been made for evaluation of proposed algorithm.