Abstract
With the continuous development of artificial intelligence, the research and application of automated connected driving is receiving more and more attention. The combination of mobile edge computing and Telematics provides crucial technical support. In this paper, we propose a rasterization method for mobile edge computing scenario. We establish a grid classification model based on K-means to facilitate targeted and distributed optimization of computing resources. Meanwhile, we dynamically adjust the allocation of computational resources and the location of edge servers in advance deployment by predicting vehicle traffic. The experimental results demonstrate that the K-means-based grid classification model can accurately classify the grids and differentiate the traffic patterns of the grids, such as remote suburban areas, suburban areas, residential living areas, production industrial areas, and commercial center areas. The Backpropagation (BP) neural network-based grid traffic flow prediction model can simulate the overall changes of the grid traffic flow throughout a day to the maximum extent. Finally, we plan optimization scheme in urban mobile edge scenarios based on the results obtained from our analysis and prediction, and through our results, we can make edge computing resources be utilized efficiently.
Author supplied keywords
Cite
CITATION STYLE
Zhong, H., Cai, K., & Fan, J. (2024). Edge Computing-driven Smart Transportation: Analysis and Prediction of Urban Traffic Flow. In Journal of Physics: Conference Series (Vol. 2890). Institute of Physics. https://doi.org/10.1088/1742-6596/2890/1/012044
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.