Abstract
We consider an interval coverage problem. Given n intervals of the same length on a line L and a line segment B on L, we want to move the intervals along L such that every point of B is covered by at least one interval and the sum of the moving distances of all intervals is minimized. As a basic geometry problem, it has applications in mobile sensor barrier coverage in wireless sensor networks. The previous work solved the problem in \(O(n^2)\) time. In this paper, by discovering many interesting observations and developing new algorithmic techniques, we present an \(O(n\log n)\) time algorithm. We also show an \(\varOmega (n\log n)\) time lower bound for this problem, which implies the optimality of our algorithm.
Similar content being viewed by others
References
Akyildiz, I., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Comput. Netw. 38(4), 393–422 (2002)
Bar-Noy, A., Rawitz, D., Terlecky, P.: Maximizing barrier coverage lifetime with mobile sensors. In: Proceedings of the 21st European Symposium on Algorithms (ESA), pp. 97–108, (2013)
Bhattacharya, B., Burmester, B., 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, A., Kumar, S., Lai, T.: Designing localized algorithms for barrier coverage. In: Proc. of the 13th Annual ACM International Conference on Mobile Computing and Networking, pp. 63–73, (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, 374–408 (2013)
Chen, D.Z., Tan, X., Wang, H., Wu, G.: Optimal point movement for covering circular regions. Algorithmica 72, 379–399 (2015)
Czyzowicz, J., Kranakis, E., Krizanc, D., Lambadaris, I., Narayanan, L., Opatrny, J., Stacho, L., Urrutia, J., Yazdani, M.: On minimizing the maximum sensor movement for barrier coverage of a line segment. In: Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks, pp. 194–212, (2009)
Czyzowicz, J., Kranakis, E., Krizanc, D., Lambadaris, I., Narayanan, L., Opatrny, J., Stacho, L., Urrutia, J., Yazdani, M.: On minimizing the sum of sensor movements for barrier coverage of a line segment. In: Proceedings of the 9th International Conference on Ad-Hoc, Mobile and Wireless Networks, pp. 29–42, (2010)
Hu, S.: ‘Virtual Fence’ along border to be delayed. Washington Post, February 28, (2008)
Kumar, S., Lai, T., Arora, A.: Barrier coverage with wireless sensors. Wirel. Netw. 13(6), 817–834 (2007)
Li, M., Sun, X., Zhao, Y.: Minimum-cost linear coverage by sensors with adjustable ranges. In: Proceedings of the 6th International Conference on Wireless Algorithms, Systems, and Applications, pp. 25–35, (2011)
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.: On Routing, Backbone Formation and Barrier Coverage in Wireless Ad Doc and Sensor Networks. PhD thesis, Concordia University, Montreal, Quebec, Canada, (2011)
Mehrandish, M., Narayanan, L., Opatrny, J.: Minimizing the number of sensors moved on line barriers. In: Proceedings of IEEE Wireless Communications and Networking Conference (WCNC), pp. 653–658, (2011)
Tan, X., Wu, G.: New algorithms for barrier coverage with mobile sensors. In: Proceedings of the 4th International Workshop on Frontiers in Algorithmics, pp. 327–338, (2010)
Yang, S., Li, M., Wu, J.: Scan-based movement-assisted sensor deployment methods in wireless sensor networks. IEEE Trans. Parallel Distrib. Syst. 18(8), 1108–1121 (2007)
Zou, Y., Chakrabarty, K.: A distributed coverage and connectivity-centric technique for selecting active nodes in wireless sensor networks. IEEE Trans. Comput. 54(8), 978–991 (2005)
Acknowledgments
We thank the anonymous reviewers for their comments that help improve the presentation of the paper. This research was supported in part by NSF under Grant CCF-1317143.
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of this paper appeared in the Proceedings of the 14th Algorithms and Data Structures Symposium (WADS 2015).
Rights and permissions
About this article
Cite this article
Andrews, A.M., Wang, H. Minimizing the Aggregate Movements for Interval Coverage. Algorithmica 78, 47–85 (2017). https://doi.org/10.1007/s00453-016-0153-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-016-0153-8