首页> 外文会议>International Conference on Wireless Algorithms, Systems and Applications >An Approximation Algorithm for Data Storage Placement in Sensor Networks
【24h】

An Approximation Algorithm for Data Storage Placement in Sensor Networks

机译:传感器网络中数据存储放置的近似算法

获取原文

摘要

Data storage has become an important issue in sensor networks as a large amount of collected data needs to be archived for future information retrieval. This paper proposes to introduce storage nodes that can store data collected from the sensors in their proximities. The storage nodes alleviate the heavy load of transmitting all the data to a central place for archiving and reduce the communication cost induced by the network query. This paper considers the storage node placement problem to minimize the total power consumption for data funneling to the storage nodes and data query. We formulate it as an integer linear programming problem and present an approximation algorithm based on a rounding technique. Our simulation shows that our approximation algorithm performs well in practice.
机译:数据存储已成为传感器网络中的重要问题,因为需要存档大量收集的数据以供将来的信息检索。本文提出引入存储节点,可以存储从传感器中收集的数据。存储节点可缓解将所有数据传输到中央处的繁重负载,以进行存档,并降低网络查询引起的通信成本。本文考虑了存储节点放置问题,以最小化数据漏斗到存储节点和数据查询的总功耗。我们将其作为整数线性编程问题,并呈现基于舍进技术的近似算法。我们的仿真表明,我们的近似算法在实践中表现良好。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号