首页> 外文会议>2012 international conference on computer and communication engineering >A distributed algorithm for constructing minimum connected dominating set in mobile wireless network
【24h】

A distributed algorithm for constructing minimum connected dominating set in mobile wireless network

机译:一种在移动无线网络中构造最小连通支配集的分布式算法

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we propose an Artificial Bee Colony (ABC) algorithm, a swarm-based artificial intelligence algorithm, for computing a connected dominating set (CDS) in ad hoc wireless networks, which include mobile ad hoc networks (MANETS). ABC Algorithm is an optimization algorithm based on the intelligent behavior of honey bee swarm. Wireless ad hoc networks appear in a wide variety of applications, including mobile wireless networks. In this work ABC algorithm is proposed as optimizing heuristic algorithm for the connected dominating set problem in dynamic environment. This approach guarantees properties of correctness, progressiveness, locality, and seamlessness, and also has better throughput than cyclic iterative local solution (CILS) and seamless iterative local solution (SILS). Extensive simulations are conducted to evaluate the effectiveness of the proposed approach in both static and dynamic environments.
机译:在本文中,我们提出了一种人工蜂群算法(ABC),这是一种基于群体的人工智能算法,用于计算ad hoc无线网络(包括移动ad hoc网络(MANETS))中的连接控制集(CDS)。 ABC算法是一种基于蜜蜂群智能行为的优化算法。无线自组织网络出现在各种各样的应用中,包括移动无线网络。在这项工作中,提出了ABC算法作为动态环境中连通支配集问题的优化启发式算法。这种方法保证了正确性,渐进性,局部性和无缝性的特性,并且比循环迭代局部解(CILS)和无缝迭代局部解(SILS)具有更好的吞吐量。进行了广泛的仿真,以评估该方法在静态和动态环境中的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号