The pervasive use of technology in the urban environment requires evolved algorithms able to deliver messages across vehicular ad-hoc networks (VANETs). These networks could be exploited to run a vast plethora of applications, including critical ones such as emergency message distribution. The state-of-the-art broadcasting solutions are based on providing vehicles with different probabilities of forwarding the message in order to reduce message collisions and the number of hops to cover a certain area of interest. In this article, we examine a class of these propagation algorithms, discussing their model analysis and performance evaluation. Furthermore, we propose a possible algorithm’s extension introducing a dynamic setting of parameters according to the vehicular network’s conditions.