Binary particle swarm optimization routing using spanning tree in Vehicular Ad hoc Network
سال انتشار: 1396
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 467
فایل این مقاله در 13 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
COMCONF05_772
تاریخ نمایه سازی: 21 اردیبهشت 1397
چکیده مقاله:
Strong routs in which all nodes are connected to each other are required to perform a reliable and efficient routing in Vanet. Classical algorithms in graphic theory can only find one optimal spanning tree in Vanet. Swarm intelligence examples are capable of achieving several alternatives for the minimum spanning tree, which is helpful in improving the reliability of Vanet. To cope with the problem of building a spanning tree, this paper proposes a particle swarm optimization algorithm encoded with a binary system. The proposed algorithm is used for coping with the roadside communications with the vehicle.The success rate and the average runtime of this algorithm to find the minimum spanning tree are analyzed by MATLAB simulator. We realize that the binary particle swarm optimization algorithm is very likely to find the minimum spanning tree. Although in terms of the computational time, this algorithm performs slower than Kruskal algorithm, the binary particle swarm optimization algorithm can achieve multiple optimal spanning trees at once. This indicates that this algorithm will be useful in situations where without changing the network topology, the routes of the tree must be continuously rebuilt in a short period. In this paper, we could enhance the Delivery Ratio, Available ST, Computational Time, and Average Computational Time.
کلیدواژه ها:
VANET (Vehicular ad hoc network) ، Minimum Spanning Tree ، Particle Swarm Optimization Algorithm ، Binary Optimization Algorithm
نویسندگان
Samaneh ghelichkhani
Department of computer Engineering, Pardis Branch, Islamic Azad University, Pardis, Iran
Solmaz gheysari
Department of computer Engineering, Pardis Branch, Islamic Azad University, Pardis, Iran