Next Article in Journal
Fault Detection of Electric Impact Drills and Coffee Grinders Using Acoustic Signals
Previous Article in Journal
Efficient Location Service for a Mobile Sink in Solar-Powered Wireless Sensor Networks
Previous Article in Special Issue
An Optimized Probabilistic Delay Tolerant Network (DTN) Routing Protocol Based on Scheduling Mechanism for Internet of Things (IoT)
Article Menu
Issue 2 (January-2) cover image

Export Article

Open AccessArticle
Sensors 2019, 19(2), 273;

Optimizing Movement for Maximizing Lifetime of Mobile Sensors for Covering Targets on a Line

College of Physics and Information Engineering, Fuzhou University, Fuzhou 350116, China
College of Mathematics and Computer Science, Fuzhou University, Fuzhou 350116, China
Author to whom correspondence should be addressed.
Received: 13 December 2018 / Revised: 6 January 2019 / Accepted: 8 January 2019 / Published: 11 January 2019
(This article belongs to the Special Issue Algorithm and Distributed Computing for the Internet of Things)
Full-Text   |   PDF [383 KB, uploaded 11 January 2019]   |  


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 covering 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 their final positions at which the coverage is composed. 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 NP -hard. The hardness result is interesting, since the continuous version of LBTC to cover a given line segment instead of the POIs is known polynomial solvable. Then we present an exact algorithm for LBTC with uniform radius and sensors distributed on the plane, via solving the decision version of LBTC. We argue that our algorithm runs in time O ( n 2 log n ) and produces an optimal solution to LBTC. The time complexity compares favorably to the state-of-art runtime O ( n 3 log n ) of the continuous version which aims to cover a line barrier instead of the targets. Last but not the least, we carry out numerical experiments to evaluate the practical performance of the algorithms, which demonstrates a practical runtime gain comparing with an optimal algorithm based on integer linear programming. View Full-Text
Keywords: mobile sensor; ??-hard; target coverage; line boundary; optimal solution mobile sensor; ??-hard; target coverage; line boundary; optimal solution

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Huang, P.; Zhu, W.; Guo, L. Optimizing Movement for Maximizing Lifetime of Mobile Sensors for Covering Targets on a Line. Sensors 2019, 19, 273.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top