Positioning Map Using Globally Unique Neighbor Cell Identifiers
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional neighbor cell positioning methods result in large, redundant radio maps due to storing multiple instances of neighbor cell information under different serving cell coverage areas, leading to inefficient storage and transmission, especially in bandwidth-limited and memory-limited environments.
Innovation Solution
A positioning map is generated with globally unique identifiers for neighbor cells, ensuring each neighbor cell has only one instance of information, using locally unique identifiers and estimated locations to define globally unique identifiers, thereby eliminating duplicates and optimizing storage and transmission.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If neighbor cell information is stored hierarchically under each serving cell coverage area, then positioning information can be organized by serving cell, but the positioning map size increases significantly due to redundant storage of neighbor cell information
Solution Approach 1:
The patent merges duplicate neighbor cell information instances into a single shared repository. Instead of storing neighbor cell information separately under each serving cell, the system creates a unified positioning map where neighbor cell data is stored once and referenced by multiple serving cells, eliminating redundancy while maintaining organizational structure
Solution Approach 2:
The patent implements a universal neighbor cell information structure that serves multiple serving cells simultaneously. A single neighbor cell information instance can be associated with and used by multiple serving cells through the globally unique identifier system, making the data structure multi-functional and eliminating the need for duplicate storage
2Ease of operation
If multiple instances of neighbor cell information are stored for the same neighbor cell under different serving cells, then each serving cell has access to its local neighbor information, but transmission bandwidth requirements increase
Solution Approach 1:
The patent combines multiple duplicate neighbor cell information instances into a single shared instance that can be accessed by multiple serving cells. This merging eliminates redundant data transmission while maintaining local access capabilities through the globally unique identifier reference system
Solution Approach 2:
The patent uses reference copying instead of data copying. Instead of transmitting duplicate neighbor cell information to each serving cell, the system transmits references (globally unique identifiers) that point to the single shared neighbor cell information instance, dramatically reducing transmission bandwidth requirements
3Ease of operation
If neighbor cell information is stored in association with each serving cell, then positioning queries can be processed per serving cell, but memory storage requirements on mobile devices increase
Solution Approach 1:
The patent merges duplicate neighbor cell information stored on mobile devices into a single consolidated instance. By using globally unique identifiers to reference shared neighbor cell data, the mobile device can maintain positioning query processing capabilities while storing significantly less data in memory
Data Source
AI summary
Various embodiments relate to the generation and/or use of a positioning map comprising instances of neighbor-cell information that each comprising, are associated with, and/or indexed by a respective globally unique identifier. In an example embodiment, a processor determines a locally unique identifier and an estimated location of an observed neighbor cell. The processor defines a globally unique identifier for the neighbor cell comprising the locally unique identifier and an indication of the estimated location of the neighbor cell. The processor generates a positioning map to include an instance of neighbor-cell information corresponding to the neighbor cell. The instance of neighbor-cell information comprises, is associated with, and/or is indexed by the defined globally unique identifier. The instance of neighbor-cell information may be accessed via an observed locally unique identifier when determining a position estimate for a computing entity that observed a neighbor cell corresponding to the observed locally unique identifier.