990 research outputs found
Improving VANET Protocols via Network Science
Developing routing protocols for Vehicular Ad Hoc Networks (VANETs) is a
significant challenge in these large, self- organized and distributed networks.
We address this challenge by studying VANETs from a network science perspective
to develop solutions that act locally but influence the network performance
globally. More specifically, we look at snapshots from highway and urban VANETs
of different sizes and vehicle densities, and study parameters such as the node
degree distribution, the clustering coefficient and the average shortest path
length, in order to better understand the networks' structure and compare it to
structures commonly found in large real world networks such as small-world and
scale-free networks. We then show how to use this information to improve
existing VANET protocols. As an illustrative example, it is shown that, by
adding new mechanisms that make use of this information, the overhead of the
urban vehicular broadcasting (UV-CAST) protocol can be reduced substantially
with no significant performance degradation.Comment: Proceedings of the 2012 IEEE Vehicular Networking Conference (VNC),
Korea, November 201
The Dynamics of Vehicular Networks in Urban Environments
Vehicular Ad hoc NETworks (VANETs) have emerged as a platform to support
intelligent inter-vehicle communication and improve traffic safety and
performance. The road-constrained, high mobility of vehicles, their unbounded
power source, and the emergence of roadside wireless infrastructures make
VANETs a challenging research topic. A key to the development of protocols for
inter-vehicle communication and services lies in the knowledge of the
topological characteristics of the VANET communication graph. This paper
explores the dynamics of VANETs in urban environments and investigates the
impact of these findings in the design of VANET routing protocols. Using both
real and realistic mobility traces, we study the networking shape of VANETs
under different transmission and market penetration ranges. Given that a number
of RSUs have to be deployed for disseminating information to vehicles in an
urban area, we also study their impact on vehicular connectivity. Through
extensive simulations we investigate the performance of VANET routing protocols
by exploiting the knowledge of VANET graphs analysis.Comment: Revised our testbed with even more realistic mobility traces. Used
the location of real Wi-Fi hotspots to simulate RSUs in our study. Used a
larger, real mobility trace set, from taxis in Shanghai. Examine the
implications of our findings in the design of VANET routing protocols by
implementing in ns-3 two routing protocols (GPCR & VADD). Updated the
bibliography section with new research work
Design and analysis of a beacon-less routing protocol for large volume content dissemination in vehicular ad hoc networks
Largevolumecontentdisseminationispursuedbythegrowingnumberofhighquality applications for Vehicular Ad hoc NETworks(VANETs), e.g., the live road surveillance service and the video-based overtaking assistant service. For the highly dynamical vehicular network topology, beacon-less routing protocols have been proven to be efficient in achieving a balance between the system performance and the control overhead. However, to the authors’ best knowledge, the routing design for large volume content has not been well considered in the previous work, which will introduce new challenges, e.g., the enhanced connectivity requirement for a radio link. In this paper, a link Lifetime-aware Beacon-less Routing Protocol (LBRP) is designed for large volume content delivery in VANETs. Each vehicle makes the forwarding decision based on the message header information and its current state, including the speed and position information. A semi-Markov process analytical model is proposed to evaluate the expected delay in constructing one routing path for LBRP. Simulations show that the proposed LBRP scheme outperforms the traditional dissemination protocols in providing a low end-to-end delay. The analytical model is shown to exhibit a good match on the delay estimation with Monte Carlo simulations, as well
CMD: A Multi-Channel Coordination Scheme for Emergency Message Dissemination in IEEE 1609.4
In the IEEE 1609.4 legacy standard for multi-channel communications in
vehicular ad hoc networks(VANETs), the control channel (CCH) is dedicated to
broadcast safety messages while the service channels (SCH's) are dedicated to
transmit infotainment service content. However, the SCH can be used as an
alternative to transmit high priority safety messages in the event that they
are invoked during the service channel interval (SCHI). This implies that there
is a need to transmit safety messages across multiple available utilized
channels to ensure that all vehicles receive the safety message. Transmission
across multiple SCH's using the legacy IEEE 1609.4 requires multiple channel
switching and therefore introduces further end-to-end delays. Given that safety
messaging is a life critical application, it is important that optimal
end-to-end delay performance is derived in multi-channel VANET scenarios to
ensure reliable safety message dissemination. To tackle this challenge, three
primary contributions are in this article: first, a channel coordinator
selection approach based on the least average separation distance (LAD) to the
vehicles that expect to tune to other SCH's and operates during the control
channel interval (CCHI) is proposed. Second, a model to determine the optimal
time intervals in which CMD operates during the CCHI is proposed. Third, a
contention back-off mechanism for safety message transmission during the SCHI
is proposed. Computer simulations and mathematical analysis show that CMD
performs better than the legacy IEEE 1609.4 and a selected state-of-the-art
multi-channel message dissemination schemes in terms of end-to-end delay and
packet reception ratio.Comment: 15 pages, 10 figures, 7 table
A Simple and Robust Dissemination Protocol for VANETs
Several promising applications for Vehicular Ad-hoc Networks (VANETs) exist. For most of these applications, the communication among vehicles is envisioned to be based on the broadcasting of messages. This is due to the inherent highly mobile environment and importance of these messages to vehicles nearby. To deal with broadcast communication, dissemination protocols must be defined in such a way as to (i) prevent the so-called broadcast storm problem in dense networks and (ii) deal with disconnected networks in sparse topologies. In this paper, we present a Simple and Robust Dissemination (SRD) protocol that deals with these requirements in both sparse and dense networks. Its novelty lies in its simplicity and robustness. Simplicity is achieved by considering only two states (cluster tail and non- tail) for a vehicle. Robustness is achieved by assigning message delivery responsibility to multiple vehicles in sparse networks. Our simulation results show that SRD achieves high delivery ratio and low end-to-end delay under diverse traffic conditions
Recommended from our members
Inter Vehicle Distance based connectivity aware routing in vehicular adhoc networks
Connectivity in vehicular traffic environment has witnessed significant attention due to the direct impact on the performance of most of the traffic safety applications of intelligent transport system. Various parameters such as density, speed, direction, link quality and inter vehicle distance (IVD) have been utilized for measuring connectivity. IVD has greater impact on connectivity and controls the impact of other parameters. Usage of real time IVD for measuring connectivity has not received sufficient attention in VANETs. This paper proposes IVD based connectivity aware routing (Ivd-CAR) for enhancing connectivity aware data dissemination. IVD calculation is robust and can effectively handle instantaneous GPS failure. Two localization techniques; namely, cooperative localization and Geometry based Localization are developed. Standard deviation of real time IVDs of a forwarding path is derived. Distribution of IVDs of a forwarding path is employed for estimating connectivity. Segment vehicle based next hop vehicle selection is utilized for incorporating network load, link quality and direction into consideration while selecting forwarding path. Simulations are carried out in ns2 to evaluate the performance of Ivd-CAR in realistic traffic environment. Comparative analysis of simulation results attests the superiority of Ivd-CAR to the state-of-the-art techniques: CSR and A-CAR
- …