Optimal deployment of indoor wireless local area networks
From MaRDI portal
Publication:6179700
DOI10.1002/net.22116zbMath1529.90027MaRDI QIDQ6179700
Antoine Oustry, Claudia D'Ambrosio, Unnamed Author, Unnamed Author, Leo Liberti
Publication date: 18 December 2023
Published in: Networks (Search for Journal in Brave)
heuristicsrelaxationmixed integer linear programmingwireless networksfrequency assignmentfinite difference schemaindoor radio wave simulation
Mixed integer programming (90C11) Communication networks in operations research (90B18) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Steiner tree problem with minimum number of Steiner points and bounded edge-length
- Sensor deployment optimization methods to achieve both coverage and connectivity in wireless sensor networks
- Optimizing base station location and configuration in UMTS networks
- Optimal network design for wireless local area network
- Optimal base station positioning and channel assignment for 3G mobile networks by integer programming
- On the wireless local area network design problem with performance guarantees
- Improving construction for connected dominating set with Steiner tree in wireless sensor networks
- Direct Methods for Sparse Matrices
- Solving Nonlinear Covering Problems Arising in WLAN Design
- Direct Methods for Sparse Linear Systems
- A Supernodal Approach to Sparse Partial Pivoting
- Nested Dissection of a Regular Finite Element Mesh
- Complexity Bounds for Regular Finite Difference and Finite Element Grids
- Models and solution techniques for frequency assignment problems
- Approximations for Steiner trees with minimum number of Steiner points