7,083 research outputs found
Two-Hop Connectivity to the Roadside in a VANET Under the Random Connection Model
We compute the expected number of cars that have at least one two-hop path to
a fixed roadside unit in a one-dimensional vehicular ad hoc network in which
other cars can be used as relays to reach a roadside unit when they do not have
a reliable direct link. The pairwise channels between cars experience Rayleigh
fading in the random connection model, and so exist, with probability function
of the mutual distance between the cars, or between the cars and the roadside
unit. We derive exact equivalents for this expected number of cars when the car
density tends to zero and to infinity, and determine its behaviour using
an infinite oscillating power series in , which is accurate for all
regimes. We also corroborate those findings to a realistic situation, using
snapshots of actual traffic data. Finally, a normal approximation is discussed
for the probability mass function of the number of cars with a two-hop
connection to the origin. The probability mass function appears to be well
fitted by a Gaussian approximation with mean equal to the expected number of
cars with two hops to the origin.Comment: 21 pages, 7 figure
Line-of-Sight Obstruction Analysis for Vehicle-to-Vehicle Network Simulations in a Two-Lane Highway Scenario
In vehicular ad-hoc networks (VANETs) the impact of vehicles as obstacles has
largely been neglected in the past. Recent studies have reported that the
vehicles that obstruct the line-of-sight (LOS) path may introduce 10-20 dB
additional loss, and as a result reduce the communication range. Most of the
traffic mobility models (TMMs) today do not treat other vehicles as obstacles
and thus can not model the impact of LOS obstruction in VANET simulations. In
this paper the LOS obstruction caused by other vehicles is studied in a highway
scenario. First a car-following model is used to characterize the motion of the
vehicles driving in the same direction on a two-lane highway. Vehicles are
allowed to change lanes when necessary. The position of each vehicle is updated
by using the car-following rules together with the lane-changing rules for the
forward motion. Based on the simulated traffic a simple TMM is proposed for
VANET simulations, which is capable to identify the vehicles that are in the
shadow region of other vehicles. The presented traffic mobility model together
with the shadow fading path loss model can take in to account the impact of LOS
obstruction on the total received power in the multiple-lane highway scenarios.Comment: 8 pages, 11 figures, Accepted for publication in the International
Journal of Antennas and Propagation, Special Issue on Radio Wave Propagation
and Wireless Channel Modeling 201
A universal approach to coverage probability and throughput analysis for cellular networks
This paper proposes a novel tractable approach for accurately analyzing both the coverage probability and the achievable throughput of cellular networks. Specifically, we derive a new procedure referred to as the equivalent uniformdensity plane-entity (EUDPE)method for evaluating the other-cell interference. Furthermore, we demonstrate that our EUDPE method provides a universal and effective means to carry out the lower bound analysis of both the coverage probability and the average throughput for various base-station distribution models that can be found in practice, including the stochastic Poisson point process (PPP) model, a uniformly and randomly distributed model, and a deterministic grid-based model. The lower bounds of coverage probability and average throughput calculated by our proposed method agree with the simulated coverage probability and average throughput results and those obtained by the existing PPP-based analysis, if not better. Moreover, based on our new definition of cell edge boundary, we show that the cellular topology with randomly distributed base stations (BSs) only tends toward the Voronoi tessellation when the path-loss exponent is sufficiently high, which reveals the limitation of this popular network topology
Implementation of CAVENET and its usage for performance evaluation of AODV, OLSR and DYMO protocols in vehicular networks
Vehicle Ad-hoc Network (VANET) is a kind of Mobile Ad-hoc Network (MANET) that establishes wireless connection between cars. In VANETs and MANETs, the topology of the network changes very often, therefore implementation of efficient routing protocols is very important problem. In MANETs, the Random Waypoint (RW) model is used as a simulation model for generating node mobility pattern. On the other hand, in VANETs, the mobility patterns of nodes is restricted along the roads, and is affected by the movement of neighbour nodes. In this paper, we present a simulation system for VANET called CAVENET (Cellular Automaton based VEhicular NETwork). In CAVENET, the mobility patterns of nodes are generated by an 1-dimensional cellular automata. We improved CAVENET and implemented some routing protocols. We investigated the performance of the implemented routing protocols by CAVENET. The simulation results have shown that DYMO protocol has better performance than AODV and OLSR protocols.Peer ReviewedPostprint (published version
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
CBPRS: A City Based Parking and Routing System
Navigational systems assist drivers in finding a route between two locations that is time optimal in theory but seldom in practice due to delaying circumstances the system is unaware of, such as traffic jams. Upon arrival at the destination the service of the system ends and the driver is forced to locate a parking place without further assistance. We propose a City Based Parking Routing System (CBPRS) that monitors and reserves parking places for CBPRS participants within a city. The CBPRS guides vehicles using an ant based distributed hierarchical routing algorithm to their reserved parking place. Through means of experiments in a simulation environment we found that reductions of travel times for participants were significant in comparison to a situation where vehicles relied on static routing information generated by the well known Dijkstra’s algorithm. Furthermore, we found that the CBPRS was able to increase city wide traffic flows and decrease the number and duration of traffic jams throughout the city once the number of participants increased.information systems;computer simulation;dynamic routing
- …