MILP, pseudo-Boolean, and OMT solvers for optimal fault-tolerant placements of relay nodes in mission critical wireless networks
From MaRDI portal
(Redirected from Publication:5140144)
Abstract: In critical infrastructures like airports, much care has to be devoted in protecting radio communication networks from external electromagnetic interference. Protection of such mission-critical radio communication networks is usually tackled by exploiting radiogoniometers: at least three suitably deployed radiogoniometers, and a gateway gathering information from them, permit to monitor and localise sources of electromagnetic emissions that are not supposed to be present in the monitored area. Typically, radiogoniometers are connected to the gateway through relay nodes. As a result, some degree of fault-tolerance for the network of relay nodes is essential in order to offer a reliable monitoring. On the other hand, deployment of relay nodes is typically quite expensive. As a result, we have two conflicting requirements: minimise costs while guaranteeing a given fault-tolerance. In this paper, we address the problem of computing a deployment for relay nodes that minimises the relay node network cost while at the same time guaranteeing proper working of the network even when some of the relay nodes (up to a given maximum number) become faulty (fault-tolerance). We show that, by means of a computation-intensive pre-processing on a HPC infrastructure, the above optimisation problem can be encoded as a 0/1 Linear Program, becoming suitable to be approached with standard Artificial Intelligence reasoners like MILP, PB-SAT, and SMT/OMT solvers. Our problem formulation enables us to present experimental results comparing the performance of these three solving technologies on a real case study of a relay node network deployment in areas of the Leonardo da Vinci Airport in Rome, Italy.
Recommendations
- Relay placement for fault tolerance in wireless networks in higher dimensions
- Optimal placement of UV-based communications relay nodes
- A constraint programming approach to the additional relay placement problem in wireless sensor networks
- Novel hybrid heuristics for an extension of the dynamic relay deployment problem over disaster areas
- Computing and Combinatorics
Cites work
- \textsc{OptiMathSAT}: a tool for optimization modulo theories
- Constraint answer set programming without grounding
- Evaluating ASP and commercial solvers on the CSPLib
- Exploiting functional dependencies in declarative problem specifications
- Handbook of constraint programming.
- scientific article; zbMATH DE number 5139161 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- Integer Programming
- Integrating answer set programming and constraint logic programming
- Model-driven visualizations of constraint-based local search
- Now or never: negotiating efficiently with unknown or untrusted counterparts
- On minimising the maximum expected verification time
- Principles of Constraint Programming
- Relating constraint answer set programming languages and algorithms
- Satisfiability modulo theories
- SyLVaaS: system level formal verification as a service
- Theory and Applications of Satisfiability Testing
- Undecidability of quantized state feedback control for discrete time linear hybrid systems
This page was built for publication: MILP, pseudo-Boolean, and OMT solvers for optimal fault-tolerant placements of relay nodes in mission critical wireless networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140144)
