Efficient Line K-Coverage Algorithms in Mobile Sensor Network

• Published in: Wireless Algorithms, Systems, and Applications Vol. 9204; pp. 581 - 591
• Main Authors: Wang, Yang, Wu, Shuang, Gao, Xiaofeng, Wu, Fan, Chen, Guihai
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 2015; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Algorithms & data structures; Barrier Coverage; Hungarian Algorithm; Information retrieval; Minsize; Mobile Sensor Networks; Network hardware; Redundancy Rate
• ISBN: 9783319218366; 3319218360
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-319-21837-3_57

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.