独立生命素的最大-最小子集调度算法  

Maximum-minimum Set Dispatching Algorithm Based on Respective Biogen

作　　者：秦宁宁 陈家乐 丁志国[2] 

机构地区：[1]江南大学轻工过程先进控制教育部重点实验室,江苏无锡214122 [2]纽卡斯尔大学电气电子和计算机工程系

出　　处：《小型微型计算机系统》2015年第5期1059-1063,共5页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(61304264)资助;国家教育部博士点专项基金项目(20100093120007)资助

摘　　要：为实现传感器网络生命周期的最大化,针对网络中节点的调度问题展开研究.提出一种独立生命素的最大-最小子集调度算法(Maximum-Minimum Set Dispatching Algorithm Based on Respective Biogen,MMDARB).该算法以独立传感器节点子集的生命素为筛选因子,通过轮盘赌法的方式,建立最大不相关且代价最小的激活节点子集(简称最大-最小子集),以尽可能少的节点实现对区域的覆盖.经对比实验验证,算法MMDARB具有更高的计算效率,所生成的最大-最小子集,以更少的能量消耗,保证了网络覆盖率≥97%,有效的延长了网络生命周期.In order to maximize lifetime of Wireless Sensor Networks （ WSNs ）, it is important to study the problem of scheduling of the network nodes. This paper presents a maximum-minimum set dispatching algorithm based on respective biogen of network nodes （ MMDARB ）. This algorithm considers the biogen of a subset of independent sensor nodes as screening factor to find a maximum disjoint and minimum cost set of active nodes（ Maximum-Minimum set ） by roulette wheel selection, which achieves to coverage the area of interesting by nodes as little as possible. Experimental results show that the MMDARB has higher computational efficiency and the maximum disjoint and minimum cost set of active nodes achieve to prolong network lifetime effectively in the premise of ensuring the network coverage of no less than 97% in the WSNs.

关 键 词：传感器网络 独立生命素 轮盘赌法 最大-最小激活节点子集 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]