A fast localized algorithm for scheduling sensors

DOI10.1016/J.JPDC.2005.11.003MaRDI QIDQ2497719zbMATH OpenOpenAlexFDO

Authors Gruia Calinescu

Publication date 4 August 2006

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2005.11.003

zbMATH Keywords

sensor networklifetime maximizationlocalized algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Energy efficient monitoring in sensor networks
• Energy Efficient Monitoring in Sensor Networks
• Algorithms for Scheduling Sensors to Maximize Coverage Time
• scientific article; zbMATH DE number 6381738
• Approximation for a scheduling problem with application in wireless networks

Cited in

(3)

• An Analysis and Solution of the Sensor Scheduling Problem
• Algorithms for Scheduling Sensors to Maximize Coverage Time
• Scheduling sensors by tiling lattices

This page was built for publication: A fast localized algorithm for scheduling sensors

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