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

The optimal sets partition of randomized scheduling algorithm in WSN

作　　者：刘永生[1] 周颢[1] 赵保华[1] 

机构地区：[1]中国科学技术大学计算机科学与技术系

出　　处：《中国科学技术大学学报》2008年第3期225-229,共5页JUSTC

基　　金：国家自然科学基金重大研究计划(90104010);国家自然科学基金(60602016 ,60241004);中国高技术研究发展(863)计划(2003CB314801);华为基金(YJCB2006062 WL)资助

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

关 键 词：无线传感器网络 随机调度覆盖算法 子集划分 传感器数量 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]