Congestion control for safety messages in VANETs: Concepts and framework

Zhang, W.; Festag, Andreas; Baldessari, Roberto; Le, Long Bao

doi:10.1109/itst.2008.4740256

Cited by 35 publications

(30 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We propose a simple expression for channel busy time based on [34]. This expression models the normalized channel load.…”

Section: B Channel Loadmentioning

confidence: 99%

“…Measuring network load is important in order to be able to influence the generation of load by the nodes, a practise known as congestion control [34]. This is because the network functions optimally within a certain region of network load.…”

Section: B Channel Loadmentioning

confidence: 99%

“…The three factors which constitute the utilization are identified in [34] as parameters for a generic congestion control framework. We evaluate these parameters for one specific application, beaconing for a C-ACC system.…”

Section: B Channel Loadmentioning

confidence: 99%

See 2 more Smart Citations

Exploring the solution space of beaconing in VANETs

Eenennaam

Wolterink

Karagiannis

et al. 2009

2009 IEEE Vehicular Networking Conference (VNC)

107

View full text Add to dashboard Cite

Abstract-Vehicular networking is an enabling technology for Intelligent Transportation Systems (ITS). Different types of vehicular traffic applications are currently being investigated. In this paper we briefly introduce the communication requirements of a Co-operative Adaptive Cruise Control (C-ACC) vehicular traffic efficiency application. Furthermore, we propose a Channel Busy Time model to evaluate the solution space of a vehicular beaconing system designed to communicate information both vital and sufficient for vehicular traffic applications and in particular for C-ACC. We identify that the solution space is three-dimensional. These dimensions being based on the number of nodes (or vehicles), the beacon generation rate of the nodes and the size (or duration) of a beacon message.Based on the Channel Busy Time model we derive boundaries and ranges of parameters within which the beaconing system can be adapted to meet the requirements of the C-ACC application.

show abstract

“…We propose a simple expression for channel busy time based on [34]. This expression models the normalized channel load.…”

Section: B Channel Loadmentioning

confidence: 99%

Section: B Channel Loadmentioning

confidence: 99%

See 1 more Smart Citation

Exploring the solution space of beaconing in VANETs

Eenennaam

Wolterink

Karagiannis

et al. 2009

2009 IEEE Vehicular Networking Conference (VNC)

107

View full text Add to dashboard Cite

show abstract

“…It is generally assumed in the literature that the cooperative application requirements can be defined in terms of dissemination area (or range), latency (or delay) and reliability [25]. This extends the preliminary requirements defined by VSC [26] and ETSI [27], which consider only some of these requirements.…”

Section: Awareness Controlmentioning

confidence: 98%

Congestion and Awareness Control in Cooperative Vehicular Systems

et al. 2011

View full text Add to dashboard Cite

Abstract-Cooperative vehicular systems have been identified as a promising solution to overcome the current and future needs for increasing traffic safety and efficiency, while providing infotainment and added-value services on the move. To achieve their objectives, cooperative vehicular systems will be based on wireless communications between vehicles and with other infrastructure nodes, and will have to deal with highly dynamic nodes, challenging propagation conditions, and stringent application requirements. By looking at cooperative applications and their data traffic, as well as the current and foreseen spectrum allocations for cooperative vehicular systems, there is a risk that the corresponding radio channels could easily be saturated if no control algorithms are used. The saturation of the radio channels would result in unstable vehicular communications, and thus in an inefficient operation of cooperative systems. As a prime example of upcoming ubiquitous networks contributing to the vision of "a thousand radios per person", cooperative vehicular systems need to be designed to scale to high densities of radios without centralized coordination, while at the same time guaranteeing the requirements of the implemented applications and services, for example the stringent needs of active traffic safety applications. In this paper, we survey and classify various decentralized methods to control the load on the radio channels and to ensure each vehicle's capacity to detect and communicate with the relevant neighbouring vehicles, with a particular focus on approaches based on transmit power and rate control. Finally, we discuss the open research challenges that are imposed by different application requirements and potential existing contradictions.

show abstract

“…In general, previous studies focused on applying a single technique, identifying the optimal parameter configuration and indicating the VANET performance gain. However, recent work has pointed out the need for a more holistic approach, where different techniques are combined to effectively solve the VANET scalability problem [16][17][18]. However, this is not as straightforward as it may seem, techniques that perform well independently might very well result in mutual compensations, ruling out each others performance gains.…”

Section: Introductionmentioning

confidence: 99%

SDDV: scalable data dissemination in vehicular ad hoc networks

Vandenberghe

Cappelle

Moerman

et al. 2014

J Wireless Com Network

View full text Add to dashboard Cite

An important challenge in the domain of vehicular ad hoc networks (VANET) is the scalability of data dissemination. Under dense traffic conditions, the large number of communicating vehicles can easily result in a congested wireless channel. In that situation, delays and packet losses increase to a level where the VANET cannot be applied for road safety applications anymore. This paper introduces scalable data dissemination in vehicular ad hoc networks (SDDV), a holistic solution to this problem. It is composed of several techniques spread across the different layers of the protocol stack. Simulation results are presented that illustrate the severity of the scalability problem when applying common state-of-the-art techniques and parameters. Starting from such a baseline solution, optimization techniques are gradually added to SDDV until the scalability problem is entirely solved. Besides the performance evaluation based on simulations, the paper ends with an evaluation of the final SDDV configuration on real hardware. Experiments including 110 nodes are performed on the iMinds w-iLab.t wireless lab. The results of these experiments confirm the results obtained in the corresponding simulations.

show abstract

Congestion control for safety messages in VANETs: Concepts and framework

Cited by 35 publications

References 4 publications

Exploring the solution space of beaconing in VANETs

Exploring the solution space of beaconing in VANETs

Congestion and Awareness Control in Cooperative Vehicular Systems

SDDV: scalable data dissemination in vehicular ad hoc networks

Contact Info

Product

Resources

About