Network Node Deployment Grid Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing method of deploying nodes in a network, which relies on trial and error, is time-consuming and costly, often resulting in over or under estimation of node requirements, especially in irregularly shaped areas, leading to inefficient coverage and connectivity.
Innovation Solution
The use of algorithms such as Minimum Node Connected Coverage (MNCC) and Robust Connected Coverage (RCC) to determine the minimum number of nodes required for coverage and connectivity, with the MNCC algorithm providing one path between nodes and the RCC algorithm offering redundancy, while optimizing node placement within a bounding box and node deployment grid.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If trial and error method is used for node deployment, then node placement can be adjusted to meet network requirements, but deployment time and cost increase significantly
Solution Approach 1:
The patent applies preliminary action by performing a site survey and creating a computational model of the deployment area before actual node installation. The system calculates optimal node locations in advance using algorithms that consider area geometry and network requirements, allowing engineers to prepare deployment plans without trial-and-error adjustments during installation.
Solution Approach 2:
The patent replaces the mechanical trial-and-error adjustment process with a computational system. Instead of physically moving nodes and repeatedly measuring network performance, the system uses algorithms to compute optimal positions and predicts network performance, substituting physical experimentation with mathematical modeling and calculation.
2Reliability
If trial and error method is used for node deployment, then node placement can be adjusted to meet network requirements, but deployment cost increases due to training and experience requirements
Solution Approach 1:
The patent applies self-service by enabling the system to automatically perform the deployment optimization function that previously required expert engineers. The computational model and algorithms independently analyze the deployment area, calculate optimal node positions, and generate deployment plans without requiring human experts to manually adjust node placements through trial and error.
Solution Approach 2:
The patent replaces the need for expert mechanical judgment and experience-based decision-making with an automated computational system. The algorithmic approach substitutes human expertise in predicting node performance with mathematical models that objectively calculate optimal configurations based on area geometry and network requirements.
3Reliability
If more nodes are deployed to ensure coverage, then network coverage improves, but node quantity exceeds minimum requirements and cost increases
Solution Approach 1:
The patent applies parameter changes by using algorithms to precisely determine the minimum number of nodes required based on specific area parameters such as geometry, boundaries, and coverage requirements. Instead of deploying a fixed or excessive number of nodes, the system calculates the exact quantity needed by analyzing area characteristics and adjusting node placement parameters to achieve optimal coverage with minimal nodes.
Data Source
Figure 1A
Figure 1B
Figure 1C
AI summary
Systems, methods, and devices for deploying a network of nodes in an area of interest are described herein. For example, in one or more embodiments, the area of interest can be determined, a bounding box can be created for the area of interest, the bounding box can be filled with a node deployment grid, a determination of whether a node in the node deployment grid is an essential node or an enhancement node can be made, the enhancement node can be removed when it provides duplicate coverage to each portion of the area of interest that is provided coverage by the enhancement node, at least one of the essential node and the enhancement node can be connected to a node in the node deployment grid when they are disconnected from nodes in the node deployment grid with a minimum spanning tree.