Abstract

AbstractDynamic vehicle detection requires the transmission of large amounts of data collected by different types of sensors to the edge computing nodes. This is likely to cause network delays and congestion, affecting the computation of the edge computing nodes and thus posing serious security risks. Therefore, optimizing data transmission between vehicles and edge computing nodes is a new challenge to be addressed in the practical application of edge computing‐based vehicle dynamic detection architectures. The data requirements of VDT for vehicle detection dynamic detection in different environments are considered, the optimization objectives and constraints are analysed, and a deviation detection and greedy algorithm is proposed in this paper to address the problems of long mixed‐integer linear programme solution time and insufficient practical applications, and the performance of the algorithm is evaluated through simulation experiments conducted by simulation of urban mobility, a traffic flow simulation tool, and PreScan, a vehicle simulation test software. The results show that compared with the deviation detection algorithm, the greedy algorithm can reduce the communication overhead by 82.6%–86.2% in all cases and improve the performance by 13.6%–19.5%, which is more suitable for practical applications. The results of this paper contribute to the automation and modernization of vehicle technology management and information transfer.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call