| Abstract: |
Efficient deployment strategies are proposed for a mobile sensor network, where the coverage priority of different points in the field is specified by a prescribed weight function. According to these strategies, each sensor detects coverage holes within its Voronoi polygon, and then moves in a proper direction to reduce them. Since the coverage priority of different points in the field is not the same, the target location of each sensor is determined based on the weights of the points inside the corresponding Voronoi polygon (or its vertices). Simulations confirm the theoretical results. |
