Solving energy issues for sweep coverage in wireless sensor networks

DOI10.1016/j.dam.2016.09.028zbMath1366.90019OpenAlexW2533139378MaRDI QIDQ2357168

Partha Sarathi Mandal, Barun Gorain

Publication date: 19 June 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.09.028

zbMATH Keywords

approximation algorithmswireless sensor networksenergy efficient\(k\)-MSTstatic sensormobile sensorsweep coverage\(k\)-TSPenergy restricted

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)

Related Items (10)

Constant-approximation for prize-collecting min-sensor sweep coverage with base stations ⋮ Approximation algorithm for distance constraint sweep coverage without predetermined base stations ⋮ Approximation algorithm for prize-collecting sweep cover with base stations ⋮ An approximation algorithm for general energy restricted sweep coverage problem ⋮ Group sweep coverage with guaranteed approximation ratio ⋮ Approximation algorithms for distance constraint sweep coverage with base stations ⋮ A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems ⋮ Approximation Algorithms for Barrier Sweep Coverage ⋮ Approximation algorithm for sweep coverage on graph ⋮ Solving energy issues for sweep coverage in wireless sensor networks

Cites Work

• Unnamed Item
• Approximation algorithm for sweep coverage on graph
• Solving energy issues for sweep coverage in wireless sensor networks
• On the Discrete Unit Disk Cover Problem
• Saving an epsilon
• Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks
• Energy Efficient Sweep Coverage with Mobile and Static Sensors

This page was built for publication: Solving energy issues for sweep coverage in wireless sensor networks