Variable Time Raster for Mobile Ad-Hoc Network Node Integration
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In mobile ad-hoc networks, existing proactive routing methods require frequent updates of neighbor node information, leading to inefficient data transmission and slow integration of new nodes, as they rely on a compromised time raster for topology knowledge, which is not suitable for rapid node entry or network establishment.
Innovation Solution
A method where a node outside the network transmits a 'hello message' in a variable time raster, initially long to receive acknowledgments, then reduces the time raster to quickly integrate into an existing network, using immediate or delayed acknowledgments to prevent network blockage, and stabilizes at a minimal value once integrated.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If proactive routing methods use a constant time raster to determine neighbor nodes, then topology knowledge is maintained across the network, but the integration speed of new nodes is slow and data transmission efficiency is reduced
Solution Approach 1:
The patent applies dynamics by making the time raster variable rather than constant. Nodes outside the ad-hoc network dynamically adjust their hello message transmission interval: starting with a first time raster when outside the network, and switching to a second (shorter) time raster upon joining the network. This dynamic adjustment allows faster integration of new nodes while maintaining efficient data transmission for established nodes.
Solution Approach 2:
The patent applies local quality by allowing different nodes to use different time raster values based on their network status. Nodes outside the ad-hoc network use a first time raster, while nodes inside the network use a second time raster. This localized differentiation optimizes both integration speed for new nodes and transmission efficiency for existing nodes.
2Speed
If nodes transmit hello messages frequently to ensure rapid network integration, then integration speed improves, but data traffic increases and transmission efficiency decreases
Solution Approach 1:
The patent uses dynamics to adjust the hello message transmission frequency based on network status. Nodes outside the ad-hoc network transmit hello messages at a lower frequency (first time raster), while nodes inside the network transmit at a higher frequency (second time raster). This dynamic frequency adjustment achieves rapid integration for new nodes without generating excessive data traffic.
Solution Approach 2:
The patent changes the time raster parameter based on network membership status. By switching between a first time raster (when outside the network) and a second time raster (when inside the network), the system optimizes the balance between integration speed and data traffic volume.
3Use of energy by moving object
If a node outside the network uses a long time raster to conserve energy, then energy consumption is reduced, but the ability to receive and respond to neighbor node acknowledgments is delayed
Solution Approach 1:
The patent applies dynamics by adjusting the time raster based on whether the node is inside or outside the ad-hoc network. When outside the network, nodes use a first time raster that balances energy consumption with acknowledgment reception. Upon joining the network, nodes switch to a second time raster that ensures rapid acknowledgment processing.
Solution Approach 2:
The patent uses preliminary action by having nodes outside the network transmit hello messages in advance with a first time raster, allowing them to be ready to receive acknowledgments as soon as they enter the network coverage area, thus minimizing the loss of time for network integration.
Data Source
AI summary
In a method for the effective identification of neighboring nodes in a mobile ad-hoc network, every node transmits within a given time raster (ΔT1, ΔT2, ΔT3) a message signalling its presence (1), which is acknowledged through transmission of an acknowledgement message (2) by at least one node which receives the message signalling a presence (1) for the first time. The time raster (ΔT2, ΔT3) within which the message signalling a presence (1) is transmitted is varied by a node which is disposed outside an ad-hoc network.