首页> 外文会议>Third International Symposium on Parallel Architectures, Algorithms and Programming >One-Hop Neighbor Transmission Coverage Information Based Distributed Algorithm for Connected Dominating Set
【24h】

One-Hop Neighbor Transmission Coverage Information Based Distributed Algorithm for Connected Dominating Set

机译:基于单跳邻居传输覆盖信息的连接控制集分布式算法

获取原文
获取外文期刊封面目录资料

摘要

Broadcast is very important for delivering messages in wireless sensor networks. In order to improve the efficiency of broadcast and re¬duce energy consumption, it is necessary to con¬struct a virtual backbone within the entire net¬work. Constructing a virtual backbone is identi¬cal with calculating connected dominating set. 1-hop neighbor node transmission coverage infor¬mation is used to calculate the minimum forwarding set distributively on each node of the network, and then the method of broadcasting information of minimal forwarding set is used to construct a connected dominating set. 1-hop neighbor transmission coverage information based distributed algorithm for connected domi¬nating set is designed to get a small connected dominating set, while minimizing the cost of en¬ergy and time in the implementation of the algo¬rithm. The simulation results show that the algo¬rithm has achieved its purpose, fast convergence, low transmission traffic and reasonable con¬nected dominating set.
机译:广播对于在无线传感器网络中传递消息非常重要。为了提高广播效率并减少能耗,有必要在整个网络中构建虚拟骨干网。构造虚拟主干与计算连接的支配集是相同的。使用一跳邻居节点传输覆盖率信息来计算网络上每个节点上的最小转发集,然后使用广播最小转发集信息的方法来构建连接的主导集。设计用于连接支配集的基于1跳邻居传输覆盖信息的分布式算法,以获取较小的连接支配集,同时在算法的实现中将能量成本和时间最小化。仿真结果表明,该算法达到了目的,收敛速度快,传输流量低,连接集合理。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号