Abstract
Given a set of sensors distributed on the plane and a set of Point of Interests (POIs) on a line segment, a primary task of the mobile wireless sensor network is to schedule a coverage of the POIs by the sensors, such that each POI is monitored by at least one sensor. For balancing the energy consumption, we study the min-max line barrier target coverage (LBTC) problem which aims to minimize the maximum movement of the sensors from their original positions to final positions for the coverage. We first proved that when the radius of the sensors are non-uniform integers, even 1-dimensional LBTC (1D-LBTC), a special case of LBTC in which the sensors are distributed on the line segment instead of the plane, is \(\mathcal{NP}\)-hard. The hardness result is interesting, since the continuous version of LBTC of covering a given line segment instead of the POIs is known polynomial solvable [2]. Then we presented an exact algorithm for LBTC with sensors of uniform radius distributed on the plane, via solving the decision version of LBTC. We showed that our algorithm always finds an optimal solution in time \(O(mn(\log m+ \log n))\) to LBTC when there exists any, where m and n are the numbers of POIs and sensors.
The research is supported by Natural Science Foundation of China (Nos. 61772005, 61672005, 61300025) and Natural Science Foundation of Fujian Province (No. 2017J01753).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Bhattacharya, B., 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)
Chen, D., Yan, G., Li, J., Wang, H.: Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain. Discrete Comput. Geom. 50(2), 374–408 (2013)
Cherry, A., Gudmundsson, J., Mestre, J.: Barrier coverage with uniform radii in 2D. In: Fernández Anta, A., Jurdzinski, T., Mosteiro, M.A., Zhang, Y. (eds.) ALGOSENSORS 2017. LNCS, vol. 10718, pp. 57–69. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-72751-6_5
Czyzowicz, J., et al.: On minimizing the maximum sensor movement for barrier coverage of a line segment. In: Ruiz, P.M., Garcia-Luna-Aceves, J.J. (eds.) ADHOC-NOW 2009. LNCS, vol. 5793, pp. 194–212. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04383-3_15
Czyzowicz, J., et al.: On minimizing the sum of sensor movements for barrier coverage of a line segment. In: Nikolaidis, I., Wu, K. (eds.) ADHOC-NOW 2010. LNCS, vol. 6288, pp. 29–42. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14785-2_3
Dobrev, S., et al.: Complexity of barrier coverage with relocatable sensors in the plane. Theor. Comput. Sci. 579, 64–73 (2015)
Gage, D.W.: Command control for many-robot systems. Technical report, Naval Command Control and Ocean Surveillance Center RDT and E Div, San Diego, CA (1992)
Kumar, S., Lai, T.H., Arora, A.: Barrier coverage with wireless sensors. In: Proceedings of the 11th Annual International Conference on Mobile Computing and Networking, pp. 284–298. ACM (2005)
Li, S., Shen, H.: Minimizing the maximum sensor movement for barrier coverage in the plane. In: IEEE Conference on Computer Communications (INFOCOM), pp. 244–252. IEEE (2015)
Li, X., Frey, H., Santoro, N., Stojmenovic, I.: Localized sensor self-deployment with coverage guarantee. ACM SIGMOBILE Mob. Comput. Commun. Rev. 12(2), 50–52 (2008)
Mehrandish, M., Narayanan, L., Opatrny, J.: Minimizing the number of sensors moved on line barriers. In: IEEE Wireless Communications and Networking Conference (WCNC), pp. 653–658. IEEE (2011)
Tan, X., Wu, G.: New algorithms for barrier coverage with mobile sensors. In: Lee, D.-T., Chen, D.Z., Ying, S. (eds.) FAW 2010. LNCS, vol. 6213, pp. 327–338. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14553-7_31
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Huang, P., Zhu, W., Guo, L. (2019). On the Complexity of and Algorithms for Min-Max Target Coverage On a Line Boundary. In: Gopal, T., Watada, J. (eds) Theory and Applications of Models of Computation. TAMC 2019. Lecture Notes in Computer Science(), vol 11436. Springer, Cham. https://doi.org/10.1007/978-3-030-14812-6_19
Download citation
DOI: https://doi.org/10.1007/978-3-030-14812-6_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-14811-9
Online ISBN: 978-3-030-14812-6
eBook Packages: Computer ScienceComputer Science (R0)