基于遗传算法的移动adhoc网络路由攻击保护
Securing a mobile adhoc network from routing attacks through the application of genetic algorithm
摘要：
近年来，静态最短路径（SP）问题已经使用智能优化技术得到了很好的解决，例如，人工神经网络、遗传算法（GA）、粒子群优化等。然而，随着无线通信的发展，出现了越来越多的移动无线网络，例如，移动网络[移动自组织网络（MANET）]、无线传感器网络等。移动无线网络中最重要的特征之一是拓扑动态性，即，网络拓扑由于能量守恒或节点移动性而随时间改变。因此，移动自组网中的SP路由问题是一个动态优化问题。GA的是能够找到，如果不是最短的，至少在移动自组织网络节点的源和目的地之间的最佳路径。在链路失效或节点失效的情况下，通过获取替代路径或备份路径来避免重路由发现。
英文摘要：
In recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile networks [mobile ad hoc networks (MANETs)], wireless sensor networks, etc. One of the most important characteristics in mobile wireless networks is the topology dynamics, i.e., the network topology changes over time due to energy conservation or node mobility. Therefore, the SP routing problem in MANETs turns out to be a dynamic optimization problem. GA's are able to find, if not the shortest, at least an optimal path between source and destination in mobile ad-hoc network nodes. And we obtain the alternative path or backup path to avoid reroute discovery in the case of link failure or node failure.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
