Design and Analysis of A Beacon-Less Routing Protocol for Large Volume Content Dissemination in Vehicular Ad Hoc Networks

Miao Hu, Zhangdui Zhong, Minming Ni, Andrea Baiocchi2016 · DOI

TL;DR

This paper introduces the Link Lifetime-aware Beacon-less Routing Protocol (LBRP) for efficient large-volume content dissemination in Vehicular Ad Hoc Networks (VANETs). LBRP addresses the challenge of maintaining stable, low-delay communication paths in dynamic vehicular environments by considering link lifetime alongside distance, outperforming existing protocols in simulations.

What Problem Does This Paper Address?

Vehicular Ad Hoc Networks (VANETs) are crucial for intelligent transportation systems, enabling applications like real-time road surveillance and entertainment. These applications often require disseminating large volumes of data, which is significantly different from the small, periodic safety messages typically handled. Traditional routing protocols in VANETs, especially beacon-less ones, focus on minimizing control overhead and often prioritize distance for next-hop selection. However, for large data volumes, the dynamic nature of VANETs means that a chosen path can break frequently, leading to high end-to-end delays. The paper identifies a gap in existing research: the lack of routing protocols specifically designed to maintain durable, low-delay paths for large content dissemination by explicitly considering link lifetime.

Methods

The core contribution is the Link Lifetime-aware Beacon-less Routing Protocol (LBRP). LBRP operates in a decentralized, beacon-less manner, meaning vehicles don't constantly broadcast their status. Instead, each vehicle makes forwarding decisions based on message header information and its own state (speed, position). LBRP involves several stages:

  • SOV Finding Process: The subscribing vehicle (SUV) broadcasts a content request.
  • SOV Decision Process: Candidate source vehicles (SOVs) respond, and the SUV selects the best SOV based on a heuristic weighting metric that considers average transceiver distance and estimated overall content transmission time.
  • BV Selection Process: The chosen SOV initiates a request for backbone vehicles (BVs). Candidates set a random backoff timer, and the winner is selected. This timer is influenced by both the inter-vehicle distance and the estimated link lifetime.
  • BV Re-Selection Process: Mechanisms are in place to detect path failures (e.g., via MAC-level ACKs or overhearing) and re-establish broken links.

A key novelty is the integration of link lifetime into the relay selection process, aiming to create more stable paths. To analyze the protocol's performance, the authors developed a semi-Markov process (SMP) model to estimate the expected delay in constructing a routing path. This model captures the state transitions (vehicle lane changes) and random transition times (backoff timer delays).

Datasets

Not discussed in the paper. The evaluation relies on simulations using the SUMO (Simulation of Urban MObility) tool.

Key Insights and Ideas

  • Link Lifetime is Crucial for Large Content: Simply choosing the furthest or nearest node isn't enough for large data. Paths need to be robust against frequent link breaks caused by vehicle mobility.
  • Beacon-less Efficiency for VANETs: The paper reinforces the benefit of beacon-less approaches in VANETs to reduce control overhead, which is critical in highly dynamic environments.
  • Balancing Distance and Lifetime: LBRP's core innovation is its parameter e that allows balancing the importance of link transmission distance and link lifetime in relay selection. This is a critical trade-off for achieving both low delay and path stability.
  • Analytical Modeling for Delay: The use of a semi-Markov process provides a rigorous way to model and predict the delay associated with path setup, which is a significant contributor to the overall end-to-end delay in beacon-less protocols.
  • Simulation-Analysis Alignment: The strong agreement between the analytical model's predictions and simulation results validates the model's accuracy and the protocol's design.

Key Results

  • Lower End-to-End Delay: LBRP consistently achieved lower end-to-end transmission delays compared to Distance-Based Forwarding (DBF), Random Timer Forwarding (RTF), and Link State-aware Geographic Routing (LSGR) across various vehicular traffic densities.
  • Improved Path Lifetime: LBRP demonstrated a significantly longer path lifetime than DBF and RTF, second only to LSGR, due to its consideration of link stability.
  • Comparable Path Construction Success: The path construction successful probability for LBRP was comparable to other protocols, especially at higher traffic densities, approaching 1.
  • Analytical Model Accuracy: The analytical model's Probability Mass Functions (PMFs) for one-hop timer delay and transmission distance closely matched simulation results, validating its predictive power.

Limitations and Future Work

  • Parameter e Optimization: The paper acknowledges that the chosen value of e (0.5) is not necessarily optimal for all network topologies. Future work will focus on finding optimal strategies for e across different road networks.
  • Network Topology: The current analysis and simulations primarily focus on a linear highway scenario. The authors suggest extending the work to more complex road networks.
  • Infrastructure-Based Protocols: For fully-disconnected vehicular networks (e.g., during nighttime), the authors note that infrastructure-based protocols might be more suitable and suggest this as a future research direction.

Summary updated

BibTeX
@misc{hu2016design,
  author = {Miao Hu and Zhangdui Zhong and Minming Ni and Andrea Baiocchi},
  title = {{Design and Analysis of A Beacon-Less Routing Protocol for Large Volume Content Dissemination in Vehicular Ad Hoc Networks}},
  year = {2016},
  doi = {10.3390/s16111834},
}
Figure