研究传感器节点随机部署于监测区域内,无节点地理位置信息情况下,如何能量有效地保证网络的通信连通与感知覆盖；节点采用基于概率的联合感知模型.提出CDS-based SSCA算法,其为一种基于连通支配集构造树的节点调度机制,每个节点根据剩余能量和与父节点的距离来设置等待时间及成为候选节点优先级.模拟实验结果显示,本算法能够能量有效地满足感知覆盖和连通覆盖要求；与ASW算法相比较,工作节点个数较少,网络生命周期明显延长,降低了网络整体耗能.%This paper researched on how to energy-efficiently schedule sensor nodes and met both constraints of connectivity and coverage,in condition of random deployment policy without accurate location information. In addition,it employed sensors in probabilistic cooperative sensing model. This paper proposed a sensor scheduling algorithm called CDS-based SSCA based on connected dominating set. Sensor node had its own scheduling priority and waiting time on the basis of its residue energy and the distance between them and those parent node. Simulation results show that this algorithm can effectively satisfy connectivity and coverage of network. Compared with ASW( adaptive sensor scheduling) algorithm, CDS-based SSCA has less activity sensor nodes,thus,it can effectively prolong the network' s lifetime and save the network' s energy.
展开▼
