The height of a random binary search tree
Journal of the ACM (JACM)
Fair sharing of bandwidth in VANETs
Proceedings of the 2nd ACM international workshop on Vehicular ad hoc networks
Efficient secure aggregation in VANETs
Proceedings of the 3rd international workshop on Vehicular ad hoc networks
Route lifetime based optimal hop selection in VANETs on highway: an analytical viewpoint
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Cluster-Based framework in vehicular ad-hoc networks
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
Information dissemination in self-organizing intervehicle networks
IEEE Transactions on Intelligent Transportation Systems
A Position-Based Clustering Technique for Ad Hoc Intervehicle Communication
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Secure vehicular communication systems: design and architecture
IEEE Communications Magazine
Advances on Network Protocols and Algorithms for Vehicular Ad Hoc Networks
Mobile Networks and Applications
| Hi-index | 0.00 |
A key component for safety applications in Vehicular ad-hoc network (VANET) is the use of periodic beacon messages which provide vehicles with a real-time vehicle proximity map of their surroundings. Based on this map, safety applications can be used for accident prevention by informing drivers about evolving hazardous situations. In order to allow synchronized and cooperative reactions, the target of this work is to design a beacon dissemination process that provides a real-time, broad and coordinated map under the challenging VANET conditions. In order to obtain the desired map, we consider an aggregation-dissemination based scheme for a beacon dissemination process that based on top of a cluster-based topology. To this end, we propose the Distributed Construct Underlying Topology (D-CUT) algorithm tailed specifically to provide an optimized topology for such beacon dissemination process. To deal with the heavy load of beacon messages required for an accurate and broad map, we propose a topology that allows the execution of extensive but reliable spatial bandwidth reuse. Our D-CUT algorithm exploits the real-time and coordinated map for constructing an adaptive and robust topology to deal with the dynamic nature of the VANET environment. We present theoretically provable bounds demonstrating the ability of the algorithm to deal with the dynamic nature of the VANET environment supported by simulation results.