V-DESYNC: Desynchronization for Beacon Broadcasting on Vehicular Networks

Desynchronization approaches in wireless sensor networks converge to time-division multiple access (TDMA) of the shared medium without requiring clock synchronization amongst the wireless sensors, or indeed the presence of a central (coordinator) node. All such methods are based on the principle of reactive listening of periodic "fire" or "pulse" broadcasts: each node updates the time of its fire message broadcasts based on received fire messages from some of the remaining nodes sharing the given spectrum. In this paper, we present a novel framework to estimate the required iterations for convergence to fair TDMA scheduling. Our estimates are fundamentally different from previous conjectures or bounds found in the literature as, for the first time, convergence to TDMA is defined in a stochastic sense. Our analytic results apply to the DESYNC algorithm and to pulse-coupled oscillator algorithms with inhibitory coupling. The experimental evaluation via iMote2 TinyOS nodes (based on the IEEE 802.15.4 standard) as well as via computer simulations demonstrates that, for the vast majority of settings, our stochastic model is within one standard deviation from the experimentally-observed convergence iterations. The proposed estimates are thus shown to characterize the desynchronization convergence iterations significantly better than existing conjectures or bounds. Therefore, they contribute towards the analytic understanding of how a desynchronization-based system is expected to evolve from random initial conditions to the desynchronized steady state.

show abstract

“…1. For all desynchronization algorithms under consideration [3], [4], [9], [12], [20], [23], [26], [32]:…”

Section: B Introduction To Desynchronizationmentioning

confidence: 99%

Convergence of Desynchronization Primitives in Wireless Sensor Networks: A Stochastic Modeling Approach

Buranapanichkit

Deligiannis

Andreopoulos

2015

IEEE Trans. Signal Process.

View full text Add to dashboard Cite

show abstract

“…In [15] the authors propose what appears to be the first application of spontaneous desynchronization to vehicular networks. They propose V-DESYNC which is a slight modification of DESYNC [12] in order to : (1) take care of initial beacon collisions (which are not resolved by DESYNC) and (2) accept nodes with different emitting (beaconing) periods.…”

Section: Related Workmentioning

confidence: 99%

“…with X ∼ U(− a 2 , a 2 ) and a, a fraction of the beaconing period. In the remainder of the paper we use 10% of the beaconing period (it is the same value as in [15]). We refer to this algorithm as DESYNC Random.…”

Section: ) Frogmentioning

confidence: 99%

On the use of bio-inspired desynchronization algorithms for beaconing in ITS

Mouradian

2017

2017 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Road safety applications heavily rely on periodic message exchanges known as beaconing in order to gain awareness about the current situation within the vehicle communication range. The high level of transmission contention in dense vehicular networks can induce successive beacon collisions. These collisions impede the vehicles to have an up-to-date view of the environment which can lead to bad decisions from the applications and in the worst case create car crashes. Many propositions of the literature try to tackle this problem by modifying the beacon emission period and/or power either randomly or based on the network density or other measured indicators. In this paper, we explore the possibility to use bio-inspired desynchronization algorithms to avoid beacon collisions. The main idea behind these algorithms is to make nodes converging toward a consensus where they do not emit their beacon at the same time in order to avoid collisions. We show that desynchronization algorithms, if properly implemented, can significantly reduce the probability to have large inter-beacon delays.

show abstract

“…Since most applications for vehicular networks are based on beacons exchange among vehicles, the beaconing mechanism has been widely studied in the literature [12]- [20]. Although essential to improve situational awareness, beaconing in dense networks can however increase the channel congestion beyond acceptable limits and consequently degrade the perfomance of the upper layer applications.…”

Section: Related Workmentioning

confidence: 99%

“…The authors in [19] propose a statistical beaconing congestion control mechanism, which leverages the channel statistics and regulates the transmit power based on the measured channel busy time or vehicle density. The possibility of desynchronizing the beacon transmissions, in order to minimize the collision probability, is explored in [20].…”

Section: Related Workmentioning

confidence: 99%

Multihop Beaconing Forwarding Strategies in Congested IEEE 802.11p Vehicular Networks

Librino

Renda

Santi

2016

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Multi-hop propagation of situational information is a promising technique for improving beaconing performance and increasing the degree of situational awareness onboard vehicles. A possible way of achieving this is by piggyback information on the beacon packets that are sent periodically by each vehicle in the network, as prescribed by the DSRC and ETSI standards. However, prescribed limitations on beacon size imply that only information about a very small number of surrounding vehicles can be piggybacked in a beacon packet. In most traffic situations, this number is well below the typical number of vehicles within transmission range, implying that multi-hop forwarding strategies must be devised to select which neighboring vehicle's information to include in a transmitted beacon. In this paper, we designed different multi-hop forwarding strategies, and assessed their effectiveness in delivering fresh situational information to surrounding vehicles. Effectiveness is estimated in terms of both information age and probability of experiencing a potentially dangerous situational-awareness blackout. Both metrics are estimated as a function of the hop distance from the transmitting vehicle, and in presence of different level of radio channel congestion. The investigation is based on extensive simulations whose multi-hop communication performance is corroborated by real-world measurements. The results show that network-coding based strategies substantially improve forwarding performance as compared to a randomized strategy, reducing the average information age of up to 60%, and the blackout probability of up to two orders of magnitude.We also consider the effect of multi-hop propagation of situational information on the reliability of a forward collision warning application, and show that network-coding based propagation yields a factor three improvement of reliability with respect to a randomized forwarding strategy, and even higher improvements with respect to the case of no propagation.

show abstract

V-DESYNC: Desynchronization for Beacon Broadcasting on Vehicular Networks

Cited by 13 publications

References 9 publications

Convergence of Desynchronization Primitives in Wireless Sensor Networks: A Stochastic Modeling Approach

Convergence of Desynchronization Primitives in Wireless Sensor Networks: A Stochastic Modeling Approach

On the use of bio-inspired desynchronization algorithms for beaconing in ITS

Multihop Beaconing Forwarding Strategies in Congested IEEE 802.11p Vehicular Networks

Contact Info

Product

Resources

About