WSN随机调度覆盖算法的子集划分最优解

The optimal sets partition of randomized scheduling algorithm in WSN

随机调度覆盖算法实现对传感器进行随机调度,是利用传感器之间的覆盖冗余来延长网络的寿命.为此采用概率模型对随机调度覆盖算法进行分析,并且当被监测区域的面积和监测时间给定以后,在覆盖强度、传感器密度、能量节约和网络寿命的约束条件下,求解出随机调度覆盖算法中的子集划分和传感器数量的最优解.

The randomized scheduling coverage algorithm was used to schedule sensors randomly and to prolong the longevity of the whole sensor network due to the existence of many redundant sensors in the network. After a presentation of probability analysis of the algorithm the optimal sets partition and quantity of sensors were proposed under the constraints of coverage intensity, node density, energy saving and network longevity. And then simulations were conducted to evaluate the solution.