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

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 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(n2prefixlogn) and produces an optimal solution to LBTC. The time complexity compares favorably to the state-of-art runtime O(n3prefixlogn) 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.

Deployment Optimization Method of Multistatic Radar for Constructing Circular Barrier Coverage

“…Regarding various scenarios and tasks, barrier coverage problems were extensively and profoundly studied in the last decade. The models that have been studied can be divided into three categories: the disk coverage model [ 8 , 22 , 23 , 24 , 25 ], sector coverage model [ 9 , 26 , 27 , 28 , 29 ], and Cassini coverage model [ 20 , 30 , 31 , 32 , 33 ].…”

“…Meanwhile, the branch-and-bound algorithm and multi-round shortest path algorithm are exploited to determine the maximum number of crossed barriers. Given a set of mobile sensors distributed on the plane and a set of targets located on a line, an exact algorithm was introduced to minimize the maximum movement of the sensors the work and cover the targets with minimum energy consumption [ 24 ]. In [ 25 ], the inspection robot was integrated into WSNs to form an efficient dynamic barrier coverage for monitoring the transmission lines.…”

Algorithm and Distributed Computing for the Internet of Things

“…The third article in this group is entitled "Optimizing Movement for Maximizing Lifetime of Mobile Sensors for Covering Targets on a Line" [7], by Peihuang Huang, Wenxing Zhu and Longkun Guo. The research starts from a set of sensors distributed on the plane and a set of Point of Interests (POIs) on a line segment.…”

Optimizing the Sensor Movement for Barrier Coverage in a Sink-Based Deployed Mobile Sensor Network

“…It also proposed an O(n 4 ) time algorithm for the MinSum problem when the sensors are moved from the circle perimeter to a regular n-gon. The work [21] studied how to cover the targets on the line by mobile sensors while minimizing the maximum sensor movement and it was proved that this problem is NP-hard when the sensors are initially on this line and the sensing ranges of sensors are non-uniform.…”