Algorithm Research On Data Delivery In The Intersection Based On Vehicle Sensor Network

Vehicular sensors capture a large amount of data, and the type of data is abundant. These sensors have different type of data according to their function. With the development of sensor technology and the decrease of the cost of the storage, the data generate by the sensor of vehicular is no longer limited to text files. The number of image, audio and video has also greatly increased. These chunks of data are also hoped to be delivered in the Vehicular Sensor Network(VSN). So, a routing algorithm is needed to effectively propagate the data in Vehicular Sensor Network(VSN). There are many routing algorithms in Vehicular Ad-hoc NETwork(VANET) can be transplanted to VSN, however, all the routing algorithms didn’t consider the delivery of large amount of data, they assume that the data can be completely delivered as long as the destination vehicle or infrastructure is in the communication range of deliverer. In fact, due to the high mobility of vehicles, the delivery time of Vehicle to Vehicle(V2V) or Vehicle to Infrastructure(V2I) is very short especially when a deliverer is at a corner or crossroad and try to deliver data to its left/right direction, because the buildings and trees by the road side will block the communication signal going to the left/right, the only chance of data delivery at corner is the time the deliverer driving across the corner. Using existing routing algorithms in VANET will cause the big amount of data stuck at corners or crossroads and be transmitted back and forth with very a few data packets been delivered. It is very time consuming and computation consuming. In this paper, we propose a data delivery algorithm to handle the mentioned corner problem with the help of some vehicular sensors like accelerometer, GPS. Evaluations show that the time cost of data delivery at corners is saved for at least 30% by our algorithm comparing to other routing algorithms like VADD in VANET. Considering in the spare traffic environment, the known routing algorithms can deliver the large amount of data successfully is the average travel time of the vehicular. we propose the theory of parking vehicular assistance. The method is suitable for very urgent large amounts of data to be delivered at the intersection. Also, it can ensure data transmission in the sparse traffic environment.