首页> 外文会议>IEEE Advanced Information Technology, Electronic and Automation Control Conference >A Multi-Dominating-Subtree-based Minimum Connected Dominating Set Construction Algorithm
【24h】

A Multi-Dominating-Subtree-based Minimum Connected Dominating Set Construction Algorithm

机译:基于多支配子树的最小连通支配集构造算法

获取原文

摘要

Different from the traditional wireless communication network, wireless sensor networks(WSNs) have no infrastructure similar to the cellular network, and nodes can only communicate in the way of "flooding", which is easy to cause the problem of broadcast storm. The energy of wireless sensor nodes is actually very limited, which seriously affects the lifecycle of the whole network. Therefore, the research direction of constructing virtual backbone network in WSN arises at the right moment. In this paper, a minimum connected dominating set(CDS) construction algorithm based on multiple dominating tree is proposed. The algorithm firstly takes the node at the core position in each local area of the network as the root node, and constructs several dominating subtrees in the network. Then, some connector is selected to connect the two subtrees that are not connected to each other. Finally, the redundant dominator is cut off to obtain the final virtual backbone.
机译:与传统的无线通信网络不同,无线传感器网络(WSNs)没有类似于蜂窝网络的基础架构,并且节点只能以“泛洪”方式进行通信,这很容易引起广播风暴的问题。无线传感器节点的能量实际上非常有限,这严重影响了整个网络的生命周期。因此,在适当的时机提出了在无线传感器网络中构建虚拟骨干网的研究方向。提出了一种基于多重支配树的最小连通支配集(CDS)构造算法。该算法首先将网络每个局部区域中核心位置的节点作为根节点,并在网络中构造几个主导子树。然后,选择某个连接器来连接两个彼此不连接的子树。最后,切断冗余支配器以获得最终的虚拟主干。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号