• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International conference on wireless and optical commuications >S-TSP: A Novel Routing Algorithm for In-network Processing of Recursive Computation in Wireless Sensor Networks
【24h】

S-TSP: A Novel Routing Algorithm for In-network Processing of Recursive Computation in Wireless Sensor Networks

机译：S-TSP：无线传感器网络中递归计算的网络内处理的新型路由算法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In-network processing is an efficient way to reduce the transmission cost in wireless sensor networks (WSNs). The in-network processing of many domain-specific computation tasks in WSNs usually requires to losslessly distribute the computation of the tasks into the sensor nodes, which is however usually not easy. In this paper we are concerned with such kind of tasks whose computation can only be partitioned into recursive computation mode. To distribute the recursive computations into WSNs, it is required to design an appropriate single in-network processing path, along which the intermediate data is forwarded and updated in the WSNs. We address the recursive computation with constant size of computation result, e.g., distributed least square estimation (D-LSE). Finding the optimal in-network processing path to minimize the total transmission cost in WSNs, is a new problem and seldom studied before. To solve it, we propose a novel routing algorithm called as S-TSP, and compare it with some other greedy algorithms. Extensive simulations are conducted, and the results show the good performance of the proposed S-TSP algorithm.
机译：网络内处理是减少无线传感器网络（WSN）中的传输成本的有效方法。 WSN中的许多特定于域的计算任务的网络内处理通常需要无损地将任务的计算分发给传感器节点，但是通常不容易。在本文中，我们涉及这种类型的任务，其计算只能被划分为递归计算模式。为了将递归计算分发到WSN中，需要设计适当的单个网络内处理路径，中间数据被转发并更新在WSN中。我们以恒定的计算结果大小地解决了递归计算，例如，分布式最小二乘估计（D-LSE）。找到最佳的网络内处理路径以最大限度地减少WSN中的总传输成本，是一个新的问题，并且很少研究。要解决它，我们提出了一种称为S-TSP的新型路由算法，并将其与其他一些贪婪算法进行比较。进行广泛的模拟，结果表明了所提出的S-TSP算法的良好性能。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号