Abstract
Let R be a connected closed region in the plane and let S be a set of n points (representing mobile sensors) in the interior of R. We think of R’s boundary as a barrier which needs to be monitored. This gives rise to the barrier coverage problem, where one needs to move the sensors to the boundary of R, so that every point on the boundary is covered by one of the sensors. We focus on the variant of the problem where the goal is to place the sensors on R’s boundary, such that the distance (along R’s boundary) between any two adjacent sensors is equal to R’s perimeter divided by n and the sum of the distances traveled by the sensors is minimum. In this paper, we consider the cases where R is either a circle or a convex polygon. We present a PTAS for the circle case and explain how to overcome the main difficulties that arise when trying to adapt it to the convex polygon case. Our PTASs are significantly faster than the previous ones due to Bhattacharya et al. [4]. Moreover, our PTASs require efficient solutions to problems, which, as we observe, are equivalent to the circle-restricted and line-restricted Weber problems. Thus, we also devise efficient PTASs for these Weber problems.
R. Saban and Y. Stein were partially supported by the Lynn and William Frankel Center for Computer Sciences. M. Katz was partially supported by grant 1884/16 from the Israel Science Foundation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Actually, one can show that the two problems are equivalent, but we are only interested in the one-sided reduction described.
References
Agarwal, P.K., Efrat, A., Sharir, M.: Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. SIAM J. Comput. 29(3), 912–953 (1999)
Andrews, A.M., Wang, H.: Minimizing the aggregate movements for interval coverage. Algorithmica 78(1), 47–85 (2017)
Bajaj, C.L.: The algebraic degree of geometric optimization problems. Discret. Comput. Geom. 3, 177–191 (1988)
Bhattacharya, B.K., Burmester, M., Hu, Y., Kranakis, E., Shi, Q., Wiese, A.: Optimal movement of mobile sensors for barrier coverage of a planar region. Theor. Comput. Sci. 410(52), 5515–5528 (2009)
Bose, P., Maheshwari, A., Morin, P.: Fast approximations for sums of distances, clustering and the Fermat-Weber problem. Comput. Geom. 24(3), 135–146 (2003)
Chen, A., Kumar, S., Lai, T.: Designing localized algorithms for barrier coverage. In: Proceedings of the 13th Annual International Conference on Mobile Computing and Networking, MOBICOM 2007, pp. 63–74 (2007)
Chen, D.Z., Gu, Y., Li, J., Wang, H.: Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain. Discret. Comput. Geom. 50(2), 374–408 (2013)
Chen, D.Z., Tan, X., Wang, H., Wu, G.: Optimal point movement for covering circular regions. Algorithmica 72(2), 379–399 (2015)
Dobrev, S., Durocher, S., Hesari, M.E., Georgiou, K., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J., Shende, S.M., Urrutia, J.: Complexity of barrier coverage with relocatable sensors in the plane. Theor. Comput. Sci. 579, 64–73 (2015)
Kumar, S., Lai, T., Arora, A.: Barrier coverage with wireless sensors. Wirel. Netw. 13(6), 817–834 (2007)
Sharathkumar, R., Agarwal, P.K.: A near-linear time \(\epsilon \)-approximation algorithm for geometric bipartite matching. In: Proceedings of the 44th Symposium on Theory of Computing, STOC 2012, pp. 385–394 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Carmi, P., Katz, M.J., Saban, R., Stein, Y. (2018). Improved PTASs for Convex Barrier Coverage. In: Solis-Oba, R., Fleischer, R. (eds) Approximation and Online Algorithms. WAOA 2017. Lecture Notes in Computer Science(), vol 10787. Springer, Cham. https://doi.org/10.1007/978-3-319-89441-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-89441-6_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-89440-9
Online ISBN: 978-3-319-89441-6
eBook Packages: Computer ScienceComputer Science (R0)