Intelligent Traffic Data Transmission and Sharing Based on Optimal Gradient Adaptive Optimization Algorithm

Abstract

This work aims to improve the transmission and sharing efficiency of intelligent transportation data and promote the further development of intelligent transportation and smart city. In this work, an EEMR (Energy Efficient Multi-hop Routing) is designed for the intelligent transportation wireless sensor network. In the EEMR algorithm, the base station runs the IAP clustering algorithm for network clustering after receiving the information of all surviving nodes. A method called ACRR (Adaptive Cluster-head Round Robin) is proposed for local dynamic election of cluster heads. In addition, the deep learning-based stochastic gradient descent algorithm and its evolution algorithm are sorted out, and its application in practical scenarios is analyzed. Due to the disadvantages of the adaptive algorithm in the current data processing process, the gradient optimization algorithm based on deep learning is adopted and the concept of adaptive friction coefficient is applied to the Adam algorithm to obtain a new adaptive algorithm (TAdam). The simulation experiment reveals that the proportion of network surviving nodes of the EEMR algorithm is still as high as 90% in 1,500 rounds of data collection. This shows that the EEMR algorithm achieves the energy balance of the network nodes as much as possible while minimizing the system energy consumption. In application scenario 1, when the network surviving nodes of the four data collection algorithms compares dropped below 40%, the number of surviving nodes in the EEMR algorithm is still as high as 97.6%. On the PTB (Penn Tree Bank) test data set, the TAdam algorithm shows the fastest convergence speed and the best generalization performance. The TAdam algorithm based on deep learning discussed in this work was of great significance for improving the transmission and sharing efficiency of intelligent transportation data.