无线传感器网络覆盖质量问题  

Coverage quality problem in wireless sensor networks

作　　者：张硕[1] 蒲菊华[1] 刘玉恒[1] 熊璋[1] 

机构地区：[1]北京航空航天大学计算机学院,北京100191

出　　处：《北京航空航天大学学报》2009年第5期631-635,共5页Journal of Beijing University of Aeronautics and Astronautics

基　　金：国家自然科学基金资助项目(60803120);北京航空航天大学研究生创新实践基金资助项目

摘　　要：降低功耗、延长寿命是无线传感器网络的一个重要问题,同时,对监测区域保持一定的覆盖质量才能及时捕捉到目标的状态变化.一种广泛采用的策略是选出能够满足监测区域质量要求的最小节点集作为工作节点,关闭其他冗余节点.因此,传感器网络中控制节点休眠与保持覆盖质量是两个重要方面.提出了一个数学模型,求解满足任意给定覆盖服务质量下所需的最小节点数.实验表明,当监测区域与节点感知区域比值较大时,提出的方法更为准确地计算出所需最小工作节点数,且此方法复杂度低、传感器节点的感知区域可以为任意形状.网络覆盖质量与节点休眠率同时达到最大化是一个NP难问题,采用遗传算法进行仿真实验尝试性解决这一问题,为传感器网络实际应用带来重要意义.Extending lifetime by scheduling node state and maintaining the coverage quality are two important aspects in wireless sensor networks （WSNs）. It was presented a mathematical model to compute minimum number of nodes under any given required coverage quality. Simulation results demonstrate that our approach is more accurate to compute minimum number of working nodes when the ratio of target region to sensor region is larger, and the complexity of this method is lower while the sensor＇s region can be perceived as arbitrary shapes. It is an NP-hard problem that network＇s coverage quality and ratio of sleeping nodes get to maximize together. It tried to solve this problem by using genetic algorithm for the experiments, which is significant in WSNs for the practical applications.

关 键 词：无线传感器网络 覆盖服务质量 最优组合 遗传算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]