密集传感器网络中节点随机调度算法研究  

Node Scheduling Algorithm for Dense Wireless Sensor Networks

作　　者：吴晓培[1] 吴跃[1] 陈湘[1] 

机构地区：[1]电子科技大学计算机科学与工程学院,成都610054

出　　处：《电子科技大学学报》2010年第1期119-122,共4页Journal of University of Electronic Science and Technology of China

基　　金：国家863计划(2007AA01Z443)

摘　　要：对于密集型传感器网络,节点交替工作能有效地延长网络的生命周期。该文基于Cover的随机节点调度算法进行深入分析,首先给出k-覆盖网络中覆盖强度的定义,并利用基本概率理论估计k-覆盖网络的覆盖强度;然后分析2-覆盖网络中节点密度、覆盖强度以及能量节省水平之间的关系(即部署节点个数n和2-覆盖网络的覆盖强度Cn2以及划分COVER个数c)。该文研究工作对部署容错性较高的能量有效性传感器网络具有一定的指导意义。For dense wireless sensor networks （WSN）, nodes working staggerly is one efficient approach of extending network＇s lifetime. An analysis of random sensor scheduling algorithm based on COVER is conducted in this paper. The defmition of coverage intensity in k-coverage network is presented and its corresponding formula is estimated using elementary probability theory. A precise analysis about 2-coverage network and a mathematical relationship among coverage intensity, node density and the level of energy conserving （i.e., the number of deploying nodes n, the coverage intensity of 2-coverage network C2, and the number of divided Cover c） are proposed. The result can be applied to deploy an energy-efficiency WSN possessing of high fault-tolerant performance.

关 键 词：容错性 k-覆盖网络 节点随机调度 无线传感器网络 

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