Ad-Hoc Network Packet Broadcasting Relay Selection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Mobile ad-hoc networks, particularly vehicular ad-hoc networks, face challenges with data collisions, interference, and transmission delays due to uncoordinated communication, which hinder efficient broadcasting of messages such as traffic advisories and safety communications in environments with high mobility.
Innovation Solution
A method for broadcasting data packets in mobile ad-hoc networks that involves selecting relay nodes based on distance and direction of movement, using a wait timer to minimize interference, and storing node locations and positions to optimize message relaying, ensuring efficient message dissemination without flooding the airwaves.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If uncoordinated communications are transmitted by simply installing wireless antenna, then node deployment is easy, but data collisions and interference occur resulting in significant transmission delay
Solution Approach 1:
The patent applies preliminary action by having nodes prepare relay information and wait for appropriate transmission opportunities before actually relaying data. Nodes pre-calculate relay paths and maintain neighbor information, then execute coordinated relaying when conditions are favorable, avoiding immediate collisions while maintaining mobility adaptability.
Solution Approach 2:
The patent implements feedback mechanisms where nodes transmit relay information messages that include their current status, location, and relay capabilities. Other nodes use this feedback information to make informed decisions about routing and relaying, dynamically adjusting transmission based on real-time network conditions and node movements.
2Ease of operation
If uncoordinated data transmission is used, then node operation is simple, but airwaves are flooded with messages causing radio bandwidth jamming
Solution Approach 1:
The patent segments the broadcasting process by introducing intermediate relay nodes that divide the transmission path into multiple hops. Instead of all nodes transmitting simultaneously across the entire network, data is segmented and relayed through selected intermediate nodes, reducing the volume of simultaneous transmissions and preventing bandwidth flooding.
Solution Approach 2:
The patent uses relay nodes as intermediaries between source and destination nodes. These intermediary nodes receive data from one node and forward it to another, acting as mediators that coordinate transmission timing and routing. This intermediary layer prevents direct simultaneous transmissions that would cause bandwidth jamming.
3Device complexity
If all messages propagate in all directions without consideration of desired transmission direction, then broadcasting is simple, but interference increases significantly
Solution Approach 1:
The patent applies local quality by having each relay node determine the appropriate transmission direction based on its local context - specifically, the location of the source node and the desired destination. Each node calculates the optimal direction to forward data toward the destination rather than broadcasting omnidirectionally, reducing interference in unwanted directions while maintaining simple implementation at each node.
4Adaptability or versatility
If high mobility of nodes is present, then network adaptability is improved, but frequent neighbor changes make a priori configuration into groups problematic
Solution Approach 1:
The patent implements dynamics by making the relay configuration adaptive rather than static. Nodes dynamically determine relay relationships based on current location information and network conditions, rather than relying on pre-configured groups. The system continuously updates neighbor information and relay paths as nodes move, maintaining adaptability while avoiding the complexity of managing dynamic group reconfiguration.
Data Source
Figure 1
Figure 2A~2B
Figure 3A~3B
AI summary
A method for distributing a packet to a plurality of moving nodes comprising receiving a packet containing at least a message, a sender identifier, a location of a sender, an identifier for a relay node and distance from the sender and the relay node, determining if a node receiving the packet is the relay node and immediately distributing the packet to a plurality of moving nodes if the receiving node is the relay node. If the receiving node is not the relay node, the method further comprises steps of waiting a set period of time, determining if a packet is received from a different sender containing the same message, within the period of time and distributing the packet to a plurality of moving nodes if a packet containing the same message is not received within the period of time. The distributed packet includes an identifier for a successive relay node.