Wireless sensor networks scheduling for full angle coverage

DOI10.1007/S11045-008-0062-3MaRDI QIDQ835725zbMATH OpenOpenAlexFDO

Authors Kit-Yee Chow, King-Shan Lui, Edmund Y. Lam

Publication date 31 August 2009

Published in Multidimensional Systems and Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11045-008-0062-3

zbMATH Keywords

schedulingangle coverageminimum cost cover

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Large-scale systems (93A15)

Recommendations

• Designing k-coverage schedules in wireless sensor networks
• Maximum lifetime coverage preserving scheduling algorithms in sensor networks
• On the Cover Scheduling Problem in Wireless Sensor Networks
• Connected K-target coverage problem in wireless sensor networks with different observation scenarios
• Coverage problems in sensor networks: a survey

Cites work

• A note on practical construction of maximum bandwidth paths.
• Efficient on-demand image transmission in visual sensor networks
• Introduction to algorithms

Cited in

(2)

• Source localization using a sparse representation framework to achieve superresolution
• Efficient algorithms for support path with time constraint

Describes a project that uses

Uses Software

• J-Sim

This page was built for publication: Wireless sensor networks scheduling for full angle coverage

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