...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of supercomputing >A greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor network
【24h】

A greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor network

机译：永久无线充电无线传感器网络中最短路径的贪心构建树算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Energy recharging has received much attention now because of the development of wireless recharging technology. This paper proposes a greedy constructing tree algorithm for shortest path in perpetual wireless recharging wireless sensor networks (GCTA) which enables the recharger to work while moving through the shortest path. The algorithm can construct the shorter path which passes all the sensors only once and guarantees that each sensor will be fully recharged. It computes the path in advance with lower complexity. And it also uses the graph theory, the tree theory, the Markov chain theorem and the powerful computing function of a computer. The contributions of the paper are itemized as follows: guaranteeing all the sensors to be fully recharged only once and reducing the length of the recharging path through constructing the greedy tree. In the experiment, this algorithm can construct the shorter path. So it is novel, general and can be applied widely.
机译：由于无线充电技术的发展，能量充电现在受到了广泛的关注。针对永久性无线充电无线传感器网络（GCTA）中的最短路径，本文提出了一种贪婪的构造树算法，该算法可使充电器在经过最短路径的同时工作。该算法可以构建较短的路径，该路径仅使所有传感器通过一次，并确保每个传感器都将充满电。它以较低的复杂度预先计算路径。它还使用图论，树论，马尔可夫链定理和计算机强大的计算功能。本文的贡献如下：保证所有传感器仅被完全充电一次，并通过构造贪婪树来减少充电路径的长度。在实验中，该算法可以构造较短的路径。因此它是新颖的，通用的并且可以被广泛应用。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号