A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks
DOI10.1016/J.EJOR.2010.05.020zbMATH Open1206.90023DBLPjournals/eor/TurkogullariAAE10OpenAlexW2034625895WikidataQ62681028 ScholiaQ62681028MaRDI QIDQ992709FDOQ992709
Authors: J. Martínez 
Publication date: 9 September 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.05.020
Recommendations
- A column generation heuristic for optimal wireless sensor network design with mobile sinks
- Column generation algorithm for sensor coverage scheduling under bandwidth constraints
- A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints
- Data aggregation and routing in wireless sensor networks: Optimal and heuristic algorithms
- Optimal placement, scheduling, and routing to maximize lifetime in sensor networks
- An efficient heuristic for selecting active nodes in wireless sensor networks
Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Communication networks in operations research (90B18)
Cites Work
- Decomposition Principle for Linear Programs
- Column Generation
- Maximizing system lifetime in wireless sensor networks
- Title not available (Why is that?)
- Efficient point coverage in wireless sensor networks
- Grid coverage for surveillance and target location in distributed sensor networks
- Optimal placement, scheduling, and routing to maximize lifetime in sensor networks
- Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks
- A survey of combinatorial optimization problems in multicast routing
- A Game-Theoretic Approach to Efficient Power Management in Sensor Networks
- Distributed algorithms for barrier coverage via sensor rotation in wireless sensor networks
- Connected \(K\)-target coverage problem in wireless sensor networks with different observation scenarios
- Maximal lifetime scheduling for \(k\) to 1 sensor-target surveillance networks
Cited In (10)
- Exact and heuristic approaches for maximizing flows in UAV-enabled wireless cellular networks with multi-hop backhauls
- Column generation algorithm for sensor coverage scheduling under bandwidth constraints
- Energy-efficient scheduling in manufacturing companies: a review and research framework
- Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks
- Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges
- A column generation heuristic for optimal wireless sensor network design with mobile sinks
- Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks
- Formulations for a problem of petroleum transportation
- Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks
- Clustering Sensors in Wireless Ad Hoc Networks Operating in a Threat Environment
This page was built for publication: A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992709)
