无线传感网中延迟受限的生命周期最大的数据收集算法

无融合数据收集是无线传感网络中最重要的技术之一.在持续实时的监测应用中,网络生命周期和网络传输延迟是衡量数据收集性能的两个重要指标,已有的研究大多侧重于某单一性能指标,而较少关注多性能的折衷优化.因此,本文研究了如何构造一棵延迟受限的生命周期最大的数据收集树,并将该构造问题形式化为一个整数规划问题,提出了有效的数据收集算法-EDG.该算法首先利用MITT方法构造生命周期近似最优的数据收集树,然后对“瓶颈节点”进行路径调整以使其满足延迟约束.仿真结果表明,与无延迟约束的MITT算法相比,EDG算法能在保证网络传输延迟的前提下,使其网络生命周期在大多数情况下达到MITT的90％以上.

Efficient Algorithm for Delay-constraint and Maximum-lifetime Data Gathering in Wireless Sensor Networks

Data gathering without aggregation is one of the most important operations in wireless sensor networks.In the continuous and real-time monitoring applications,network lifetime and transmission delay are two important performance metrics of data gathering.In this paper,the problem of constructing a maximum lifetime data gathering tree under delay constraint is investigated,and it is formalized into an integer programming problem,and then an efficient data gathering algorithm-EDG is proposed.The algorithm first constructs a data gathering tree whose lifetime is approximate optimal using MITT algorithm and then adjusts the paths for the bottleneck nodes to meet the delay constraint.The simulation results show that compared with MITT algorithm with no delay constraint,the lifetime of EDG algorithm can achieve over 90% of MITT′s in most cases on the premise of guaranteeing the network transmission delay.