Dynamic Network Planning for Mobile Hotspot Latency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for connecting nodes in radio networks, especially directional networking, are inefficient due to high resource consumption and latency, particularly in directional links where many tiles must be searched repeatedly without finding a node, leading to wasted resources and slow discovery processes.
Innovation Solution
A method and system for dynamically planning networks by determining optimal communication links based on predicted node positions, radio link quality, and future movements, using connectivity predictor logics and distributed network planner logics to establish and maintain efficient wireless communication links, reducing resource waste and latency through proactive switching and predictive routing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If omni radio link is used for node discovery, then maximum range coverage is achieved, but substantial size, weight and power (SWAP) resources are consumed
Solution Approach 1:
The system performs preliminary actions by predicting future node positions and pre-establishing communication links before actual connectivity is needed. The connectivity predictor logic forecasts where nodes will be and prepares link establishment in advance, reducing the need for continuous omnidirectional scanning and associated power consumption.
Solution Approach 2:
A gateway node serves as an intermediary between mobile nodes and the network. Instead of mobile nodes performing exhaustive discovery scans, they connect to gateway nodes that facilitate network access and routing, significantly reducing the discovery burden and power consumption for mobile devices.
2Use of energy by moving object
If directional links with narrow beams are used, then resource efficiency is improved, but a very large number of tiles must be searched repeatedly, resulting in substantial resources wasted
Solution Approach 1:
The system performs preliminary actions by predicting future node positions and pre-establishing communication links before actual connectivity is needed. The connectivity predictor logic forecasts where nodes will be and prepares link establishment in advance, reducing the need for continuous omnidirectional scanning and associated power consumption.
Solution Approach 2:
The system implements feedback mechanisms where nodes exchange information about their positions, movements, and connectivity status. This feedback allows the network to optimize tile selection and reduce redundant searches, as nodes can adjust their discovery patterns based on real-time and historical position data from other nodes.
3Loss of energy
If directional links are used for discovery, then resource efficiency is improved, but link establishment latency increases due to repeated tile searching
Solution Approach 1:
The system performs preliminary actions by predicting future node positions and pre-establishing communication links before actual connectivity is needed. The connectivity predictor logic forecasts where nodes will be and prepares link establishment in advance, reducing the need for continuous omnidirectional scanning and associated power consumption.
Solution Approach 2:
The system dynamically adapts the discovery process based on node movement patterns and network conditions. Instead of using static, exhaustive tile scanning, the system adjusts the search strategy in real-time based on predicted node trajectories and historical connectivity data, optimizing both speed and resource efficiency.
Data Source
AI summary
A system and method for dynamically planning a network is presented. One method may begin by determining network parameters for connecting nodes to a network and decision variables associated with radios and/or nodes in the network. Constraints may be established to narrow possible values of the network parameters and/or the decision variables. The constraints may be based on one or more of: values associated with connecting a radio to a node in the network, values associated with connecting two nodes in the network together over a communication link, whether a node can connect to a GIG node and a flow balance in the GIG node. To find possible links in the network that are optimal, the method may minimize an equation based on the network parameters, constraints and decision variables to determine optimal communication links between pairs of nodes in the network, pairs of nodes and radios and/or pairs of radios.


