Collaborative Geolocation Using Observable Sub-Graphs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In large communication networks with numerous nodes, existing methods face challenges in calculating accurate and timely geolocation due to combinatorial problems, congestion, and the need for extensive information exchange, especially when fewer than three nodes have position estimations, leading to imprecise or impossible geolocation solutions, particularly for mobile nodes.
Innovation Solution
The method determines an observable neighborhood by selecting nodes capable of estimating their position and exchanging ranging and position information to geolocate a node, utilizing sub-graphs to execute a geolocation algorithm, ensuring precision and timeliness through a decentralized approach.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If global calculation of geolocation is performed in large networks, then comprehensive position estimation is achieved, but calculation time and information exchange overhead increase significantly
Solution Approach 1:
The patent divides the large network into multiple neighborhoods, each managed by a neighborhood manager. Geolocation calculations are performed locally within each neighborhood rather than globally across the entire network. This segmentation reduces the computational burden and information exchange requirements while maintaining acceptable geolocation accuracy through localized triangulation using only neighboring nodes.
2Loss of information
If information is broadcast to all nodes in the network, then complete geolocation data is available, but network congestion occurs
Solution Approach 1:
The patent implements a distributed architecture where each node maintains only locally relevant geolocation information about its immediate neighbors. Neighborhood managers collect and process data only from nodes within their local neighborhood rather than aggregating data from the entire network. This local quality approach ensures sufficient information completeness for local geolocation while avoiding network congestion from global information broadcasting.
3Reliability
If at least three neighbor nodes with position estimation are required, then geolocation can be performed, but geolocation fails when fewer nodes are available
Solution Approach 1:
The patent merges multiple approaches by combining local neighborhood geolocation with global network coordination. When at least three neighboring nodes with position estimates are available, local triangulation provides reliable geolocation. When fewer than three such nodes exist, the system adapts by utilizing nodes at greater distances within the neighborhood, combining their position information through the neighborhood manager to achieve geolocation coverage in scenarios where traditional methods would fail.
4Productivity
If decentralized geolocation is implemented, then calculation time is reduced, but precision may be compromised compared to global calculation
Solution Approach 1:
The patent implements a dynamic geolocation system where the calculation scope adapts based on available data. The neighborhood manager dynamically adjusts which nodes are included in geolocation calculations based on their position estimates and availability. This dynamic approach enables fast local calculations when sufficient neighboring data exists, while automatically expanding the calculation scope to include more distant nodes when needed, thus maintaining precision without sacrificing the speed benefits of decentralization.
Data Source
AI summary
A method and a device for collaborative geolocation of one or more nodes Mi in a communication network are provided, the nodes inter-exchanging distance and/or position information, comprising at least the following steps determine a first sub-graph V1 of neighbor nodes of a current node A to be geolocated, in N hops, select in the first sub-graph V1, the largest observable sub-graph V3, execute a geolocation algorithm on the nodes of the largest observable sub-graph V3 and determine at least the position of the current node A. An ad-hoc communication network is also provided.


