Zone-Based Packet Forwarding in Vehicular Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Vehicular networks face challenges in multi-hop packet forwarding due to unstable links and varying node densities, leading to high packet loss and congestion, as existing protocols rely on single relay schemes that are susceptible to the gray-zone phenomenon and fail to adapt to dynamic connectivity.
Innovation Solution
The DAZL protocol employs zone-based forwarding, leveraging vehicle diversity and distributed prioritization to opportunistically select the best available channel, and introduces network-layer slotting to control contention and duplication, allowing multiple nodes to cooperate in packet forwarding and adapt to different densities.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If single relay schemes are used for packet forwarding, then device complexity is reduced, but reliability deteriorates due to susceptibility to gray-zone phenomenon and unstable links
Solution Approach 1:
The forwarding process is segmented into multiple independent relay nodes instead of using a single relay. Each node in the forwarding zone independently evaluates its utility and may forward the packet, creating multiple parallel transmission paths that improve reliability without significantly increasing overall system complexity
Solution Approach 2:
Multiple relay nodes are merged into a cooperative forwarding zone where all nodes work together to forward packets. The combining of multiple relays provides redundancy against link failures and gray-zone effects, maintaining reliability while keeping the forwarding mechanism relatively simple through distributed decision-making
2Reliability
If multiple nodes are allowed to forward packets simultaneously, then reliability improves through redundancy, but congestion worsens due to contention in high-density scenarios
Solution Approach 1:
The forwarding zone size and the number of active forwarders are made dynamic rather than fixed. The system adapts the level of redundancy based on current network conditions, allowing multiple forwarders when reliability is needed while reducing forwarder count when density causes congestion, thus balancing reliability and throughput
Solution Approach 2:
The utility threshold parameter is adjusted dynamically to control the number of active forwarders. By changing this parameter, the system can limit the number of nodes forwarding packets simultaneously, preventing congestion in high-density scenarios while maintaining sufficient redundancy for reliable delivery
3Reliability
If forwarding zone size is increased to provide more redundancy, then reliability improves, but contention worsens in high-density scenarios
Solution Approach 1:
The forwarding zone size is made dynamic and adapts to local node density. In low-density areas, the zone expands to provide more redundancy, while in high-density areas, the zone shrinks to reduce contention. This dynamic adjustment allows the system to maintain reliability without causing congestion in dense scenarios
4Productivity
If nodes wait longer before forwarding to reduce contention, then congestion is reduced, but latency increases
Solution Approach 1:
Instead of all nodes waiting equally long periods, only a limited number of high-utility nodes are selected to forward packets. This partial action approach reduces the number of contending nodes without requiring long wait times, thus reducing congestion while maintaining low latency through selective forwarding
Data Source
AI summary
A method for multi-hop forwarding of data packets in vehicular ad-hoc networks is disclosed. Each node knows both its own and the destination's geographical coordinates. The coordinates of the one-hop neighbors are obtained from periodically broadcast Cooperative-Awareness Messages (CAMs). The method comprises the following distributed coordination scheme, executed by each node upon receiving a packet: i) computing the set of candidate forwarders; ii) ranking the candidate forwarders according to an utility metric; iii) forwarding the packet after a period of time proportional to its rank if top-ranked, dropping the packet otherwise. The base utility metric used for ranking forwarders is the inverse of the distance to the destination. Moreover, an extension is disclosed where this metric is replaced by the inverse of the expected number of packet transmissions to reach the destination. The latter metric is calculated based on spatial connectivity information cooperatively collected by nodes in the network.