Interconnection Node Path Calculation for Unstable Ad-Hoc Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing communication methods in unstable ad-hoc networks, particularly those operating in the UHF range, face challenges with high computation and signaling loads due to frequent node changes, leading to performance degradation and congestion in VHF networks, which are used for signaling.
Innovation Solution
A communication method that determines a unique identifier for each elementary network and calculates a transmission path through these networks, reducing sensitivity to instability and lowering calculation loads by using a link-state routing protocol between elementary networks, which are updated only when connections change.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If proactive routing protocol is used to determine node topology, then routing paths can be calculated, but computation load and signaling traffic load increase significantly in unstable networks
Solution Approach 1:
The network is segmented into stable elementary networks (groups of nodes) rather than treating individual nodes as the basic unit. This segmentation reduces the number of routing entities from many individual nodes to fewer elementary networks, thereby reducing computation load and signaling traffic while maintaining routing capability.
Solution Approach 2:
Elementary networks act as intermediary entities between individual nodes and the routing protocol. Instead of the routing protocol directly managing individual node connections, it manages connections between elementary networks, which simplifies the routing state and reduces computational complexity in unstable environments.
2Reliability
If proactive routing protocol updates are performed frequently to maintain accurate topology, then routing paths remain valid, but signaling traffic congests VHF networks
Solution Approach 1:
By segmenting the network into elementary networks, the amount of topology information that needs to be exchanged is reduced. Instead of tracking individual node connections, only elementary network connections need to be tracked, significantly reducing signaling traffic volume.
Solution Approach 2:
The granularity of topology tracking is changed from node-level to elementary network-level. This parameter change reduces the volume of topology data that must be exchanged and maintained, thereby reducing signaling traffic while preserving essential routing information.
3Loss of information
If individual node connections are tracked, then complete network topology is known, but the system becomes highly sensitive to node instability
Solution Approach 1:
The network is organized into stable elementary networks that group individual nodes. This segmentation filters out the instability of individual nodes while preserving the stable connectivity patterns between groups, reducing sensitivity to node changes while maintaining sufficient topology information for routing.
Solution Approach 2:
The invention extracts and focuses on the stable aspect of network topology (elementary network connections) while filtering out the unstable aspect (individual node connections). This extraction allows the system to maintain routing capability without being adversely affected by node instability.
Data Source
Figure 1~2
Figure 3
Figure 4
AI summary
The invention relates to a communication method within a communication system (22) comprising several elementary networks (20) and several interconnection nodes (16), each elementary network comprising several radio communication nodes (18), two neighboring elementary networks being connected via one or more interconnection nodes.This process is implemented by each interconnection node and includes: - the determination of a unique identifier for each elementary network to which the interconnection node is connected; - the transmission of each determined identifier to elementary networks other than the identified elementary network; and - the calculation, from said identifiers, of a data packet transmission path (36) between a source node and a destination node, the transmission path passing through one or more elementary networks, the source node and the destination node each being a node among a radiocommunication node and an interconnection node.