We investigate the broadcast problem in intervehicular networks, aiming at assessing a definitive comparison of two antipodean algorithm classes: the first one makes use of instantaneous information, while the second one relies on longer- term knowledge gained through a beaconing procedure. Using a realistic microscopic model to represent the vehicular traffic flow, we investigate the performance of the above broadcast algorithm classes by simulation. In order to explore a very large algorithmic design space, we devise a Convex Hull framework that allows us to effectively compare and compactly present the boundaries of the solution space for each algorithm class. By the use of such framework we show that the beaconing approach is not justified for broadcast in suburban and highway VANETs, as there is no performance gain that justifies the complexity entailed by the beaconing procedure.
['Dario Rossi', 'Roberta Fracchia', 'Michela Meo']
VANETs: Why Use Beaconing at All ?