Maximum lifetime coverage preserving scheduling algorithms in sensor networks

DOI10.1007/S10898-010-9636-3MaRDI QIDQ652703zbMATH OpenOpenAlexFDO

Authors Maggie X. Cheng, Xuan Gong

Publication date 15 December 2011

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-010-9636-3

zbMATH Keywords

linear programmingapproximation algorithmcoveragelifetimesensor network

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35)

Recommendations

• An exact approach for maximizing the lifetime of sensor networks with adjustable sensing ranges
• Maximal lifetime scheduling for k to 1 sensor-target surveillance networks
• Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges
• An exact approach to extend network lifetime in a general class of wireless sensor networks
• Cluster based node scheduling method for wireless sensor networks

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Exposure in wireless sensor networks: Theory and practical solutions
• Mathematical programming techniques for sensor networks
• Wireless networking, dominating and packing

Cited in

(13)

• Parameterized complexity of max-lifetime target coverage in wireless sensor networks
• On the Cover Scheduling Problem in Wireless Sensor Networks
• Radar placement along banks of river
• scientific article; zbMATH DE number 5812746 (Why is no real title available?)
• Cluster based node scheduling method for wireless sensor networks
• Algorithms for Scheduling Sensors to Maximize Coverage Time
• Wireless sensor networks scheduling for full angle coverage
• Optimal placement, scheduling, and routing to maximize lifetime in sensor networks
• Efficient algorithms for support path with time constraint
• An exact approach for maximizing the lifetime of sensor networks with adjustable sensing ranges
• Optimization scheme for sensor coverage scheduling with bandwidth constraints
• Maximal lifetime scheduling for k to 1 sensor-target surveillance networks
• An outer-approximation approach for information-maximizing sensor selection

This page was built for publication: Maximum lifetime coverage preserving scheduling algorithms in sensor networks

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