时延受限能耗均衡的无线传感网数据采集树  

Delay-constraint energy-balance data collection tree in wireless sensor network

作　　者：张帅[1] 李凤荣[1] 林振华[1] 王营冠[1] 

机构地区：[1]中国科学院上海微系统与信息技术研究所,上海200050

出　　处：《计算机工程与应用》2011年第9期12-15,共4页Computer Engineering and Applications

基　　金：国家科技重大专项(No.2009ZX03006-001)~~

摘　　要：为延长网络寿命,缩短网络汇聚时延,提出了一个时延受限,能耗均衡的传感网数据采集树构建方法。该方法以节点的剩余能量和节点间距离为参数构建权值函数,使用Dijkstra算法计算一个最小加权能耗生成树。在此基础上,沿最小加权路径,对生成树进行局部调整,从而在满足时延要求的同时,均衡网络能耗。实验表明,该方法延长了网络平均生存期,达到了均衡网络能耗的目的。In order to prolong the network lifetime and decrease the network convergency delay,a delay-constraint energy-balance data collection tree construction method for wireless sensor networks is proposed.It firstly builds a weight function using the distance between nodes and the left energy of those nodes,then uses this function to calculate a minimum weight energy spanning tree through Dijkstra algorithm.In order to meet the requirements of delay constraint and energy balance,this method makes some local adjustment on the spanning tree along the path of minimum weight.Experiment shows that,it prolongs the average lifetime of network,achieves the objective of balancing the network energy consumption.

关 键 词：无线传感器网络 数据采集 DIJKSTRA算法 能耗均衡 

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