The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In traffic safety applications for Vehicular Ad hoc Networks (VANETs), warning messages have to be disseminated whenever a dangerous situation occurs to alert nearby vehicles. Using inefficient broadcast schemes may lead to ineffective dissemination of warning messages causing broadcast storm problems. In the past, several approaches have been proposed to reduce the so called broadcast storm in multi-hop...
In recent years, new architectures and technologies have been proposed for Vehicular ad hoc networks (VANETs).However, the experiments to validate these proposals tend to overlook the most important and representative factors. Moreover, the scenarios simulated tend to be very simplistic (highways or Manhattan-based layouts), which could seriously affect the validity of the obtained results. In this...
Geographic message forwarding in vehicular ad hoc networks (VANET) has attracted much attention and become one of the most promising research areas recent years. In this paper, inspired with the intuition that drivers' route are with high regularity, we propose a prediction-based message forwarding strategy named Seer. Seer trains a 2nd-order Markov model based on long-term historic trip GPS data...
Multihop data delivery in vehicular ad hoc networks (VANETs) suffers from the fact that vehicles are highly mobile and inter-vehicle links are frequently disconnected. In this paper, we propose a multihop vehicle-to-infrastructure routing protocol named Vertex-Based Predictive Greedy Routing (VPGR), which predicts a sequence of valid vertices (or junctions) from a source vehicle to fixed infrastructure...
In vehicular ad hoc networks (VANETs), routing schemes play a vital role in data dissemination. As data dissemination in a timely and efficient manner is critical for safety-related applications, in this paper we introduce a location based routing algorithm namely geographic routing, which significantly reduces the packet dropping probability and the total number of packets in the network compared...
Connectivity analysis of Vehicular Ad Hoc Networks (VANETs) involves the study of static and dynamic characteristics of the network. Realistic mobility models are essential for both aspects, in order to produce valid configurations of the position of vehicles in one static instant, and to dynamically move such vehicles in an interval of time. Focusing on static connectivity evaluation, we extend the...
Routing is crucial to the success of VANET applications, which is complicated by the fact that VANETs are highly mobile, and sometimes partitioned. This paper proposes a contention based routing protocol for VANETs in city environments. Different from the position based routing, this protocol does not require the node to maintain its neighborspsila locations. Junctions through which a packet must...
For data dissemination using vehicular ad hoc networks (VANETs), it is essential to determine the end-to-end (e2e) delay, the packet dropping probability (PDP), the number of vehicles required, and the size of the vehiclespsila buffers needed to hold packets. In this paper, we study the impact of the above mentioned parameters and report original simulation results in a typical city scenario based...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.