首页> 外文期刊>IEEE systems journal >Distributed Data Gathering Algorithm Based on Spanning Tree
【24h】

Distributed Data Gathering Algorithm Based on Spanning Tree

机译:基于生成树的分布式数据收集算法

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

摘要

The energy consumption of the nodes is limited in wireless sensor networks (WSNs). Since the sink node takes up most of the data forwarding, the energy consumption is maximum and it is easily formed around the energy hole. The network lifetime is short; so how to improve the network effective node energy and prolong the network lifetime have become a hot issue in the application of WSNs. In this article, our aim is to construct an optimal spanning tree of maximum lifetime as a research object. We propose a kind of accurately distributed data gathering algorithm-based tree. Compared with the existing local minimum spanning tree (LMST) distributed algorithm and random routing algorithm, our proposed constructing method based on spanning tree can prolong the lifetime of WSNs.
机译:节点的能量消耗在无线传感器网络(WSN)中受到限制。由于水槽节点占据了大部分数据转发,因此能量消耗最大,并且围绕能量孔易于形成。网络生命周期很短;因此,如何改善网络有效节点能量,延长网络寿命已成为WSNS应用中的一个热门问题。在本文中,我们的目标是构建作为研究对象的最大寿命的最佳生成树。我们提出了一种准确分布的数据收集算法的树。与现有的局部最小生成树(LMST)分布式算法和随机路由算法相比,我们提出基于生成树的构建方法可以延长WSN的寿命。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号