Skip to main content
QUICK REVIEW

[Paper Review] Increasing Network Visibility Using Coded Repetition Beacon Piggybacking

Ghassan Samara|arXiv (Cornell University)|Jan 30, 2013
Vehicular Ad Hoc Networks (VANETs)7 references10 citations
TL;DR

This paper proposes a coded repetition beacon piggybacking mechanism to enhance network visibility in Vehicular Ad Hoc Networks (VANETs). By aggregating and propagating beacon information through a neighbor table across vehicles, the method improves situational awareness and reduces collision risks at intersections, achieving broader network visibility with minimal overhead.

ABSTRACT

Vehicular Ad hoc Networks (VANET) is one of the most challenging research areas in the field of Mobile Ad Hoc Networks. In this research, we propose a new mechanism for increasing network visibility, by taking the information gained from periodic safety messages (beacons), and inserting it into a 'neighbor' table. The table will be propagated to all neighbors giving a wider vision for each vehicle belonging to the network. It will also decrease the risk of collision at road junctions as each vehicle will have prior knowledge oncoming vehicles before reaching the junction.

Motivation & Objective

  • To address limited network visibility in Vehicular Ad Hoc Networks (VANETs), especially at road junctions.
  • To reduce the risk of vehicle collisions by enabling early detection of oncoming traffic.
  • To improve situational awareness through the propagation of aggregated beacon information across neighboring vehicles.
  • To design a low-overhead mechanism that leverages existing safety messages without modifying IEEE 802.11p MAC layer.

Proposed method

  • The mechanism collects periodic safety beacons from neighboring vehicles and stores them in a dynamic neighbor table.
  • It applies coded repetition to beacon messages, allowing multiple vehicles to piggyback and forward aggregated information.
  • The neighbor table is periodically updated and disseminated to all immediate neighbors, extending effective network visibility.
  • The system uses a coded repetition scheme to increase reliability and reduce the need for retransmissions.
  • Information from the neighbor table is used to predict the presence of vehicles before they become visible via direct communication.
  • The approach operates within the IEEE 802.11p MAC layer, ensuring backward compatibility and minimal protocol changes.

Experimental results

Research questions

  • RQ1How can network visibility be extended in VANETs without increasing signaling overhead?
  • RQ2To what extent can beacon piggybacking improve awareness of oncoming traffic at intersections?
  • RQ3Can coded repetition of beacon messages enhance the reliability and reach of network visibility mechanisms?
  • RQ4What is the impact of neighbor table propagation on collision avoidance in high-density traffic scenarios?
  • RQ5How does the proposed method maintain compatibility with existing IEEE 802.11p-based safety messaging?

Key findings

  • The proposed mechanism significantly increases network visibility by enabling vehicles to detect oncoming traffic earlier than with conventional methods.
  • The use of coded repetition improves the reliability of beacon information dissemination, reducing the chance of message loss.
  • Neighbor table propagation allows vehicles to maintain awareness of vehicles beyond direct transmission range, especially useful at blind spots like road junctions.
  • The system achieves broader situational awareness with minimal increase in signaling overhead, preserving spectrum efficiency.
  • Simulation results demonstrate improved collision avoidance performance due to early detection of conflicting vehicles.
  • The approach maintains compatibility with existing IEEE 802.11p-based safety message standards, enabling practical deployment.

Better researchstarts right now

From reading papers to final review, dramatically reduce your research time.

No credit card · Free plan available

This review was created by AI and reviewed by human editors.