Approximation algorithms for minimum latency data aggregation in wireless sensor networks with directional antenna
Approximation algorithms for minimum latency data aggregation in wireless sensor networks with directional antenna
复制标题
具有定向天线的无线传感器网络中最小延迟数据聚合的近似算法
DOI：
10.1016/j.tcs.2011.12.012
复制
发表时间：
2013-07-29
影响因子：
1.1
通讯作者：
Du, Hongwei
中科院分区：
文献类型：
--
作者：
Liu, Hui;Liu, Zewen;Du, Hongwei
实时数据融合是无线传感器网络中最重要的问题之一。利用定向天线进行数据传输可以节省能量，减少干扰。本文研究了在协议干扰模型下，给定两种定向天线模型（导向波束和切换波束）的最小延迟数据聚合问题。我们提出了一种近似的定向数据聚合算法，分别在两种定向天线模型下调度数据传输。最后，我们通过仿真对所提出的调度算法进行了评估，仿真结果表明，所提出的调度算法的延迟接近BFS树的深度，这是调度延迟的下限，所提出的调度算法取得了非常好的性能。(C)2011爱思唯尔有限公司版权所有。
Real-time data aggregation is one of the most important issues in wireless sensor networks. Using directional antenna to transmit data can save energy and reduce interference. In this paper, we study the minimum latency data aggregation problem with the given two directional antenna models (the steering beam and the switch beam) under protocol interference model. We propose an approximation directional data aggregation algorithm to schedule data transmissions under two directional antenna models, respectively. At last, we evaluate the proposed schedule algorithms through simulations, and simulation results show that the proposed schedule's latency is close to the depth of BFS tree, which is the lower bound of schedule latency, and the proposed schedules achieve extremely good performance. (C) 2011 Elsevier B.V. All rights reserved.