Efficient segment-based video transcoding proxy for mobile multimedia services
Journal of Systems Architecture: the EUROMICRO Journal
Data aggregation and roadside unit placement for a vanet traffic information system
Proceedings of the fifth ACM international workshop on VehiculAr Inter-NETworking
Roadcast: a popularity aware content sharing scheme in VANETs
ACM SIGMOBILE Mobile Computing and Communications Review
Maximizing the contact opportunity for vehicular internet access
INFOCOM'10 Proceedings of the 29th conference on Information communications
A roadside unit placement scheme for vehicular telematics networks
AST/UCMA/ISA/ACN'10 Proceedings of the 2010 international conference on Advances in computer science and information technology
Vehicular networks and the future of the mobile internet
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improving RSU service time by Distributed Sorting Mechanism
Ad Hoc Networks
An IP passing protocol for vehicular ad hoc networks with network fragmentation
Computers & Mathematics with Applications
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Optimal roadside units placement in urban areas for vehicular networks
ISCC '12 Proceedings of the 2012 IEEE Symposium on Computers and Communications (ISCC)
Perceptual control architecture for cyber-physical systems in traffic incident management
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
Vehicular Ad hoc Networks (VANETs) have been recently introduced to provide high-speed Internet access to vehicles by deploying 802.11 enhanced Roadside Units (RSUs) along roads. However, few file downloading oriented RSU deployment strategies have been proposed. In this paper, we propose a new RSU deployment strategy for file downloading in VANETs. The encounters between vehicles and RSUs are modeled as a time continuous homogeneous Markov chain. The optimal inter-meeting time between vehicles and RSUs is analyzed based on the encounter model. Then, the road network is modeled as a weighted undirected graph, and a RSU deployment algorithm is designed based on the depth-first traversal algorithm for edges of a graph. Simulation results show that the proposed RSU deployment algorithm can satisfy the file downloading service requirements with the lowest RSU deployment cost.