Skip to Main content Skip to Navigation

Algorithms for irreducible infeasible subset detection in CSP - Application to frequency planning and graph k-coloring

Abstract : The frequency assignment (FAP) consists in assigning the frequency on the radio links of a network which satisfiesthe electromagnetic interference among the links. Given the limited spectrum resources for each application, the fre-quency resources are often insufficient to deploy a wireless network without interference. In this case, the network isover-contrained and the problem is infeasible. Our objective is to identify an area with heavy interference.The work presented here concerns the detection for one of these areas with an algorithmic approach based onmodeling the problem by CSP. The problem of frequency assignment can be modeled as a constraint satisfactionproblem (CSP) which is represented by a triple: a set of variables (radio links), a set of constraints (electromagneticinterference) and a set of available frequencies.The interfered area in CSP can be considered a subset of irreducible feasible subset (IIS). An IIS is a infeasiblesubproblem with irreducible size, that is to say that all subsets of an IIS are feasible. The identification of an IIS ina CSP refers to two general interests. First, locating an IIS can easily prove the infeasibility of the problem. Becausethe size of IIS is assumed to be smaller compared to the entire problem, its infeasibility is relatively easier to prove.Second, we can locate the reason of infeasibility, in this case, the decision maker can provide the solutions to relax theconstraints inside IIS, which perhaps leads to a feasible solution to the problem.This work proposes algorithms to identify an IIS in the over-constrained CSP. These algorithms have tested on the well known benchmarks of the FAP and of the problem of graph k-coloring. The results show a significant improve-ment on instances of FAP compared to known methods.
Document type :
Complete list of metadatas

Cited literature [137 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Friday, May 17, 2013 - 12:17:09 PM
Last modification on : Tuesday, October 1, 2019 - 3:42:00 PM
Long-term archiving on: : Sunday, August 18, 2013 - 4:14:36 AM


Version validated by the jury (STAR)


  • HAL Id : tel-00823559, version 1



Jun Hu. Algorithms for irreducible infeasible subset detection in CSP - Application to frequency planning and graph k-coloring. Computers and Society [cs.CY]. Université de Technologie de Belfort-Montbeliard, 2012. English. ⟨NNT : 2012BELF0187⟩. ⟨tel-00823559⟩



Record views


Files downloads