Routing Algorithm of Concentric Excursions for ITS Communication

• Main Authors: Luo Jianfeng, Chen Yuqiang
• Format: Article
• Language: English
• Published: EDP Sciences 2016-01-01
• Series: MATEC Web of Conferences
• Subjects: Cumulative Conditions Queue; multi-limits Routing Algorithm; Concentric Excursions; value-Saving Transmission Queue; Shortest Path
• Online Access: http://dx.doi.org/10.1051/matecconf/20166304038

In the modern society, intelligent transportation builds on the basic of real-time wireless communication with vast information. Only by adding and upgrading the high-costed equipment to keep the speed of communication with the development of the transportation is far from enough [1]. Thus, to make full use of the present equipment to achieve higher speed of information transmission is a practical and challenging project. The Routing Algorithm of this paper is taking the Traffic Management Center as the center. Starting from the center and covering all the traffic management station, we can get the best path program under multi-limits with the help of the combination Algorithm of Shortest Path Algorithms and Concentric Excursions. A lot of constraints has been taken into consideration so as to make the result preciser. The result of multiple experiments has testified the feasibility and efficiency of the algorithm even under the great information content.