Ranging Service Discovery in Wireless Clusters
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current wireless communication systems face scalability issues in ranging and service discovery within large clusters of devices, as each new node must perform one-to-one discovery with all existing nodes, making the process time-consuming and impractical.
Innovation Solution
Implementing a ranging service within a cluster where static or semi-static nodes offer ranging services, allowing new nodes to perform ranging with these nodes and enabling other devices to calculate their distance based on the results, thereby reducing the need for individual ranging with each cluster member.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If each new node performs one-to-one discovery with all existing nodes, then complete service discovery is achieved, but the process becomes time-consuming and impractical in large clusters
Solution Approach 1:
The patent segments the cluster into geographic regions and divides service discovery into hierarchical levels. Instead of requiring one-to-one discovery between all nodes, each node performs discovery only within its local region and with regional anchor nodes. This segmentation reduces the discovery complexity from O(n²) to O(r) where r is the number of regions, significantly reducing discovery time while maintaining completeness through hierarchical aggregation.
Solution Approach 2:
The patent introduces geographic anchor nodes as intermediaries that represent entire regions. New nodes perform ranging with these anchor nodes instead of all nodes in the region. The anchor nodes then aggregate service information and perform discovery on behalf of their regions. This intermediary approach reduces the number of direct ranging operations required while preserving complete service discovery capability.
2Measurement precision
If ranging is performed with all cluster members, then accurate distance information is obtained, but the complexity and time required becomes unmanageable in large clusters
Solution Approach 1:
The patent applies local quality by making ranging operations local rather than global. Each node performs ranging only with nodes in its immediate geographic vicinity and with regional anchor nodes. The system accepts that distance information is obtained locally with high precision, while global distance information is derived through triangulation and aggregation. This local approach reduces complexity from requiring all-pairs ranging to only local-neighbor ranging.
Solution Approach 2:
The patent performs preliminary ranging operations during network setup and periodically updates anchor node positions. Geographic information and anchor node locations are pre-established before service discovery begins. This preliminary action eliminates the need for dynamic all-pairs ranging during service discovery, reducing complexity while maintaining measurement accuracy through pre-computed geographic relationships.
Data Source
Figure 1A~1B
Figure 2~4
Figure 5~6
AI summary
An apparatus and a method for determining distances between apparatuses are disclosed. The method in a first apparatus comprises: joining (500) a network comprising a set of apparatuses; setting (502) a first predetermined operating mode for the first apparatus after joining the network; receiving (504) from at least one second apparatus belonging to the net-work a message indicating a support for a ranging service from the second apparatus. As a response to the message, a ranging process with the second apparatus is initiated (506). A second predetermined operating mode is set (508) for the first apparatus after completing the ranging process with the second apparatus network; and a range-limited service discovery frame is broadcast (510).