761 research outputs found
A Taxonomy for Congestion Control Algorithms in Vehicular Ad Hoc Networks
One of the main criteria in Vehicular Ad hoc Networks (VANETs) that has
attracted the researchers' consideration is congestion control. Accordingly,
many algorithms have been proposed to alleviate the congestion problem,
although it is hard to find an appropriate algorithm for applications and
safety messages among them. Safety messages encompass beacons and event-driven
messages. Delay and reliability are essential requirements for event-driven
messages. In crowded networks where beacon messages are broadcasted at a high
number of frequencies by many vehicles, the Control Channel (CCH), which used
for beacons sending, will be easily congested. On the other hand, to guarantee
the reliability and timely delivery of event-driven messages, having a
congestion free control channel is a necessity. Thus, consideration of this
study is given to find a solution for the congestion problem in VANETs by
taking a comprehensive look at the existent congestion control algorithms. In
addition, the taxonomy for congestion control algorithms in VANETs is presented
based on three classes, namely, proactive, reactive and hybrid. Finally, we
have found the criteria in which fulfill prerequisite of a good congestion
control algorithm
Recommended from our members
Location Aware Data Aggregation for Efficient Message Dissemination in Vehicular Ad Hoc Networks
An intelligent location-aware data aggregation mechanism for real-time observation, estimation, and efficient dissemination of any kind of traffic information in vehicular ad hoc networks (VANETs) is presented in this paper. The mechanism introduces a location awareness algorithm, enabling spatiotemporal database indexing and providing the location context of the messages without the use of advanced positioning systems such as satellite navigation and digital maps. Intelligent passive clustering and adaptive broadcasting are used to minimize the number of messages exchanged, packet collisions, and network load. The incoming messages are fused by a Kalman filter, allowing the description of the traffic-related information as a system characterized by as many variables as needed, depending on the application design. The scheme allows the comparison of aggregates and single observations, which enables their merging and better overall accuracy. Old information in aggregates is removed by real-time database refreshing, thus leaving only newer relevant information for the driver to make real-time decisions in traffic. The mechanism is generic and can be used for any kind of VANET information. It is evaluated by extensive simulations to show the efficiency and accuracy
SDDV: scalable data dissemination in vehicular ad hoc networks
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
SCALABLE MULTI-HOP DATA DISSEMINATION IN VEHICULAR AD HOC NETWORKS
Vehicular Ad hoc Networks (VANETs) aim at improving road safety and travel comfort, by providing self-organizing environments to disseminate traffic data, without requiring fixed infrastructure or centralized administration. Since traffic data is of public interest and usually benefit a group of users rather than a specific individual, it is more appropriate to rely on broadcasting for data dissemination in VANETs. However, broadcasting under dense networks suffers from high percentage of data redundancy that wastes the limited radio channel bandwidth. Moreover, packet collisions may lead to the broadcast storm problem when large number of vehicles in the same vicinity rebroadcast nearly simultaneously. The broadcast storm problem is still challenging in the context of VANET, due to the rapid changes in the network topology, which are difficult to predict and manage. Existing solutions either do not scale well under high density scenarios, or require extra communication overhead to estimate traffic density, so as to manage data dissemination accordingly. In this dissertation, we specifically aim at providing an efficient solution for the broadcast storm problem in VANETs, in order to support different types of applications. A novel approach is developed to provide scalable broadcast without extra communication overhead, by relying on traffic regime estimation using speed data. We theoretically validate the utilization of speed instead of the density to estimate traffic flow. The results of simulating our approach under different density scenarios show its efficiency in providing scalable multi-hop data dissemination for VANETs
Node Density Estimation in VANETs Using Received Signal Power
Accurately estimating node density in Vehicular Ad hoc Networks, VANETs, is a challenging and crucial task. Various approaches exist, yet none takes advantage of physical layer parameters in a distributed fashion. This paper describes a framework that allows individual nodes to estimate the node density of their surrounding network independent of beacon messages and other infrastructure-based information. The proposal relies on three factors: 1) a discrete event simulator to estimate the average number of nodes transmitting simultaneously; 2) a realistic channel model for VANETs environment; and 3) a node density estimation technique. This work provides every vehicle on the road with two equations indicating the relation between 1) received signal strength versus simultaneously transmitting nodes, and 2) simultaneously transmitting nodes versus node density. Access to these equations enables individual nodes to estimate their real-time surrounding node density. The system is designed to work for the most complicated scenarios where nodes have no information about the topology of the network and, accordingly, the results indicate that the system is reasonably reliable and accurate. The outcome of this work has various applications and can be used for any protocol that is affected by node density
Quality-Aware Broadcasting Strategies for Position Estimation in VANETs
The dissemination of vehicle position data all over the network is a
fundamental task in Vehicular Ad Hoc Network (VANET) operations, as
applications often need to know the position of other vehicles over a large
area. In such cases, inter-vehicular communications should be exploited to
satisfy application requirements, although congestion control mechanisms are
required to minimize the packet collision probability. In this work, we face
the issue of achieving accurate vehicle position estimation and prediction in a
VANET scenario. State of the art solutions to the problem try to broadcast the
positioning information periodically, so that vehicles can ensure that the
information their neighbors have about them is never older than the
inter-transmission period. However, the rate of decay of the information is not
deterministic in complex urban scenarios: the movements and maneuvers of
vehicles can often be erratic and unpredictable, making old positioning
information inaccurate or downright misleading. To address this problem, we
propose to use the Quality of Information (QoI) as the decision factor for
broadcasting. We implement a threshold-based strategy to distribute position
information whenever the positioning error passes a reference value, thereby
shifting the objective of the network to limiting the actual positioning error
and guaranteeing quality across the VANET. The threshold-based strategy can
reduce the network load by avoiding the transmission of redundant messages, as
well as improving the overall positioning accuracy by more than 20% in
realistic urban scenarios.Comment: 8 pages, 7 figures, 2 tables, accepted for presentation at European
Wireless 201
- …