Maximum lifetime connected coverage with two active-phase sensors

DOI10.1007/S10898-012-9871-XMaRDI QIDQ2392753zbMATH OpenOpenAlexFDO

Authors Panos M. Pardalos, Weili Wu, Lidong Wu, Hongwei Du

Publication date 2 August 2013

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

Full work available at URL https://doi.org/10.1007/s10898-012-9871-x

zbMATH Keywords

coveragemaximum lifetimewireless sensor network

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Connected K-target coverage problem in wireless sensor networks with different observation scenarios
• Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints
• Energy efficient monitoring in sensor networks
• Energy Efficient Monitoring in Sensor Networks

Cites work

• A better constant-factor approximation for weighted dominating set in unit disk graph
• Adaptive energy efficient sensor scheduling for wireless sensor networks
• Approximation schemes for covering and packing problems in image processing and VLSI
• Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
• Constructing weakly connected dominating set for secure clustering in distributed sensor network
• Design and analysis of approximation algorithms
• Mathematical programming techniques for sensor networks
• Node-weighted Steiner tree approximation in unit disk graphs
• On dual power assignment optimization for biconnectivity
• Wireless networking, dominating and packing

Cited in

(3)

• A simple approximation algorithm for minimum weight partial connected set cover
• Constant approximation for the lifetime scheduling problem of \(p\)-percent coverage
• Connected K-target coverage problem in wireless sensor networks with different observation scenarios

This page was built for publication: Maximum lifetime connected coverage with two active-phase sensors

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