离散萤火虫算法在车载网的应用

Application of Discrete Firefly Algorithms in Vehicle-borne Networks

关键词:  车载自组织网  萤火虫算法  服务质量  多播路由  网络拓扑

Key words:  vehicular ad hoc network  discrete firefly algorithm  quality of service  multicast routing  network topology

摘要:

车载自组织网（Vehicular ad hoc network，VANET）是移动自组织网络之一，具有节点变动迅速、拓扑结构灵活、通信能力要求较高的特点。为提高车载自组织网络的可靠性，实现数据的安全共享和快速交互，将离散萤火虫（DFA）算法应用求解车载网络中具有服务质量约束的多播路由问题。根据VANET的路由特点，将该问题转化为延迟成本最小化约束优化问题，并将车载网络路径时延转化为萤火虫的荧光素值，然后将该算法用4个实例进行测试，并与Dijkstra最短路径算法、粒子群优化算法进行比较。研究结果表明：离散萤火虫算法性能更佳，可有效解决VANET中Steiner minimum tree（SMT）问题，成功取得最优路径。该算法在一定程度上稳定了网络拓扑结构，能够实时更新节点信息。

Abstract:

Vehicular ad hoc network (VANET) is one of the mobile ad hoc networks with the characteristics of rapid change of nodes, flexible topology and high communication capability. In order to improve the reliability of vehicular ad hoc network and realize safe data sharing and fast interaction, the discrete firefly (DFA) algorithm is applied to solve the multicast routing problem with quality of service constraints in the vehicle network. According to the routing characteristics of VANET, the problem is transformed into a constrained optimization problem with minimum delay cost, and the path delay of vehicular networks is transformed into the fluorescein value of firefly. The algorithm is then tested with four examples and compared with Dijkstra's shortest path algorithm and particle swarm optimization algorithm. The experimental results show that the discrete firefly algorithm has better performance and can effectively solve the SMT (Steiner minimum tree) problem in VANET and successfully obtain the optimal path. The algorithm stabilizes the network topology to a certain extent and can update node information in real time.