Receiver-Based Forwarding Area for Vehicular Ad-Hoc Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing line-forwarding dissemination methods in vehicular ad-hoc networks face challenges in ensuring reliable and efficient data delivery to destinations without up-to-date position information of neighbor nodes, leading to potential packet loss and increased network overhead.
Innovation Solution
A receiver-based method for disseminating data packets in vehicular ad-hoc networks, where each receiving node determines whether to forward the packet based on its position relative to a calculated forwarding area, allowing for efficient and robust forwarding without relying on position information of neighbor nodes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If sender-based forwarding node selection is used, then data packet forwarding can be initiated, but position information of neighbor nodes is required which may not be available or outdated
Solution Approach 1:
The patent inverts the traditional sender-based forwarding selection by implementing receiver-based forwarding node selection. Instead of the sender determining which neighbor should forward the packet, each receiving node autonomously decides whether to forward based on its own position relative to the destination and calculated forwarding area, eliminating the need for the sender to know neighbor positions.
Solution Approach 2:
Each receiving node independently determines whether to forward the data packet by calculating its own position relative to the destination and assessing whether it lies within the forwarding area. This self-service mechanism eliminates dependency on sender knowledge of neighbor positions and enables autonomous forwarding decisions.
2Reliability
If flooding-based area dissemination is used, then data can be delivered to destination area, but network overhead and redundant retransmissions increase
Solution Approach 1:
The patent applies local quality by creating a spatially differentiated forwarding mechanism. The forwarding area is calculated based on the destination position and node density, creating different forwarding behaviors in different spatial regions. Nodes within the forwarding area forward packets, while nodes outside do not, optimizing energy usage locally rather than uniformly across the network.
Solution Approach 2:
The patent dynamically changes the forwarding parameter (whether to forward the packet) based on the node's spatial parameter (position relative to destination and forwarding area). This parameter change approach allows the network to adapt forwarding behavior to local conditions, reducing redundant transmissions while maintaining delivery reliability.
3Loss of energy
If forwarding suppression algorithm is used, then unnecessary network consumption is reduced, but position information of neighbor nodes is still required
Solution Approach 1:
The patent inverts the traditional suppression approach by making the receiving node (not the sender) the decision-maker for forwarding suppression. Each receiving node independently determines whether to forward based on its own position and the calculated forwarding area, eliminating the need for sender knowledge of neighbor positions while still achieving suppression of redundant transmissions.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
The present invention relates to a method and an apparatus for disseminating a data packet in a communication network, in particular a mobile ad-hoc network, comprising a plurality of network nodes. At a first receiving node (F1), a data packet sent from a sending node (S) is received and the position of the receiving node (F1) is determined. According to the invention, a forwarding area (BS1) is determined based on the position of the destination (D); and the data packet is forwarded to one or more neighbor nodes of the first receiving node (F1), if the first receiving node (F1) is located inside the determined forwarding area (BS1).