Abstract
In this paper, we address a new type of coverage problem in mobile sensor network, named Line K-Coverage. It guarantees that any line cutting across a region of interest will be detected by at least K sensors. We aim to schedule an efficient sensor movement to satisfy the line K-coverage while minimize the total sensor movements for energy efficiency, which is named as LK-MinMovs problem. We propose a pioneering layer-based algorithm LLK-MinMovs to solve it in polynomial time. Compared with a MinSum algorithm from previous literature to solve line 1-coverage problem, LLK-MinMovs fixes a critical flaw after finding a counter example for MinSum. We further construct two time-efficient heuristics named LK-KM and LK-KM+ based on the famous Hungarian algorithm. By sacrificing optimality a little bit, these two algorithms runs extremely faster than algorithm LLK-MinMovs. We validate the efficiency of our designs in numerical experiments and compare them under different experiment settings.
This work was supported in part by the State Key Development Program for Basic Research of China (973 project 2012CB316201), in part by China NSF grant 61422208, 61202024, 61472252, 61272443 and 61133006, CCF-Intel Young Faculty Researcher Program and CCF-Tencent Open Fund, the Shanghai NSF grant 12ZR1445000, Shanghai Chenguang Grant 12CG09, Shanghai Pujiang Grant 13PJ1403900, and in part by Jiangsu Future Network Research Project No. BY2013095-1-10. The opinions, findings, conclusions, and recommendations expressed in this paper are those of the authors and do not necessarily reflect the views of the funding agencies or the government.
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
Similar content being viewed by others
References
Liang, J.B., Liu, M., Kui, X.Y.: A survey of coverage problems in wireless sensor networks. Sens. Transducers 163(1), 240–246 (2014)
Kumar, S., Lai, T.H., Arora, A.: Barrier coverage with wireless sensors. In: The Annual International Conference on Mobile Computing and Networking (ICMCN), pp. 284–298 (2005)
Shen, C., Cheng, W., Liao, X., Peng, S.: Barrier coverage with mobile sensors. In: The IEEE International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN), pp. 99–104 (2008)
Balister, P., Zheng, Z., Kumar, S., Sinha, P.: Trap coverage: allowing coverage holes of bounded dimeter in wireless sensor network. In: The IEEE International Conference on Computer Communications (INFOCOM), pp. 136–144 (2009)
Baumgartner, K., Ferrari, S.: A geometric transversal approach to analyzing track coverage in sensor networks. IEEE Trans. Comput. 57(8), 1113–1128 (2008)
Harada, J., Shioda, S., Saito, H.: Path coverage properties of randomly deployed sensors with finite data-transmission ranges. Comput. Netw. 53(7), 1014–1026 (2009)
Ram, S.S., Manjunath, D., Iyer, S.K., Yogeshwaran, D.: On the path coverage properties of random sensor networks. IEEE Trans. Mob. Comput. 6(5), 446–458 (2007)
Mondal, D., Kumar, A., Bishnu, A., Mukhopadhyaya, K., Nandy, S.C.: Measuring the quality of surveillance in a wireless sensor network. Int. J. Found. Comput. Sci. 22(4), 983–998 (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)
Yang, S.H., Li, M.L., Wu, J.: Scan-based movement-assisted sensor deployment methods in wireless sensor networks. IEEE Trans. Parallel Distrib.Syst. 18(8), 1108–1121 (2007)
Hesari, M.E., Kranakis, E., Krizanc, D., Ponce, O.M., Narayanan, L., Opatrny, J., Shende, S.M.: Distributed algorithms for barrier coverage using relocatable sensors. In: The ACM Symposium on Principles of Distributed Computing (SPDC), pp. 383–392 (2013)
Bar-Noy, A., Rawitz, D., Terlecky, P.: Maximizing barrier coverage lifetime with mobile sensors. CoRR, vol. abs/1304.6358 (2013)
Saipulla, A., Westphal, C., Liu, B., Wang, J.: Barrier coverage with line-based deployed mobile sensors. Ad Hoc Netw. 11(4), 1381–1391 (2013)
Kuhn, H.W.: The Hungarian method for the assignment problem. Nav. Res. Logist. Q. 2, 83–97 (1955)
Munkres, J.: Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math. 5(1), 32–38 (1957)
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: International Conference on Ad Hoc Networks and Wireless (ADHOC-NOW), 6288: 29–42 (2010)
Chen, D.Z., Gu, Y., 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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Wang, Y., Wu, S., Gao, X., Wu, F., Chen, G. (2015). Efficient Line K-Coverage Algorithms in Mobile Sensor Network. In: Xu, K., Zhu, H. (eds) Wireless Algorithms, Systems, and Applications. WASA 2015. Lecture Notes in Computer Science(), vol 9204. Springer, Cham. https://doi.org/10.1007/978-3-319-21837-3_57
Download citation
DOI: https://doi.org/10.1007/978-3-319-21837-3_57
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21836-6
Online ISBN: 978-3-319-21837-3
eBook Packages: Computer ScienceComputer Science (R0)