Mobile Terminal Location Paging Area Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional registration and paging operations in mobile communication networks consume significant wireless bandwidth, and existing paging approaches are not effective for a wide variety of location distribution patterns and network architectures, leading to suboptimal bandwidth usage and delays.
Innovation Solution
A system and method that forms and polls paging areas based on location probabilities and a predetermined delay bound, arranging cells in non-ascending order of probability to reduce average paging costs while maintaining delays within a predetermined limit, thereby conserving wireless bandwidth and ensuring Quality-of-Service requirements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of energy
If cells are divided into smaller location areas to reduce paging costs, then paging costs decrease, but registration costs increase as terminals register at every cell boundary crossing
Solution Approach 1:
The patent divides location areas into multiple paging areas, each containing a subset of cells. This segmentation allows the system to page only within specific paging areas rather than broadcasting to all cells in a large location area, reducing paging costs while maintaining manageable registration operations.
Solution Approach 2:
The patent assigns different paging area configurations to different location areas based on their specific characteristics such as cell density, terminal distribution patterns, and traffic patterns. This localized optimization allows each location area to balance registration and paging costs according to its unique requirements rather than applying a uniform approach.
2Productivity
If location areas are made larger to reduce registration operations, then registration costs decrease, but paging costs increase as more cells must be polled
Solution Approach 1:
By segmenting large location areas into multiple smaller paging areas, the system can maintain large location areas for reducing registration operations while simultaneously limiting paging scope to smaller paging areas, thus avoiding the increased paging costs that would result from polling all cells in a large location area.
Solution Approach 2:
The patent introduces a new organizational dimension by creating paging areas within location areas, adding a hierarchical layer to the traditional flat structure. This dimensional change allows independent optimization of registration (at the location area level) and paging (at the paging area level) without the direct tradeoff that exists in the conventional single-level structure.
3Loss of energy
If sequential polling of cells is used to reduce paging costs, then average paging costs decrease, but delays increase until all cells are polled
Solution Approach 1:
The patent pre-calculates and stores optimal polling sequences for paging areas based on historical terminal distribution data and location probabilities. This preliminary preparation allows the system to immediately execute efficient polling sequences without real-time computation delays, reducing both paging costs and delays by polling the most likely cells first.
Solution Approach 2:
The system continuously monitors terminal location patterns and updates polling sequences based on observed behavior. This feedback mechanism allows the polling order to adapt to changing patterns, ensuring that high-probability cells are polled first while maintaining low paging costs even as terminal distribution patterns evolve over time.
Data Source
AI summary
In one of many possible embodiments, a method of locating a mobile terminal within a location area of a mobile communication network is provided. In the method, a threshold is set by calculating a sum of all location probabilities in the location area and dividing the sum by a maximum number of polling cycles allowed before the mobile terminal is located. Cells in the location area are arranged in non-ascending order according to their location probabilities. Multiple paging areas are formed one at a time by starting with a first cell not used in a previous paging area, grouping cells in order, and stopping when the total of location probabilities reaches the threshold or when no more ungrouped cells exist within the location area.