使用差异进化自适应精英蝶优化算法的土壤湿度无线传感器网络可靠的任务分配
Haitao Huang1, Min Tian1, Jie Zhou2
1College of mechanical and electrical engineering, Shihezi University, Shihezi 832000, China.
Mathematical biosciences and engineering : MBE
|September 7, 2023
概括
一个新的算法,DEAEBOA,增强了在精密农业中的土壤湿度无线传感器网络 (SMWSNs) 的任务分配. 这种优化通过克服计算和功率限制,显著提高了网络效益.
科学领域:
- 农业工程 农业工程
- 计算机科学 计算机科学
- 优化算法 优化算法
背景情况:
- 无线传感器技术的进步导致了土壤湿度无线传感器网络 (SMWSNs) 的发展,这对精密农业至关重要.
- 现有的SMWSN湿度节点在数据收集,存储和处理能力方面存在局限性.
- 有效的任务分配对于最大限度地发挥SMWSNs的网络效益至关重要,特别是考虑到它们固有的约束.
研究的目的:
- 解决SMWSNs中任务分配的NP-hard性质,特别是在有限的计算能力和能源的限制下.
- 引入一种新的优化算法,即差异进化自适应精英蝶优化算法 (DEAEBOA),以改进任务分配.
- 提高 SMWSNs 中任务分配的效率,准确性和融合速度.
主要方法:
- 开发了差异进化自适应精英蝶优化算法 (DEAEBOA).
- 整合了一个新的自适应运算符,以提高算法的准确性和性能.
- 整合一个新的精英运营商和差异性进化战略,以增强全球搜索能力,避免局部优化.
- 对蝶优化算法 (BOA),粒子群优化 (PSO),遗传算法 (GA) 和白优化 (BWO) 的比较模拟实验.
主要成果:
- DEAEBOA在SMWSNs的任务分配效率方面取得了显著的改善.
- 该算法有效地缓解了计划停滞和加速趋同.
- 与现有算法相比,DEAEBOA在网络效益率方面取得了显著的提高:比BOA增加11.86%,比PSO增加5.46%,比GA增加8.98%,比BWO增加12.18%.
结论:
- 拟议的DEAEBOA算法为SMWSNs中的任务分配提供了一个优质的解决方案.
- DEAEBOA有效地克服了SMWSN节点的计算和功率限制.
- 该算法提出了一个有希望的方法来提高精密农业系统的整体性能和效率.
相关概念视频
Distributed Loads: Problem Solving
668
Beams are structural elements commonly employed in engineering applications requiring different load-carrying capacities. The first step in analyzing a beam under a distributed load is to simplify the problem by dividing the load into smaller regions, which allows one to consider each region separately and calculate the magnitude of the equivalent resultant load acting on each portion of the beam. The magnitude of the equivalent resultant load for each region can be determined by calculating...
668
Maxwell-Boltzmann Distribution: Problem Solving
1.6K
Individual molecules in a gas move in random directions, but a gas containing numerous molecules has a predictable distribution of molecular speeds, which is known as the Maxwell-Boltzmann distribution, f(v).
This distribution function f(v) is defined by saying that the expected number N (v1,v2) of particles with speeds between v1 and v2 is given by
This distribution function f(v) is defined by saying that the expected number N (v1,v2) of particles with speeds between v1 and v2 is given by
1.6K


