无线传感器网络中一种关键节点集轮换算法  

Cover Set Alternation Algorithm in Wireless Sensor Networks

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

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

出　　处：《系统仿真学报》2010年第6期1380-1385,1401,共7页Journal of System Simulation

基　　金：国家高技术研究发展计划重点项目(2007AA041201);国家自然科学基金(60903159;60673159;70671020);教育部科学技术研究重点项目资助(108040);高等学校博士学科点专项科研基金资助课题(20060145012;20070145017)

摘　　要：针对传感器网络多跳通信和多对一的流量特征,提出负载均衡的约束条件,将关键节点集选取问题转化为多目标优化问题,提出一种基于非支配遗传算法的关键节点集轮换算法。通过节点密度控制机制,从投放的节点池中选取关键节点集,以满足监测区域覆盖连通。在每轮网络工作的开始,激活不同的关键节点集,保证在每个时刻,有且仅有一个节点集完成对网络的充分覆盖。仿真结果表明该算法能够快速收敛于最优解,极大化网络关键节点集数目,有效延长网络的生存时间。Giving full consideration to the characters of multi-hop communications and many-to-one data capacity in wireless sensor networks, the restrictive conditions of load balance was proposed, and the problem of key cover set selection was transformed into multi-objective optimal problem. As a contribution, a novel algorithm based on NSGA-II （elitist non-dominated sorting genetic algorithm） was proposed to alternate the key cover set, which could select exclusive key cover set through the node density control mechanism. In each round of the network, only one of the key cover sets was activated to ensure the full coverage. Extensive simulation results demonstrate the effectiveness of the approach.

关 键 词：无线传感器网络 多目标优化 负载均衡 关键节点集 轮换 

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