Maximum lifetime coverage preserving scheduling algorithms in sensor networks

DOI10.1007/S10898-010-9636-3zbMATH Open1229.90028OpenAlexW1965154706MaRDI QIDQ652703FDOQ652703

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

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

zbMATH Keywords

linear programmingapproximation algorithmcoveragelifetimesensor network

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Wireless networking, dominating and packing
• Mathematical programming techniques for sensor networks
• Exposure in wireless sensor networks: Theory and practical solutions

Cited In (13)

• Parameterized complexity of max-lifetime target coverage in wireless sensor networks
• Title not available (Why is that?)
• Radar placement along banks of river
• Algorithms for Scheduling Sensors to Maximize Coverage Time
• Cluster based node scheduling method for wireless sensor networks
• 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
• On the Cover Scheduling Problem in Wireless Sensor Networks

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)