针对三维无线传感器网络最坏情况覆盖问题,提出一种基于概率和网络最坏情况覆盖的三维传感器网络节点K覆盖方法,该方法先对三维待监测区域以网格划分,然后将前K(K为覆盖度)个传感器节点放置在网格点后,分别求取这K个节点的最大突破路径,在路径的公共点上依次放置传感器节点,直到每个网格点以预设的概率达到K覆盖为止.该方法能够减少网络资源.仿真表明,该方法与原基于概率的K覆盖方法比较,能用较少的节点满足相同的覆盖度.
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 re- source. The results show that this method can satisfy the same coverage with fewer nodes, compared to the tra- ditional probability-based K-coverage methods.