Advertisement

Solving a Constraint Satisfaction Problem for Frequency Assignment in Low Power FM Broadcasting

  • Surgwon Sohn
  • Geun-Sik Jo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4304)

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.

Keywords

Random Graph Chromatic Number Constraint Satisfaction Problem Federal Communication Commission Frequency Assignment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Hale, W.K.: Frequency Assignment:Theory and Applications. Proceedings of the IEEE 68, 1497–1514 (1980)CrossRefGoogle Scholar
  2. 2.
    Arnaud, J.F.: Frequency Planning for Broadcast Services in Europe. Proceedings of the IEEE 68, 1515–1522 (1980)CrossRefGoogle Scholar
  3. 3.
    Aardal, K., et al.: Models and Solution Techniques for Frequency Assignment Problems, Technical Report ZIB-Report01-40 (2001)Google Scholar
  4. 4.
    Mannino, C., Sassano, A.: An Enumerative Algorithm for the Frequency Assignment Problem. Discrete Applied Mathematics 129, 155–169 (2003)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Federal Communications Commission, http://www.fcc.gov/mb/audio/lpfm
  6. 6.
    World Association of Community Radio Broadcasters, http://www.amarc.org
  7. 7.
    Giortzis, A.I., Turner, L.F.: Application of Mathematical Programming to the Fixed Channel Assignment Problem in Mobile Radio Networks. IEE Proceedings of Communication 144, 257–264 (1997)CrossRefGoogle Scholar
  8. 8.
    Carlsson, M., Grindal, M.: Automatic Frequency Assignment for Cellular Telephone Using Constraint Satisfaction Techniques. In: Proceedings of the Tenth International Conference on Logic Programming, pp. 647–665 (1993)Google Scholar
  9. 9.
    Walsher, J.P.: Feasible Cellular Frequency Assignment Using Constraint Programming Abstractions. In: Proceedings of the Workshop on Constraint Programming Applications (1996)Google Scholar
  10. 10.
    Dunkin, N., Allen, S.: Frequency Assignment Problems: Representation and Solutions, Technical Report CSD-TR-97-14, Royal Holloway, University of London (1997)Google Scholar
  11. 11.
    Thiel, S.U., Hurley, S., Smith, D.H.: Frequency Assignment Algorithms, Technical Report Year 2, University of Wales Cardiff (1997)Google Scholar
  12. 12.
    Wang, L., Li, S., Tian, F., Fu, X.: A Noisy Chaotic Neural Network for Solving Combinatorial Optimization Problems: Stochastic Chaotic Simulated Annealing. IEEE Trans. on Systems, Man, and Cybernetics 34(5), 2119–2125 (2004)CrossRefGoogle Scholar
  13. 13.
    Yokoo, M., Hirayama, K.: Frequency Assignment for Cellular Mobile Systems Using Constraint Satisfaction Techniques. In: IEEE Int’l. Proceedings of Vehicular Technology Conferences (2000)Google Scholar
  14. 14.
    Bollobas, B.: The Chromatic Number of Random Graphs. Combinatorica 8, 49–55 (1988)MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Luczak, T.: The Chromatic Number of Random Graphs. Combinatorica 11, 45–54 (1991)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Achlioptas, D., Naor, A.: The Two Possible Values of the Chromatic Number of a Random Graph. Annals of Mathematics (2005)Google Scholar
  17. 17.
    Gamst, A.: Some Lower Bounds for a Class of Frequency Assignment Problems. IEEE Proceedings on Vehicular Technology VT-35, 8–14 (1986)CrossRefGoogle Scholar
  18. 18.
    Smith, D.H., Hurley, S.: Bounds for the Frequency Assignment Problem. Discrete Mathematics 167/168, 571–582 (1997)CrossRefMathSciNetGoogle Scholar
  19. 19.
    Kim, D., Han, E., Park, J.: Research on Active Use of Low Power Broadcasting, Technical Report KORA-2001-17, Korea Radio Station Management Agency (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Surgwon Sohn
    • 1
  • Geun-Sik Jo
    • 2
  1. 1.Division of Computer EngineeringHoseo UniversityAsanKorea
  2. 2.School of Computer Science & EngineeringInha UniversityIncheonKorea

Personalised recommendations