scispace - formally typeset
Proceedings ArticleDOI

GeOpps: Geographical Opportunistic Routing for Vehicular Networks

Reads0
Chats0
TLDR
A forwarding protocol which exploits both the opportunistic nature and the inherent characteristics of the vehicular network in terms of mobility patterns and encounters, and the geographical information present in navigator systems of vehicles is presented.
Abstract
Vehicular networks can be seen as an example of hybrid delay tolerant network where a mixture of infostations and vehicles can be used to geographically route the information messages to the right location. In this paper we present a forwarding protocol which exploits both the opportunistic nature and the inherent characteristics of the vehicular network in terms of mobility patterns and encounters, and the geographical information present in navigator systems of vehicles. We also report about our evaluation of the protocol over a simulator using realistic vehicular traces and in comparison with other geographical routing protocols.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Vehicular ad hoc networks (VANETS): status, results, and challenges

TL;DR: Some of the VANET research challenges that still need to be addressed to enable the ubiquitous deployment and widespead adoption of scalable, reliable, robust, and secure VANet architectures, protocols, technologies, and services are outlined.
Journal ArticleDOI

A Review of Communication, Driver Characteristics, and Controls Aspects of Cooperative Adaptive Cruise Control (CACC)

TL;DR: The issues that existing CACC control modules face when considering close to ideal driving conditions are discussed, including how to keep drivers engaged in driving tasks during CACC operations.
Book ChapterDOI

Survey of Routing Protocols in Vehicular Ad Hoc Networks

TL;DR: The chapter discusses the advantages and disadvantages of these routing protocols, explores the motivation behind their design and trace the evolution of these protocols, and points out some open issues and possible direction of future research related to VANET routing.
Journal ArticleDOI

Directional routing and scheduling for green vehicular delay tolerant networks

TL;DR: A directional routing and scheduling scheme (DRSS) for green vehicle DTNs is presented by using Nash Q-learning approach that can optimize the energy efficiency with the considerations of congestion, buffer and delay.
BookDOI

Simulation of Urban Mobility

TL;DR: The DLR Reference EPFL-CONF-155461 shows good support for the claim that the Higgs boson-like particle has a high “consistency” with respect to the E-modulus of the proton-proton pair.
References
More filters

"A Survey of Mobility Models for Ad Hoc Network Research," Wireless Comm. & Mobile Computing (WCMC) : Special issue on Mobile Ad Hoc Networking : Research

T. Camp
TL;DR: A survey of mobility models that are used in the simulations of ad hoc networks and illustrates how the performance results of an ad hoc network protocol drastically change as a result of changing the mobility model simulated.
Journal ArticleDOI

A survey of mobility models for ad hoc network research

TL;DR: In this paper, a survey of mobility models used in the simulations of ad hoc networks is presented, which illustrate the importance of choosing a mobility model in the simulation of an ad hoc network protocol.

The omnet++ discrete event simulation system

TL;DR: OMNeT++ is fully programmable and modular, and it was designed from the ground up to support modeling very large networks built from reusable model components.
Proceedings ArticleDOI

MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks

TL;DR: The evaluations show that MaxProp performs better than protocols that have access to an oracle that knows the schedule of meetings between peers, and performs well in a wide variety of DTN environments.
Proceedings ArticleDOI

Routing in a delay tolerant network

TL;DR: This work forms the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be known in advance, and proposes a framework for evaluating routing algorithms in such environments.