首页> 外文会议>International Conference on Advances in Computing, Communications and Informatics >A study on energy issues in construction of all-to-all minimum power broadcast (A2A MPB) trees in wireless networks
【24h】

A study on energy issues in construction of all-to-all minimum power broadcast (A2A MPB) trees in wireless networks

机译:无线网络中全面最小功率广播(A2A MPB)树建设中的能源问题研究

获取原文

摘要

Broadcasting in wireless networks has gained tremendous importance in recent years with its spatial aspects, since multiple nodes can be communicated by a single transmission. All-to-all broadcast is a communication where in every node has to broadcast to all other nodes in the network. In this paper, we have investigated minimum unicast tree (MUCT) for computing minimum total power for all-to-all broadcast, with known algorithms r-shrink and Kruskal's and compared the results with standard data set. We have also shown through experimental results that r-shrink which is a simple and widely used local search algorithm for minimum energy broadcast (MEB) and minimum energy multicast (MEM) does not perform well compared to Kruskal's algorithm in minimizing the total all-to-all power for broadcasting in wireless networks.
机译:近年来,无线网络中的广播在其空间方面获得了巨大的重要性,因为可以通过单个传输传送多个节点。 全面广播是一个通信,每个节点都必须广播到网络中的所有其他节点。 在本文中,我们已经调查了最小单播树(Muct)来计算全部广播的最小总功率,并通过已知的算法R-SCRINK和Kruskal进行了比较了标准数据集的结果。 我们还通过实验结果表明,与最小能量广播(MEB)和最小能量多播(MEM)的局部搜索算法是一种简单且广泛使用的本地搜索算法,与Kruskal的算法相比,与Kruskal的算法最小化全部全部相比, - 在无线网络中广播的所有权。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号