一种基于网格模型的无限传感器网络K区域覆盖算法  

An Algorithm for K-Coverage in Wireless Sensor Networks Based on Grid Model

作　　者：王淑礼[1] 张鹏[1] 

机构地区：[1]信阳师范学院计算机与信息技术学院,河南信阳464000

出　　处：《数学的实践与认识》2011年第13期99-104,共6页Mathematics in Practice and Theory

基　　金：河南省教育厅自然科学研究计划项目(2010B520024)

摘　　要：目前无限传感器网络K覆盖问题的解决机制大都有颇为苛刻的假设条件,如要求节点具有很强的能量、节点的感知区域能被精确定义等.提出了一个基于布尔感知理论的分布式网格模型及相应的K区域覆盖算法,能够很好地处理感知区域形状不规则及大小发生变化的K覆盖问题,算法时间复杂度小,适用范围广泛.仿真实验证明了算法的有效性.The normal methods for K：coverage in the Wireless Sensor Network always have some constraints, such as the large energey of the nodes, the regular sensing ranges and so on. This paper considers the situation that the coverage area is not regular and proposes a model of distributed grid model based on Boolean Sensing Theory. Thus we also propose an algorithm for K-coverage based on the grid model. With its advantages of dealing with irregular and changeable sensing area for K-coverage, the algorithm is efficient and suitable to the complexity of the network.

关 键 词：无限传感器网络 K覆盖 分布式 网格模型 

分 类 号：TN929.5[电子电信—通信与信息系统] TP212.9[电子电信—信息与通信工程]