534 research outputs found
Evaluating VANET routing in urban environments
Vehicular Ad-hoc Networks (VANETs) are a class of Mobile Ad-hoc Networks (MANETs) incorporated into moving vehicles. Nodes communicate with both and infrastructure to
provide Intelligent Transportation Systems (ITS) for the purpose of improving safety and comfort. Efficient and adaptive routing
protocols are essential for achieving reliable and scalable network performance. However, routing in VANETs is challenging due to
the high-speed movement of vehicles, which results in frequent network topology changes. This paper provides an in-depth evaluation
of three well-known MANET routing protocols, AODV, OLSR and GPSR, in VANET with urban environment setup. We compare their performance using three metrics: drop burst
length (DEL), delay and delivery ratio (PDR). The simulations are carried out using NS2 and SUMO simulators platforms, with scenarios configured to reflect real-world conditions. The
results show that OLSR is able to achieve a shorter DEL and demonstrates higher PDR performance comparing to AODV and GPSR under low network load. However, with GPSR,
the network shows more stable PDR under medium and high network load. In term of delay it is outperformed by GPSR, which delivers packets with the shortest delay
On the Experimental Evaluation of Vehicular Networks: Issues, Requirements and Methodology Applied to a Real Use Case
One of the most challenging fields in vehicular communications has been the
experimental assessment of protocols and novel technologies. Researchers
usually tend to simulate vehicular scenarios and/or partially validate new
contributions in the area by using constrained testbeds and carrying out minor
tests. In this line, the present work reviews the issues that pioneers in the
area of vehicular communications and, in general, in telematics, have to deal
with if they want to perform a good evaluation campaign by real testing. The
key needs for a good experimental evaluation is the use of proper software
tools for gathering testing data, post-processing and generating relevant
figures of merit and, finally, properly showing the most important results. For
this reason, a key contribution of this paper is the presentation of an
evaluation environment called AnaVANET, which covers the previous needs. By
using this tool and presenting a reference case of study, a generic testing
methodology is described and applied. This way, the usage of the IPv6 protocol
over a vehicle-to-vehicle routing protocol, and supporting IETF-based network
mobility, is tested at the same time the main features of the AnaVANET system
are presented. This work contributes in laying the foundations for a proper
experimental evaluation of vehicular networks and will be useful for many
researchers in the area.Comment: in EAI Endorsed Transactions on Industrial Networks and Intelligent
Systems, 201
Coherent, automatic address resolution for vehicular ad hoc networks
Published in: Int. J. of Ad Hoc and Ubiquitous Computing, 2017 Vol.25, No.3, pp.163 - 179. DOI: 10.1504/IJAHUC.2017.10001935The interest in vehicular communications has increased notably. In this paper, the use of the address resolution (AR) procedures is studied for vehicular ad hoc networks (VANETs). We analyse the poor performance of AR transactions in such networks and we present a new proposal called coherent, automatic address resolution (CAAR). Our approach inhibits the use of AR transactions and instead increases the usefulness of routing signalling to automatically match the IP and MAC addresses. Through extensive simulations in realistic VANET scenarios using the Estinet simulator, we compare our proposal CAAR to classical AR and to another of our proposals that enhances AR for mobile wireless networks, called AR+. In addition, we present a performance evaluation of the behaviour of CAAR, AR and AR+ with unicast traffic of a reporting service for VANETs. Results show that CAAR outperforms the other two solutions in terms of packet losses and furthermore, it does not introduce additional overhead.Postprint (published version
Dissimilarity metric based on local neighboring information and genetic programming for data dissemination in vehicular ad hoc networks (VANETs)
This paper presents a novel dissimilarity metric based on local neighboring information
and a genetic programming approach for efficient data dissemination in Vehicular Ad Hoc Networks
(VANETs). The primary aim of the dissimilarity metric is to replace the Euclidean distance in
probabilistic data dissemination schemes, which use the relative Euclidean distance among vehicles
to determine the retransmission probability. The novel dissimilarity metric is obtained by applying a
metaheuristic genetic programming approach, which provides a formula that maximizes the Pearson
Correlation Coefficient between the novel dissimilarity metric and the Euclidean metric in several
representative VANET scenarios. Findings show that the obtained dissimilarity metric correlates with
the Euclidean distance up to 8.9% better than classical dissimilarity metrics. Moreover, the obtained
dissimilarity metric is evaluated when used in well-known data dissemination schemes, such as
p-persistence, polynomial and irresponsible algorithm. The obtained dissimilarity metric achieves
significant improvements in terms of reachability in comparison with the classical dissimilarity
metrics and the Euclidean metric-based schemes in the studied VANET urban scenarios
Previous hop routing: exploiting opportunism in VANETs
Routing in highly dynamic wireless networks such as Vehicular Ad-hoc Networks
(VANETs) is a challenging task due to frequent topology changes. Sustaining
a transmission path between peers in such network environment is difficult. In
this thesis, Previous Hop Routing (PHR) is poposed; an opportunistic forwarding
protocol exploiting previous hop information and distance to destination to
make the forwarding decision on a packet-by-packet basis. It is intended for use in
highly dynamic network where the life time of a hop-by-hop path between source
and destination nodes is short. Exploiting the broadcast nature of wireless communication
avoids the need to copy packets, and enables redundant paths to be
formed. To save network resources, especially under high network loads, PHR
employs probabilistic forwarding. The forwarding probability is calculated based
on the perceived network load as measured by the arrival rate at the network
interface. We evaluate PHR in an urban VANET environment using NS2 (for
network traffic) and SUMO (for vehicular movement) simulators, with scenarios
configured to re
ect real-world conditions. The simulation scenarios are configured
to use two velocity profiles i.e. Low and high velocity. The results show that the
PHR networks able to achieve best performance as measured by Packet Delivery
Ratio (PDR) and Drop Burst Length (DBL) compared to conventional routing
protocols in high velocity scenarios
Drop-burst length evaluation of urban VANETs
Networks performance is traditionally evaluated using packet delivery ratio (PDR) and latency (delay).We propose an addition mechanism the drop-burst length (DBL). Many traffic classes display varying application-level performance according to the pattern of drops, even if the PDR is similar. In this paper we study a number of VANET scenarios and evaluate them with
these three metrics. Vehicular Ad-hoc Networks (VANETs) are an emerging class of Mobile Ad-hoc Network (MANETs) where nodes include both moving vehicles and fixed infrastructure. VANETs aim to make transportation systems more intelligent by sharing information to improve safety and comfort. Efficient and adaptive routing
protocols are essential for achieving reliable and scalable network performance. However, routing in VANETs is challenging due to the frequent, high-speed movement of vehicles, which results in
frequent network topology changes. Our simulations are carried out using NS2 (for network traffic) and SUMO (for vehicular movement) simulators, with scenarios configured to reflect real-world conditions. The results show that OLSR is able to achieve a best DBL performance and
demonstrates higher PDR performance comparing to AODV and GPSR under low network load. However, with GPSR, the network shows more stable PDR under medium and high network load. In term of delay OLSR is outperformed by GPSR
- …