Steerable Beam Antenna Network Topology Management
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In directional point-to-point computer networks with moving nodes, maintaining connectivity and satisfying provisioned network flows is challenging due to changing node positions and obstructions, which requires continuous updating of links and routing information.
Innovation Solution
A method and system that generate an input graph representing all possible links based on node locations, and then determine a subgraph that conforms to node capabilities and provisioned flows, ensuring that the number of edges does not exceed the maximum degree of each vertex, and assigning links accordingly to maintain network topology and satisfy network flows.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the network continuously updates links and routing information to maintain connectivity with moving nodes, then network reliability is improved, but device complexity and computational overhead increase
Solution Approach 1:
The system performs preliminary actions by predicting future node positions and pre-computing routing paths before connectivity issues arise. The network controller generates an input graph representing possible links for a future time period, and the solver module determines optimal routing in advance, allowing the network to proactively adapt to node movement rather than reactively responding to connectivity failures.
Solution Approach 2:
The system implements dynamic routing by continuously updating the input graph and subgraph based on changing node positions and network conditions. The network controller generates updated routing information as nodes move, and the solver module dynamically determines new paths, allowing the network topology and routing to adapt flexibly to movement while maintaining connectivity.
2Productivity
If the network generates and processes detailed input graphs with all possible links, then routing optimization is improved, but computational time and processing requirements increase
Solution Approach 1:
The system segments the routing problem into distinct components: generating the input graph with possible links, determining the subgraph with selected links, and computing routing paths. This segmentation allows each component to be processed independently and efficiently, reducing overall computational complexity while maintaining routing optimization capabilities.
Solution Approach 2:
The system applies partial action by generating an input graph that includes only relevant possible links within a specified time period and spatial range, rather than considering all theoretically possible connections. The solver module then selects only the necessary links from this reduced set to form the optimal subgraph, reducing computational overhead while maintaining routing efficiency.
Data Source
AI summary
This disclosure provides systems and methods for routing and topology management of computer networks with steerable beam antennas. A network controller can generate an input graph for a first time period. The input graph can have a plurality of vertices each representing a respective moving node and a plurality of edges each representing a possible link between a pair of moving nodes. The input graph also can include corresponding location information for each of the moving nodes during the first time period. A solver module can receive information corresponding to the input graph, a maximum degree for each vertex in the input graph, and a set of provisioned network flows. The solver module can determine a subgraph representing a network topology based on the input graph, the maximum degree for each vertex in the input graph, and the set of provisioned network flows, such that a number of edges associated with each vertex in the subgraph does not exceed the maximum degree for each vertex.