Minimizing the total cost of barrier coverage in a linear domain

DOI10.1007/S10878-018-0306-6zbMATH Open1402.90161OpenAlexW2804580808WikidataQ129812887 ScholiaQ129812887MaRDI QIDQ721928FDOQ721928

Authors: Xiao Zhang, Haosheng Fan, Victor C. S. Lee, Minming Li, Yingchao Zhao, Chuang Liu 

Publication date: 20 July 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-018-0306-6

Recommendations

• Weak coverage of a rectangular barrier
• New Algorithms for Barrier Coverage with Mobile Sensors
• Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
• Barrier Coverage with Uniform Radii in 2D
• ``Green barrier coverage with mobile sensors

zbMATH Keywords

approximation algorithmwireless sensor networksbarrier coveragerange assignment

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Communication networks in operations research (90B18)

Cites Work

• Covering Points by Unit Disks of Fixed Location
• Coverage by randomly deployed wireless sensor networks
• New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
• Optimal point movement for covering circular regions
• Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
• Minimizing the aggregate movements for interval coverage
• A better constant-factor approximation for weighted dominating set in unit disk graph
• An efficient privacy-preserving compressive data gathering scheme in WSNs
• Weak coverage of a rectangular barrier
• A PTAS for the disk cover problem of geometric objects
• Maximizing Barrier Coverage Lifetime with Mobile Sensors
• A Novel Node Placement for Long Belt Coverage in Wireless Networks
• Minimizing the maximum moving cost of interval coverage

Cited In (8)

• Optimising the barrier coverage of a wireless sensor network with hub-and-spoke topology using mathematical and simulation models
• Title not available (Why is that?)
• A 2-approximation algorithm for barrier coverage by weighted non-uniform sensors on a line
• Approximation Algorithms for Barrier Sweep Coverage
• Algorithms for covering multiple barriers
• Improved PTASs for convex barrier coverage
• Algorithm for partial sweep coverage on a line
• The minimum barrier distance: a summary of recent advances

This page was built for publication: Minimizing the total cost of barrier coverage in a linear domain

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