Analysis of multi-hop emergency message propagation in vehicular ad hoc networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Spatio-temporal variations of vehicle traffic in VANETs: facts and implications
Proceedings of the sixth ACM international workshop on VehiculAr InterNETworking
Network connectivity of VANETs in urban areas
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Critical sensor density for partial connectivity in large area wireless sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Asymptotic properties of multi-hop wireless networks
Asymptotic properties of multi-hop wireless networks
Challenges of intervehicle ad hoc networks
IEEE Transactions on Intelligent Transportation Systems
Routing in Sparse Vehicular Ad Hoc Wireless Networks
IEEE Journal on Selected Areas in Communications
On the instantaneous topology of a large-scale urban vehicular network: the cologne case
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Data dissemination for delay tolerant vehicular networks: using historical mobility patterns
Proceedings of the third ACM international symposium on Design and analysis of intelligent vehicular networks and applications
| Hi-index | 0.00 |
Vehicular ad-hoc networks (VANET) promise to enhance the road safety and travel comfort significantly in both highway and city scenarios. Message propagation, either for emergency or pleasure purposes, constitutes a major category of VANET applications, and is particularly challenging in infrastructure-less vehicle-to-vehicle communication scenarios. In this paper, we study the connectivity property of message propagation in two-dimensional VANET. We first derive the exact expression for the average size of the connected components in the one-dimensional case, i.e., messages propagating along a main street, and give a close approximation to the size distribution. We further derive the connectivity of message propagation in the two-dimensional ladder case, i.e., covering the main and two side streets, and formulate the problem for the two-dimensional lattice case to cover all the blocks in a district. Extensive simulation has been conducted to verify the analytical model and provide further insights in message propagation with and without geographic constraints, respectively. The simulation results show the efficacy of the model and the tradeoff between these two message forwarding strategies, and provide guidelines for future network planning and protocol development.