On the Cover Scheduling Problem in Wireless Sensor Networks
From MaRDI portal
Recommendations
- Designing k-coverage schedules in wireless sensor networks
- Coverage and Detection of a Randomized Scheduling Algorithm in Wireless Sensor Networks
- A distributed algorithmic framework for coverage problems in wireless sensor networks
- Maximum lifetime coverage preserving scheduling algorithms in sensor networks
- Coverage problems in sensor networks: a survey
Cited in
(14)- Optimization scheme for sensor coverage scheduling with bandwidth constraints
- Minimum energy target tracking with coverage guarantee in wireless sensor networks
- A Lagrangean-based heuristics for the target covering problem in wireless sensor network
- Cover-free families and topology-transparent scheduling for MANETs
- Robust scheduling for target tracking using wireless sensor networks
- Maximizing target-temporal coverage of mission-driven camera sensor networks
- Designing k-coverage schedules in wireless sensor networks
- A distributed algorithmic framework for coverage problems in wireless sensor networks
- Cuckoo search algorithm for target coverage and sensor scheduling with adjustable sensing range in wireless sensor network
- Algorithms for Scheduling Sensors to Maximize Coverage Time
- Column generation algorithm for sensor coverage scheduling under bandwidth constraints
- A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks
- Optimization of wireless sensor networks deployment with coverage and connectivity constraints
- Wireless sensor networks scheduling for full angle coverage
This page was built for publication: On the Cover Scheduling Problem in Wireless Sensor Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3091546)