Abstract：This paper proposed a new three-dimensional sensor network nodes covering method based on a probabilistic model and worst-case coverage.It was for the worst-case coverage problem in 3D wireless sensor networks.Firstly, three-dimensional monitoring area was divided by grid.Then, the front K sensor nodes were placed in the grid points.The biggest breakthroughs paths of K nodes were stroked.The sensor nodes were placed on the common paths until each grid point reached K coverage.This method can reduce the network resource.The results show that this method can satisfy the same coverage with fewer nodes, compared to the traditional probability-based K-coverage methods.

Keyword：wireless sensor networks;three-dimensional coverage;worst coverage;K-coverage;