A cooperative and fully-distributed congestion control approach within VANETs

Formal Analysis of a VANET Congestion Control Protocol through Probabilistic Verification

“…In [2], a congestion control approach based on "dynamic scheduling" and "transmission of priority-based messages" is proposed whereby priorities are assigned to messages dynamically, and high-priority messages are transmitted in preference to lowpriority ones. In order to provide a reliable and safe network it is important to ensure fast delivery of emergency messages without any delay.…”

“…This has led to a range of recent studies which have focused on developing new congestion protocols more suitable to the challenges of VANETs: dynamic (and fast) network topology changes; dynamic network density changes; network scale problems; peculiar interference issues; limited bandwidth; etc. Indeed, improvements and refinements to VANET-specific congestion control protocols continue to be made [15,14,3,2]. In most of these, however, the analysis of a proposed method relies on simulations for an evaluation of its efficacy.…”

“…To the best of our knowledge there are only two studies which focus on model checking for the formal analysis of such control problems, as follows. In [2], the suggestion is to verify a congestion control method via the UPPAAL [1] system. However, although this suggestion was made, verification apparently did not succeed due to memory limitations.…”

“…In this paper we formally analyse and verify the specific congestion control approach for vehicular ad hoc networks introduced in [2]. (We selected [2] because the proposed protocol is completely dedicated to VANETs.)…”

“…(We selected [2] because the proposed protocol is completely dedicated to VANETs.) We then apply a probabilistic method to investigate the efficiency of the protocol, analyzing the protocol with the probabilistic model checker PRISM [8].…”