Coverage and Detection of a Randomized Scheduling Algorithm in Wireless Sensor Networks
From MaRDI portal
Publication:5280787
Cited in
(7)- On the Cover Scheduling Problem in Wireless Sensor Networks
- A novel gossip-based sensing coverage algorithm for dense wireless sensor networks
- Cover-free families and topology-transparent scheduling for MANETs
- Algorithms for Scheduling Sensors to Maximize Coverage Time
- Formal probabilistic analysis of detection properties in wireless sensor networks
- A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks
- SAT representation of randomly deployed Wireless Sensor Networks
This page was built for publication: Coverage and Detection of a Randomized Scheduling Algorithm in Wireless Sensor Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280787)