• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>WSEAS Transactions on Mathematics >Total dominating set based algorithm for connected dominating set in Ad hoc wireless networks
【24h】

Total dominating set based algorithm for connected dominating set in Ad hoc wireless networks

机译：Ad hoc无线网络中用于连接支配集的基于总支配集的算法

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

摘要

In an efficient design of routing protocols in ad hoc wireless networks, the connected dominating set (CDS) is widely used as a virtual backbone. To construct the CDS with its size as minimum, many heuristic, meta-heuristic, greedy, approximation and distributed algorithmic approaches have been proposed in the recent years. These approaches mostly concentrated on deriving independent set and then constructing the CDS using Steiner tree and also these algorithms perform well only for the graphs having smaller number of nodes and also for the networks that are generated in an one fixed 2D simulation area. This paper provides a novel approach for constructing the CDS, based on the concept of total dominating set and bipartite theory of graphs. Since the total dominating set is the best lower bound for the CDS, the proposed approach reduces the computational complexity to construct the CDS through the number of iterations. Moreover the conducted simulation reveals that the proposed approach finds better solution than the recently developed approaches when all the three important factors of ad hoc network such as number of nodes, transmission radio range and area of network density varies.
机译：在ad hoc无线网络中路由协议的有效设计中，连接的控制集（CDS）被广泛用作虚拟骨干网。为了构造具有最小尺寸的CDS，近年来已经提出了许多启发式，元启发式，贪婪，近似和分布式算法方法。这些方法主要集中在推导独立集，然后使用Steiner树构造CDS，而且这些算法仅对具有较少节点数的图以及在一个固定2D仿真区域中生成的网络表现良好。本文基于图的总支配集和二部论的概念，为构建CDS提供了一种新颖的方法。由于总支配集是CDS的最佳下限，因此所提出的方法通过迭代次数降低了构建CDS的计算复杂性。此外，进行的仿真表明，当ad hoc网络的所有三个重要因素（例如节点数，传输无线电范围和网络密度区域）都发生变化时，该方法比最近开发的方法找到了更好的解决方案。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号