RESUMO
Perimeter barriers can provide intrusion detection for a closed area. It is efficient for practical applications, such as coastal shoreline monitoring and international boundary surveillance. Perimeter barrier coverage construction in some regions of interest with irregular boundaries can be represented by its minimum circumcircle and every point on the perimeter can be covered. This paper studies circle barrier coverage in Bistatic Radar Sensor Network (BRSN) which encircles a region of interest. To improve the coverage quality, it is required to construct a circle barrier with a predefined width. Firstly, we consider a BR deployment problem to constructing a single BR circular barrier with minimum threshold of detectability. We study the optimized BR placement patterns on the single circular ring. Then the unit costs of the BR sensor are taken into account to derive the minimum cost placement sequence. Secondly, we further consider a circular BR barrier with a predefined width, which is wider than the breadth of Cassini oval sensing area with minimum threshold of detectability. We propose two segment strategies to efficiently divide a circular barrier to several adjacent sub-ring with some appropriate width: Circular equipartition strategy and an adaptive segmentation strategy. Finally, we propose approximate optimization placement algorithms for minimum cost placement of BR sensor for circular barrier coverage with required width and detection threshold. We validate the effectiveness of the proposed algorithms through theory analysis and extensive simulation experiments.
RESUMO
Wireless charging is an important issue in wireless sensor networks, since it can provide an emerging and effective solution in the absence of other power supplies. The state-of-the-art methods employ a mobile car and a predefined moving path to charge the sensor nodes in the network. Previous studies only consider a factor of the network (i.e., residual energy of sensor node) as a constraint to design the wireless charging strategy. However, other factors, such as the travelled distance of the mobile car, can also affect the effectiveness of wireless charging strategy. In this work, we study wireless charging strategy based on the analysis of a combination of two factors, including the residual energy of sensor nodes and the travelled distance of the charging car. Firstly, we theoretically analyze the limited size of the sensor network to match the capability of a charging car. Then, the networked factors are selected as the weights of traveling salesman problem (TSP) to design the moving path of the charging car. Thirdly, the charging time of each sensor node is computed based on the linear programming problem for the charging car. Finally, a charging period for the network is studied. The experimental results show that the proposed approach can significantly maximize the lifetime of the wireless sensor network.