Communication System Node Relocation for Path Redundancy
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing communication systems using the 60-GHz band for high-speed wireless transmission face interruptions due to obstacles, and redundant transmission across multiple Personal Area Networks (PANs) struggles with maintaining reliable communication paths, leading to decreased node reliability and increased susceptibility to interruptions.
Innovation Solution
A communication system where multiple nodes under the supervision of a control station perform redundant data transmission, with a mechanism to move nodes between networks to ensure that each network maintains a sufficient number of high-quality communication paths, thereby enhancing reliability and resistance to interruptions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If redundant transmission is performed across multiple PANs, then communication reliability is improved, but the number of nodes that can communicate using a single PAN decreases
Solution Approach 1:
The patent implements dynamic node allocation where nodes can be moved between different PANs based on real-time communication quality assessment. The control station continuously monitors the number of active paths for each node and dynamically reassigns nodes to maintain optimal distribution across PANs, resolving the contradiction between maintaining reliability through redundancy and preserving sufficient nodes per PAN.
Solution Approach 2:
The system changes the allocation parameter of nodes between different PANs based on communication quality metrics. By monitoring active path counts and comparing them against threshold values, the system adjusts node distribution parameters to ensure each PAN maintains enough nodes for reliable redundant transmission while achieving cross-PAN redundancy.
2Reliability
If nodes are densely allocated to maintain sufficient communication paths, then resistance to interruption improves, but the complexity of node grouping and path management increases
Solution Approach 1:
The control station implements a feedback mechanism that continuously monitors communication path quality and active path counts for each node. Based on this feedback, the system automatically determines when and where to move nodes between PANs, simplifying the management complexity while maintaining sufficient node density for interruption resistance. The feedback loop ensures optimal allocation without manual intervention.
Solution Approach 2:
The system enables self-service node allocation where the control station autonomously monitors communication quality metrics and performs node reassignment without external intervention. The automatic monitoring of active paths and threshold comparisons allow the system to self-regulate node distribution, reducing management complexity while maintaining reliability.
3Use of energy by moving object
If the number of relayed transmissions per node decreases, then node processing load reduces, but communication path reliability weakens
Solution Approach 1:
The patent segments the network into multiple PANs with distributed node allocation, where each node participates in relayed transmission within its assigned PAN. By creating multiple independent communication paths across different PANs, the system reduces the relay burden on individual nodes while maintaining overall path reliability through diverse routing options. Each node handles fewer relays locally, but the aggregate system maintains high reliability.
Data Source
AI summary
A plurality of control stations supervise respective ones of different networks and multiple nodes belonging to each network perform redundant transmission of data. The number of communication paths for which the qualities of communication links between the nodes belonging to the network are greater than a threshold value are calculated as the number of active paths of each of the nodes belonging to each network, and it is determined whether the calculated number of active paths of each node in each network is equal to or greater than a predetermined redundancy. In case of existence of a node for which the number of active paths is less than the predetermined redundancy, then the node is moved between the network in which the node exists and another network.