Optimization of wireless sensor networks deployment with coverage and connectivity constraints
DOI10.1007/s10479-018-2943-7OpenAlexW2809700694WikidataQ129618383 ScholiaQ129618383MaRDI QIDQ829179
Sourour Elloumi, Agathe Martin, Olivier Hudry, Agnès Plateau, Estel Marie, Stephane Rovedakis
Publication date: 5 May 2021
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-018-2943-7
random graphsmixed integer linear programmingwireless sensor networksformulationssensor deploymentgrid networksminimum connected \(k\)-coverage
Theory of computing (68Qxx) Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs
- Flow-based formulation for the maximum leaf spanning tree problem
- Sensor deployment optimization methods to achieve both coverage and connectivity in wireless sensor networks
- Max-leaves spanning tree is APX-hard for cubic graphs
- Reformulations and solution algorithms for the maximum leaf spanning tree problem
- Approximation algorithms for connected dominating sets
- An exact algorithm for the maximum leaf spanning tree problem.
- Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
- Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
- The Domination Number of Grids
- Integer Programming Formulation of Traveling Salesman Problems
- Topological design of centralized computer networks—formulations and algorithms
- The maximum-leaf spanning tree problem: Formulations and facets
- Grid coverage for surveillance and target location in distributed sensor networks
This page was built for publication: Optimization of wireless sensor networks deployment with coverage and connectivity constraints
