摘要
针对某些特定场合无线传感器网络中存在大量冗余节点造成网络资源浪费的问题,提出一种新的冗余节点融合树算法(简称RNAT)。基于分簇网络结构,采用探测区域完全覆盖的冗余节点标识方法,并综合利用节点剩余能量和距离等参数选择树上节点,以洪泛广播方式构建冗余节点融合树。算法让簇内冗余节点承担簇头的一部分工作,降低了分簇网络结构中簇头的能耗,均衡了网络能量分布。仿真实验结果表明,RNAT机制的引入可以有效提高HEED-M算法的性能,使网络生命期延长20%左右。
A novel redundant nodes aggregation tree algorithm （RNAT） is presented in consideration of the plentiful redundant nodes in some wireless sensor networks. Based on the clustering network structure, the redundant nodes are identified by checking whether the node＇s sensing area is completely covered or not, and then, the tree nodes are chosen according to the nodes＇ residual energy and distance parameters. The redundant nodes aggregation tree is set up via broadcasting messages in the network. In the algorithm, the in-cluster redundant nodes do some work instead of the cluster head. As a result, the energy consumption of the cluster head can be reduced and the energy load in the network can be balanced. For example, RNAT can improve the performance of HEED-M effectively. The network lifetime is prolonged by about 20 %.
出处
《传感技术学报》
CAS
CSCD
北大核心
2008年第6期1029-1033,共5页
Chinese Journal of Sensors and Actuators
基金
国家高技术研究发展计划(863计划)专项经费资助(2006AA01Z222)
北京市教育委员会共建项目专项资助
关键词
无线传感器网络
数据融合
冗余节点
融合树
wireless sensor networks
data aggregatiom redundant nodes
aggregation tree
