【摘要】 在分析已有传感器网络覆盖控制协议的基础上,提出了一种分布式覆盖控制算法.针对节点随机部署的异构网络,通过研究网络中节点交点的必要性,得出必要节点交点的最低覆盖度即为区域覆盖度的结论,由此可将区域覆盖度的计算转化为特殊点的覆盖度计算,从而解决了覆盖算法计算复杂度高和不精确等问题.在此基础上,又提出了一种以保证k-覆盖为目标的节点调度策略(SEC),该策略按照时间轮次,根据精确覆盖度算法可分布式地确定节点的状态.仿真结果表明,SEC能够减少节点的通信量,使工作节点数摆脱总节点数的影响,从而延长了网络的生命周期.与经典覆盖控制算法相比,所提算法在保证网络覆盖度的前提下可有效降低工作节点的数量,提高大规模传感器网络的可扩展性.更多还原

【Abstract】 Based on analyzing the existing coverage control protocols for wireless sensor networks,a distributed coverage control strategy is proposed for heterogeneous sensor network with stochastically deployed nodes.By studying the necessity of the node intersection points,the conclusion that the lowest coverage degree of the necessary node intersection points is the coverage degree of the area is obtained,and hence the coverage degree of the whole monitoring region can be converted into the coverage degrees of some special points.The imprecision and complexity problems that appear in many existing protocols can be solved accordingly.A node scheduling strategy called SEC is also proposed based on the proposed coverage arithmetic.The nodes’ states are then decided in terms of the network operating time in rounds and the accurate coverage degree arithmetic.Simulation results show that the communications can be reduced observably in SEC,and the affect of the number of total nodes on the working nodes can be eliminated.The network lifetime is prolonged consequently.With k-coverage warranty the number of active nodes is reduced effectively compared with the classical strategies,and the SEC strategy has good expansibility.更多还原