• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>ICA3PP 2014 >Energy Efficient Routing with a Tree-Based Particle Swarm Optimization Approach
【24h】

Energy Efficient Routing with a Tree-Based Particle Swarm Optimization Approach

机译：通过基于树的粒子群优化方法节能路由

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In contemporary, the energy waste caused by an un-optimized design of network consumed a large part of limited resource. Reduction of unnecessary energy consumption in wired networks has attracted the public's attention. To save energy without affecting performance, many existing studies classified the problem as Mixed Integer Linear Programming problem, which is NP-complete. Following this idea, we propose a novel energy efficient routing algorithm with tree-based particle swarm optimization (EERTPSO) to get a solution covering all the idle-period communication nodes and minimize the number of nodes or links, considering the constraints of bandwidth, delay and link cost, in order to awake the necessary nodes meanwhile get the idles to sleep. By the above sleep-awake mechanism, algorithm obtains an accepted result satisfied the quality of service requirement. Simulation and analytical results show that our algorithm performs efficiently and effectively.
机译：在当代，由未经网络的网络设计引起的能量浪费消耗了大部分有限资源。减少有线网络中不必要的能源消耗引起了公众的注意。为了节省能源而不影响性能，许多现有研究将问题分类为混合整数线性编程问题，这是NP-Tress。在此思想之后，我们提出了一种新颖的节能路由算法，具有基于树的粒子群优化（EERTPSO），以便考虑到带宽，延迟的约束，最小化节点或链接的数量并最大限度地减少节点或链路的数量。和链接成本，为了唤醒必要的节点，同时睡觉睡眠。通过上述睡眠唤醒机制，算法获得了接受的结果，满足了服务质量要求。仿真和分析结果表明，我们的算法有效且有效地执行。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号