面向异构网络的基于 k-覆盖的休眠调度算法

异构无线传感网络WSNs(Wireless Sensor Networks)的多数监测应用要求兴趣区域FoI(Field of Interest)是k覆盖(k-cover),且k≥1.而冗余节点被安排为休眠,进而最小化能量消耗.为此,提出面向异构网络的基于k-覆盖的冗余节点休眠算法k-CRSS(k-cover based sleep Scheduling algorithm for redundant node).k-CRSS算法引用概率方法判断节点是否为冗余节点,并推导判断一个节点是否为冗余节点的概率表述式.然后,引用调度算法识别所有冗余节点,并让它们进行休眠,且在FoI内不出现覆盖空洞.k-CRSS算法属分布式算法,并无需任何地理信息,仅通过少量控制消息收集邻居节点信息.实验数据表明,k-CRSS算法通过调度算法减少了活动节点数,进而延长了网络寿命.

k-cover based on redundant node sleep Scheduling algorithm in Heterogeneous WSNs

Some monitoring applications in heterogeneous wireless sensor networks( WSNs) may require the Field of Interest( FoI) be k-covered,k≥1,while redundant sensors must be scheduled to sleep to minimize energy consump-tion. Therefore,k-cover based sleep Scheduling algorithm( k-CRSS) for redundant node is proposed in this paper. k-CRSS algorithm has used probabilistic approach to determine if a sensor redundant to meet the desired coverage re-quirement of FoI. We derived an expression to determine the probability of the region covered by a sensor of any type being redundantly covered by the neighbors. We proposed a scheduling protocol to identify all the redundant sensor nodes and schedule them to sleep without creating a coverage hole in the FoI. The proposed protocol is com-pletely distributed,does not use any geographic information,and uses only the information gathered about the neigh-bors using a few control messages. Simulation results demonstrated that the number of active sensors is reduced due to the scheduling protocol,and hence,the network lifetime is increased.