...
首页> 外文期刊>IEEE Transactions on Vehicular Technology >A Hierarchical Energy-Efficient Framework for Data Aggregation in Wireless Sensor Networks
【24h】

A Hierarchical Energy-Efficient Framework for Data Aggregation in Wireless Sensor Networks

机译:无线传感器网络中用于数据聚合的分层节能框架

获取原文
获取原文并翻译 | 示例
           

摘要

A network of sensors can be used to obtain state-based data from the area in which they are deployed. To reduce costs, the data, sent via intermediate sensors to a sink, are often aggregated (or compressed). This compression is done by a subset of the sensors called "aggregators." Inasmuch as sensors are usually equipped with small and unreplenishable energy reserves, a critical issue is to strategically deploy an appropriate number of aggregators so as to minimize the amount of energy consumed by transporting and aggregating the data. In this paper, the authors first study single-level aggregation and propose an Energy-Efficient Protocol for Aggregator Selection (EPAS) protocol. Then, they generalize it to an aggregation hierarchy and extend EPAS to Hierarchical EPAS. The optimal number of aggregators with generalized compression and power-consumption models was derived, and fully distributed algorithms for aggregator selection were presented. Simulation results show that the algorithms significantly reduce the energy consumption for data collection in wireless sensor networks. Moreover, the algorithms do not rely on particular routing protocols and are thus applicable to a broad spectrum of application environments.
机译:传感器网络可用于从其部署区域获取基于状态的数据。为了降低成本,通常将通过中间传感器发送到接收器的数据进行汇总(或压缩)。这种压缩是通过称为“聚合器”的传感器子集完成的。由于传感器通常配备有少量且不可补充的能量储备,因此关键的问题是战略性地部署适当数量的聚合器,以最大程度地减少通过传输和聚合数据而消耗的能量。在本文中,作者首先研究了单级聚合,并提出了一种用于聚合器选择的节能协议(EPAS)协议。然后,他们将其概括为一个聚合层次结构,并将EPAS扩展为Hierarchical EPAS。推导了具有广义压缩和功耗模型的最优聚合器数量,并提出了用于聚合器选择的全分布式算法。仿真结果表明,该算法大大降低了无线传感器网络数据采集的能耗。而且,这些算法不依赖于特定的路由协议,因此适用于广泛的应用环境。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号