There are problems of low delivery radio and high transmission delay in Vehicular Delay-Tolerant Networks (a.b. VDTN. To address these problems, this paper proposes a Vehicular Delay-tolerant Network routing algorithm based on Contention (a.b. VDNC). VDTN algorithm consists of three strategies: the intersection selection strategy based on the Manhattan distance and traffic information, the first competitive strategy based on the direction of movement and the second competitive strategy based on the position information. Moreover, traffic light also plays an important role to ease traffic congestion and reduce transmission delay. So an Adaptive Traffic-light Control algorithm based on Green-Computing (a.b. ATCG) is proposed. ATCG algorithm involves the following two parts: the calculation of the optimal sequence and that of the recommended speed. Simulation results show that compared to other traditional DTN (Delay-Tolerant Networks) protocols, VDNC algorithm has a higher delivery rate and lower transmission delay. And meanwhile, ATCG algorithm enables vehicles pass through the intersection with fewer stoppages and shorter waiting time. At the same time, the carbon dioxide emission is also able to achieve a minimum for the purpose of environmental protection. Consequently, the collaboration between VDNC and ATCG can further improve the traffic efficiency in VDTN. Index Terms-Delay tolerant network, intelligent traffic light control, green computing, routing algorithm, vehicular networks, wireless sensor network I. INTRODUCTION Due to the disadvantages of current vehicular traffic such as the curing time of traffic light, the behindhand traffic control method, vehicle signal disconnection between vehicles and vehicles as well as vehicles and base-stations and, serious urban vehicle congestion, researchers pay more attention to Intelligent

Within vehicular delay-tolerant network, conflict exists in the scenario of which two vehicles happen to choose the same parking space. To solve this problem, two protocols are proposed, respectively, which are called privacy protection protocol based on secure multiparty computation and routing protocol based on angle and density. The proposed methods prevent the leaking of privacy information of the vehicles involved during the parking space seeking process and improve the performance of the transmission ratio and reduce the transmission delay by unifying the directions of messages and choosing the vehicle of the highest distribution density as the next hop. The results of the simulation show the efficiency of our method.

No abstract