Solving the Frequency Assignment Problem by Site Availability and Constraint Programming - Archive ouverte HAL Access content directly
Journal Articles Revista de tecnologia da informacao e comunicacao Year : 2012

Solving the Frequency Assignment Problem by Site Availability and Constraint Programming

(1) , (1) , , (1)
1
Peter Peinli
  • Function : Author
Philippe Michelon

Abstract

—The efficient use of bandwidth for radio communications becomes more and more crucial when developing new information technologies and their applications. The core issues are addressed by the so-called Frequency Assignment Problems (FAP). Our work investigates static FAP, where an attempt is first made to configure a kernel of links. We study the problem based on the concepts and techniques of Constraint Programming and integrate the site availability concept. Numerical simulations conducted on scenarios provided by CELAR are very promising.

Dates and versions

hal-01328072 , version 1 (07-06-2016)

Identifiers

Cite

Andréa Linhares, Juan-Manuel Torres-Moreno, Peter Peinli, Philippe Michelon. Solving the Frequency Assignment Problem by Site Availability and Constraint Programming. Revista de tecnologia da informacao e comunicacao, 2012, 1 (2), pp.41-46. ⟨10.12721/2237-5112.v01n02a06⟩. ⟨hal-01328072⟩

Collections

UNIV-AVIGNON LIA
36 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More