首页> 外文期刊>Theoretical computer science >Approximation algorithms for minimum latency data aggregation in wireless sensor networks with directional antenna
【24h】

Approximation algorithms for minimum latency data aggregation in wireless sensor networks with directional antenna

机译:具有定向天线的无线传感器网络中最小等待时间数据聚合的近似算法

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

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.
机译:实时数据聚合是无线传感器网络中最重要的问题之一。使用定向天线传输数据可以节省能量并减少干扰。在本文中,我们研究了在协议干扰模型下使用给定的两个定向天线模型(转向波束和切换波束)的最小等待时间数据聚合问题。我们提出一种近似定向数据聚合算法,分别调度两个定向天线模型下的数据传输。最后,通过仿真对所提出的调度算法进行了评估,仿真结果表明,所提出的调度算法的时延接近于BFS树的深度,即调度时延的下限,所提出的调度算法具有很好的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号