Sensor Placement for Sensing Coverage and Data Precision in Wireless Sensor Networks

We present a novel paradigm of sensor placement concerning data precision and estimation.Multiple abstract sensors are used to measure a quantity of a moving target in the scenario of a wireless sensor network.These sensors can cooperate with each other to obtain a precise estimate of the quantity in a real-time manner.We consider a problem on planning a minimum-cost scheme of sensor placement with desired data precision and resource consumption.Measured data is modeled as a Gaussian random variable with a changeable variance.A gird model is used to approximate the problem.We solve the problem with a heuristic algorithm using branch-and-bound method and tabu search.Our experiments demonstrate that the algorithm is correct in a certain tolerance,and it is also efficient and scalable.