Solving the Frequency Assignment Problem by Site Availability and Constraint Programming

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.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01328072
Contributor : Yves Caron <>
Submitted on : Tuesday, June 7, 2016 - 3:21:53 PM
Last modification on : Saturday, March 23, 2019 - 1:22:34 AM

Links full text

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

59