Modeling Probabilistic Flooding in VANETs for Optimal Rebroadcast Probabilities
(2018) In IEEE Transactions on Intelligent Transportation Systems 20(2). p.556-570- Abstract
- Probabilistic flooding is commonly considered in vehicular ad-hoc networks (VANETs) to alleviate the celebrated broadcast storm problem. Heuristics and simulations have so far proved to be an efficient way with which to design probabilistic information dissemination solutions with demonstrated effectiveness. Supplementing with mathematical analysis for both design and evaluation is expected to generalize the results, and increase the confidence in the proposed solutions. So far, this has been limited due to the difficulties associated with the underlying stochastic dependencies. In this paper, we introduce simple models of single and multiple lane roads to design effective probabilistic flooding schemes for VANETs. The proposed analytical... (More)
- Probabilistic flooding is commonly considered in vehicular ad-hoc networks (VANETs) to alleviate the celebrated broadcast storm problem. Heuristics and simulations have so far proved to be an efficient way with which to design probabilistic information dissemination solutions with demonstrated effectiveness. Supplementing with mathematical analysis for both design and evaluation is expected to generalize the results, and increase the confidence in the proposed solutions. So far, this has been limited due to the difficulties associated with the underlying stochastic dependencies. In this paper, we introduce simple models of single and multiple lane roads to design effective probabilistic flooding schemes for VANETs. The proposed analytical framework offers a novel and generic tool which can cover any number of lanes, vehicle transmission range, and density. We derive difference equations whose solutions yield the probability of all vehicles receiving the emergency warning message as a function of the rebroadcast probability, the number of neighbors of each vehicle, and the dissemination distance. The models are validated using simulations, realistically representing both the traffic and networking aspects, and are used as a baseline to design two schemes for information dissemination which employ probabilistic flooding. The one attempts direct calculation of the required parameters whereas the other adaptively regulates the rebroadcast probability based on the vehicle speed. The schemes are evaluated using simulations and are found to achieve significant performance improvements compared to blind flooding with respect to the achieved reachability, end-to-end delay, and number of rebroadcasts, comparable to the performance achieved by optimal flooding, obtained via brute force. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/ebbb90bb-31cd-401f-b18a-2dd8b2249423
- author
- Saeed, Taqwa LU ; Mylonas, Yiannos ; Pitsillides, Andreas ; Papadopoulou, Vicky and Lestas, Marios
- publishing date
- 2018
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- Vehicular ad-hoc networks (VANETs), Probabilistic flooding, Information dissemination, Mathematical model
- in
- IEEE Transactions on Intelligent Transportation Systems
- volume
- 20
- issue
- 2
- pages
- 15 pages
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- external identifiers
-
- scopus:85046719266
- ISSN
- 1524-9050
- DOI
- 10.1109/TITS.2018.2828413
- language
- English
- LU publication?
- no
- id
- ebbb90bb-31cd-401f-b18a-2dd8b2249423
- date added to LUP
- 2023-03-17 12:06:15
- date last changed
- 2024-04-18 04:00:51
@article{ebbb90bb-31cd-401f-b18a-2dd8b2249423,
abstract = {{Probabilistic flooding is commonly considered in vehicular ad-hoc networks (VANETs) to alleviate the celebrated broadcast storm problem. Heuristics and simulations have so far proved to be an efficient way with which to design probabilistic information dissemination solutions with demonstrated effectiveness. Supplementing with mathematical analysis for both design and evaluation is expected to generalize the results, and increase the confidence in the proposed solutions. So far, this has been limited due to the difficulties associated with the underlying stochastic dependencies. In this paper, we introduce simple models of single and multiple lane roads to design effective probabilistic flooding schemes for VANETs. The proposed analytical framework offers a novel and generic tool which can cover any number of lanes, vehicle transmission range, and density. We derive difference equations whose solutions yield the probability of all vehicles receiving the emergency warning message as a function of the rebroadcast probability, the number of neighbors of each vehicle, and the dissemination distance. The models are validated using simulations, realistically representing both the traffic and networking aspects, and are used as a baseline to design two schemes for information dissemination which employ probabilistic flooding. The one attempts direct calculation of the required parameters whereas the other adaptively regulates the rebroadcast probability based on the vehicle speed. The schemes are evaluated using simulations and are found to achieve significant performance improvements compared to blind flooding with respect to the achieved reachability, end-to-end delay, and number of rebroadcasts, comparable to the performance achieved by optimal flooding, obtained via brute force.}},
author = {{Saeed, Taqwa and Mylonas, Yiannos and Pitsillides, Andreas and Papadopoulou, Vicky and Lestas, Marios}},
issn = {{1524-9050}},
keywords = {{Vehicular ad-hoc networks (VANETs); Probabilistic flooding; Information dissemination; Mathematical model}},
language = {{eng}},
number = {{2}},
pages = {{556--570}},
publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
series = {{IEEE Transactions on Intelligent Transportation Systems}},
title = {{Modeling Probabilistic Flooding in VANETs for Optimal Rebroadcast Probabilities}},
url = {{http://dx.doi.org/10.1109/TITS.2018.2828413}},
doi = {{10.1109/TITS.2018.2828413}},
volume = {{20}},
year = {{2018}},
}