A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks

DOI10.1016/J.EJOR.2010.05.020MaRDI QIDQ992709zbMATHOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

heuristicsinteger programmingcolumn generationsensor networks

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Communication networks in operations research (90B18)

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

Cites work

• scientific article; zbMATH DE number 2132174 (Why is no real title available?)
• A Game-Theoretic Approach to Efficient Power Management in Sensor Networks
• A survey of combinatorial optimization problems in multicast routing
• Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks
• Column Generation
• Connected \(K\)-target coverage problem in wireless sensor networks with different observation scenarios
• Decomposition Principle for Linear Programs
• Distributed algorithms for barrier coverage via sensor rotation in wireless sensor networks
• Efficient point coverage in wireless sensor networks
• Grid coverage for surveillance and target location in distributed sensor networks
• Maximal lifetime scheduling for \(k\) to 1 sensor-target surveillance networks
• Maximizing system lifetime in wireless sensor networks
• Optimal placement, scheduling, and routing to maximize lifetime in sensor networks

Cited in

(10)

• Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks
• 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
• Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks
• Clustering Sensors in Wireless Ad Hoc Networks Operating in a Threat Environment
• Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges
• Energy-efficient scheduling in manufacturing companies: a review and research framework
• Formulations for a problem of petroleum transportation
• Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks
• A column generation heuristic for optimal wireless sensor network design with mobile sinks

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)