Research On Security Technology Of Vehicular Opportunistic Network

Urban traffic problem has been an important issue of global concern. Dynamic routing is one of the means to solve this problem, in which the vehicles take advantage of the local electronic maps and road messages collected from vehicular opportunistic network to dynamically adjust routes to avoid congested roads. General application focused on effectively forwarding road messages to achieve better travel time, and ignored the validity and authenticity of road messages. It gives malicious nodes chance to tamper and forgery road messages, so the introduction of trust evaluation to improve the robustness of the general dynamic routing applications is important.Most vehicular opportunistic networking dynamic routing applications use road messages to route, so it is easy to directly use data trust of road message to determine the validity. However, the entity trust mode will determine the entity’s validity first, and then judge the validity of message itself. Data trust doesn’t need introduce too much additional information exchange and reduce the communication overhead between the vehicles.In addition, the road message contains the vehicle’s current position, direction, speed, surrounding traffic environment and other contents. If these messages are sniffed by attack vehicles, it will expose the vehicle owner’s route and habits from this sensitive information. To solve privacy problems, the vehicle pseudonym and privacy mechanisms should be introduced to vehicular opportunistic network. But the introduction of privacy mechanism may give the attacker more attack chances in other ways. How to solve these problems needs additional consideration.This paper will focus on dynamic routing application in intelligent transportation. It presents data trust evaluation model and vehicular pseudonym hierarchical architecture to solve security and privacy issues. Algorithms will be verified through simulation, proved to be with a good accuracy rate and appropriate overhead.