...
首页> 外文期刊>IEEE transactions on industrial informatics >A Novel Shortcut Addition Algorithm With Particle Swarm for Multisink Internet of Things
【24h】

A Novel Shortcut Addition Algorithm With Particle Swarm for Multisink Internet of Things

机译:一种小巧的快捷方式添加算法,具有粒子群的用于多语入互联网

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

获取外文期刊封面封底 >>

       

摘要

The Internet of Things integrates a large number of distributed nodes to collect or transmit data. When the network scale increases, individuals use multiple sink nodes to construct the network. This increases the complexity of the network and leads to significant challenges in terms of the existing methods with respect to the aspect of data forwarding and collection. In order to address the issue, this paper proposes a Shortcut Addition strategy based on the Particle Swarm algorithm (SAPS) for multisink network. It constructs a network topology with multiple sinks based on a small-world network. In the SAPS, we create a fitness function by combining the average path length and load of the sink node, to evaluate the quality of a particle. Subsequently, crossover and mutation are used to update the particles to determine the optimal solution. The simulation results indicate that the SAPS is superior both to the greedy model with small world and the load-balanced multigateway aware long link addition strategy in terms of the average path length, load balance, and number of added shortcuts.
机译:Internet Internet Internet集成了大量分布式节点以收集或传输数据。当网络比例增加时,个人使用多个宿节点来构建网络。这增加了网络的复杂性,并在数据转发和收集方面的现有方法方面导致了重要挑战。为了解决问题,本文提出了一种基于粒子群算法(SAPS)的快捷方式添加策略,用于多语入网络网络。它构建了基于小世界网络的多个汇位的网络拓扑结构。在SAP中,我们通过组合水槽节点的平均路径长度和负载来创建健身功能,以评估粒子的质量。随后,使用交叉和突变来更新颗粒以确定最佳解决方案。仿真结果表明,在平均路径长度,负载平衡和添加的快捷方式的数量方面,SAPS的贪婪模型和负载平衡的多相草地途中的贪婪模型均优于贪婪模型。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号