传感技术学报2017，Vol.30Issue(9)：1422-1426,5.DOI:10.3969/j.issn.1004-1699.2017.09.021
面向异构网络的基于k-覆盖的休眠调度算法
k-Cover Based-Sleep Scheduling Algorithm for Redundant Node in Heterogeneous WSNs
摘要
Abstract
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.关键词
无线传感网/覆盖/冗余节点/调度算法/网络寿命Key words
wireless sensor network/coverage/redundant node/scheduling algorithm/network lifetime分类
信息技术与安全科学引用本文复制引用
王自力,郑鑫..面向异构网络的基于k-覆盖的休眠调度算法[J].传感技术学报,2017,30(9):1422-1426,5.基金项目
河南省高等学校青年骨干教师计划项目( 2015GGJS-300) （ 2015GGJS-300）
