摘要
构造连通支配集是解决数据收集问题的一种较有效方法,现有算法在构造连通支配集时只考虑支配集的大小,造成支配集有效期短,易产生盲点及传输数据能耗大.针对如上缺陷,综合考虑支配集的大小、节点能量及节点到基站的路径,提出了一个基于广度优先搜索生成树的算法.模拟实验表明,该算法的系统生命期比现有算法提高20%左右,延迟缩短17%左右.
It＇s an efficient way to solve data collection problem by constructing connected dominating set. But previous works only considered the size of connected the dominating set, which resulted in short duration of the set, generating blind points easily and great energy consumption in data transmission. To solve above deficiencies, an algorithm based on breadth-first spanning tree was proposed in which the size of dominating set, energy of nodes and paths from nodes to base station were all considered. Simulation results show that the algorithm can improve system lifetime by 20% and decrease delay by 17% in comparison with previous algorithms.
基金
国家发展改革委员会项目(CNGI-04-10-2A)
国家重点基础研究发展(973)计划(2003CB317000)资助
关键词
无线传感器网络
数据收集
连通支配集
wireless sensor network
data collection
connected dominating set
作者简介
陆克中，男，1982年生，博士生．研究方向：无线传感器网络．E-mail：kzlu@szu．edu．cn
通讯作者：黄刘生，教授．Email：lshuang@ustc．edu．cn
