Abstract
The deployment of sensors on a given field is an important issue that affects wireless sensor networks. Traditionally, all areas of a sensor field are equivalent, and multiple deployment algorithms are used to maximize the area covered by a given number of sensors or a certain budget. However, in many applications, such as fire control system, battlefield surveillance, detection of nuclear, biological, or chemical (NBC) attack, and other things, the areas must be weighted based on priority of deployment: the more critical the area, the higher the weight and the higher the priority. In this thesis, we introduce the problem of the weighted sensor field, and determine the maximum weight of the coverage area by deploying a given number of sensors on a given weighted field. We prove that this problem is an NP-Complete problem. And propose an algorithm to find a near-optimal solution for the weighted field sensor covering problem.