Algorithms for Scheduling Sensors to Maximize Coverage Time

DOI10.1007/978-3-642-38189-8_9MaRDI QIDQ5265170zbMATH OpenOpenAlexFDO

Authors Rafael da Ponte Barbosa, Yoshiko Wakabayashi

Publication date 22 July 2015

Published in Facets of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38189-8_9

zbMATH Keywords

greedy-like algorithminteger programming formulationsensor cover problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Recommendations

• Optimization scheme for sensor coverage scheduling with bandwidth constraints
• Maximum lifetime coverage preserving scheduling algorithms in sensor networks
• Optimal sensor scheduling in continuous time
• On the Cover Scheduling Problem in Wireless Sensor Networks
• On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
• An Analysis and Solution of the Sensor Scheduling Problem
• Approximation Algorithms for Sensor Deployment
• A fast localized algorithm for scheduling sensors
• Coverage and Detection of a Randomized Scheduling Algorithm in Wireless Sensor Networks

Cited in

(3)

• A fast localized algorithm for scheduling sensors
• A better approximation ratio and an IP formulation for a sensor cover problem
• Changing of the guards: strip cover with duty cycling

This page was built for publication: Algorithms for Scheduling Sensors to Maximize Coverage Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265170)