无线传感器网络中基于遗传算法的优化覆盖机制  

Optimal coverage scheme based on genetic algorithm in wireless sensor networks

作　　者：贾杰[1] 陈剑[1] 常桂然[2] 赵林亮[1] 王光兴[1] 

机构地区：[1]东北大学信息科学与工程学院,沈阳110004 [2]东北大学计算中心,沈阳110004

出　　处：《控制与决策》2007年第11期1289-1292,1301,共5页Control and Decision

基　　金：教育部高等学校博士点专项基金项目(20030145017);国家863计划项目(2003AA712032)

摘　　要：覆盖作为无线传感器网络应用的一个基本问题,反映了网络监测和实现目标跟踪的质量效果.针对传感器节点的高密度部署情况,研究了工作节点集选取问题.提出两种基于加权遗传算法和基于约束遗传算法的优化覆盖机制.根据生成的适值函数进行遗传算法操作,并计算传感器网络充分覆盖区域所需的近似最优工作节点集.仿真结果表明该算法能快速收敛于最优解,完成工作节点集的优化选取,从而降低网络冗余,延长网络生存时间.As one of the basic problems in wireless sensor networks, coverage reflects the effect of monitoring and tracking. Due to the high density of distributing nodes in wireless sensor networks, the serarching algorithm for the optimal working sensor set is studied. Two optimal coverage control schemes based on weighted genetic algorithm and constrained genetic algorithm are proposed respectively, to compute the sub-optimal working sensor set maintaining the full coverage of the network. The number of working nodes and the network redundancy are reduced to extend network lifetime. Finally, simulation results validate the claims.

关 键 词：无线传感器网络 覆盖 遗传算法 网络生存时间 

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