摘要
提出了一种基于确定性覆盖的覆盖区划分方法,解决了一个确定的区域需要用多少个活动节点覆盖及覆盖区如何划分的问题.首先把节点覆盖区抽象为几何学中的圆.然后在保证网络一定连通性的约束条件下,通过动态规划的方法优化网络覆盖区数量和覆盖半径,使网络内所有覆盖区的半径累加和最小,剔除冗余的节点降低网络的覆盖成本.最后,对网络的抗毁性进行了分析,验证了本文的网络覆盖划分方法是有效的.
The research on the problem of the division of coverage region has been one of the vital focuses in Wireless Sensor Networks, which is important and necessary both in reality and scientific research. Firstly, the division of coverage region is abstracted as the circular question in the geometry. A method dealing with the division of coverage region is discussed in this paper based on certainty coverage. Secondly, under the condition of the connectivity, dynamic programming method is used to optimize the coverage regions and their radiuses, which minimizes the sum of radiuses and reduces the cost of the coverage of the network. Finally, the analysis of the survivability and robustness of the network has carried on and validated proposed algorithm.
出处
《河南大学学报(自然科学版)》
CAS
北大核心
2008年第4期410-413,共4页
Journal of Henan University:Natural Science
基金
河南省高等学校创新人才培养工程
河南省教育厅自然科学基金(2006510001)
关键词
无线传感器网络
覆盖
抗毁性
wireless sensor networks'
coverage
survivability