Internet of Things and intelligent transportation system

As the core of the new monitoring system, the Internet of Things realizes the integration of wireless sensor networks and traditional communication networks, and provides a platform for remote management and monitoring of the underlying equipment. The intelligent transportation system framework built on this basis combines intelligent transportation technology and the organic combination of vehicle management technologies is conducive to the safety, speed and reliability of vehicle transportation, and plays an important role in further reducing transportation costs. Based on this, this article launched the research on the Internet of Things and intelligent transportation systems. This article first summarizes the concepts of the Internet of Things, intelligent transportation and wireless sensor network technology and the current research status at home and abroad. By analyzing and comparing the performance and characteristics of various communication methods, embedded core microprocessors and embedded operating systems, this paper proposes an overall design scheme of the Internet of Things transportation system based on embedded technology. This paper analyzes the path planning problems in the application of the transportation system, combining the shortest path algorithm simulation results and the actual characteristics of the transportation network, and proposes a simulation data fitting method based on two network parameters and Bellman-Ford, Dijkstra, and Floyd algorithms. The route optimization scheme, and the above-mentioned design scheme was implemented in the transportation system, and the scheme verification was carried out. Finally, this article describes in detail the overall debugging process and operating results of the transportation system, thereby fully verifying the feasibility and correctness of the design and implementation methods of the intelligent transportation system based on the Internet of Things. The research results show that when the INF-PROPORTION is small, the Dijkstra algorithm is better than the Bellman-Ford algorithm. When INF-PROPORTION=0.3, the two algorithms T overlap. Since then, the advantages of the Bellman-Ford algorithm gradually appear, but it is approaching in INF-PROPORTION. At 1 o'clock, the Dijkstra algorithm has a sharp decrease, which is again smaller than the Bellman-Ford algorithm. The second loop condition in the main loop of Dijkstra's algorithm cannot be satisfied, resulting in a decrease in T.