Suppr超能文献

一种适用于自组网中多约束组播路由的演化算法。

A memetic optimization algorithm for multi-constrained multicast routing in ad hoc networks.

机构信息

Department of Basic and Applied Sciences, Arab Academy for Science, Technology and Maritime Transport, Cairo, Egypt.

Department of Electronics and Communications, Arab Academy for Science, Technology and Maritime Transport, Cairo, Egypt.

出版信息

PLoS One. 2018 Mar 6;13(3):e0193142. doi: 10.1371/journal.pone.0193142. eCollection 2018.

Abstract

A mobile ad hoc network is a conventional self-configuring network where the routing optimization problem-subject to various Quality-of-Service (QoS) constraints-represents a major challenge. Unlike previously proposed solutions, in this paper, we propose a memetic algorithm (MA) employing an adaptive mutation parameter, to solve the multicast routing problem with higher search ability and computational efficiency. The proposed algorithm utilizes an updated scheme, based on statistical analysis, to estimate the best values for all MA parameters and enhance MA performance. The numerical results show that the proposed MA improved the delay and jitter of the network, while reducing computational complexity as compared to existing algorithms.

摘要

移动自组网是一种常规的自配置网络,其中路由优化问题(受到各种服务质量(QoS)约束的限制)是一个主要挑战。与以前提出的解决方案不同,在本文中,我们提出了一种使用自适应变异参数的遗传算法(MA),以解决具有更高搜索能力和计算效率的组播路由问题。所提出的算法利用基于统计分析的更新方案来估计所有 MA 参数的最佳值,并提高 MA 的性能。数值结果表明,与现有算法相比,所提出的 MA 改善了网络的延迟和抖动,同时降低了计算复杂度。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f4df/5839550/4b15b1fc342c/pone.0193142.g001.jpg

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验