Minimum Cost Placement of Bistatic Radar Sensors for Belt Barrier Coverage

How to construct barrier coverage efficiently is a critical problem for many wireless sensor network applications, such as boundary surveillance and intrusion detection. In this paper, we study the belt barrier coverage in bistatic radar sensor networks. Much different from the disk and sector coverage, the coverage area of bistatic radar is dependent on the distance between a pair of radar transmitter and receiver. To improve coverage quality, we require to construct a belt barrier with the breadth not smaller than a predefined threshold. Furthermore, the unit cost of a radar transmitter may be different from a receiver. The bistatic radar placement problem is to construct a belt barrier with the minimum total placement cost. To solve the minimum cost placement problem, we propose a line-based equipartition placement strategy such that all radars placed on a deployment line can form a barrier with some breadth and one or more such placement lines can form a belt barrier with the required breadth. We first study the barrier property of different placement patterns on one deployment line, and prove the structure property of the optimal placement sequence on one deployment line. When multiple deployment lines are needed for belt barrier construction, we propose algorithms to find out the number of deployment lines and the number of receivers in the optimal placement pattern on each deployment line to minimize the total placement cost. The efficiency of the proposed algorithm is also validated by our simulation results.