Coverage and Detection of a Randomized Scheduling Algorithm in Wireless Sensor Networks
DOI10.1109/TC.2009.170zbMATH Open1366.90068OpenAlexW2155806760MaRDI QIDQ5280787FDOQ5280787
Authors: Yang Xiao, Hui Chen, Kui Wu, Bo Sun, Ying Zhang, Xinyu Sun, Chong Liu
Publication date: 27 July 2017
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.2009.170
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Communication networks in operations research (90B18)
Cited In (7)
- 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
- On the Cover Scheduling Problem in 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)