Coordinating Server Paging Optimization for LTE Networks

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current paging strategies in LTE networks are inefficient, leading to high load and resource utilization issues due to the need to broadcast paging messages across large areas, including small cells that share the same Location/Area/Tracking codes, resulting in unnecessary network loading.

Innovation Solution

Implementing a method that utilizes a coordinating server to create user page cache tables and neighbor relation tables, allowing for targeted paging by associating user equipment identifiers with their last known locations and forwarding messages efficiently across multi-radio access technologies, thereby reducing the load on the network and optimizing resource use.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Area of stationary object

If paging messages are broadcast across large areas including all cells sharing the same tracking area code, then the paging coverage is improved, but the network load and resource consumption increase

Engineering Contradiction:
Improvepaging coverage areaVSAvoidnumber of paging messages
Core Design Contradiction:
Area of stationary objectVSQuantity of substance

Solution Approach 1:

The patent segments the paging process into two phases: first, the coordinating server queries the user page cache table to identify the last known location and determines a subset of cells to page; second, paging messages are selectively broadcast only to those specific cells rather than all cells in the tracking area. This segmentation reduces unnecessary paging transmissions while maintaining complete coverage capability.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent implements preliminary action by maintaining a user page cache table that stores the last known location of each user equipment before paging is initiated. When a paging request arrives, the system first queries this cache to pre-determine which specific cells should receive paging messages, thereby avoiding blanket broadcasting to all cells in the tracking area and reducing overall network load.

Inventive Principle:
Principle #10Preliminary action

2Reliability

If paging messages are broadcast to all cells in the tracking area, then no user is missed, but radio resources and computing resources are wasted

Engineering Contradiction:
Improvepaging delivery reliabilityVSAvoidradio and computing resources
Core Design Contradiction:
ReliabilityVSLoss of energy

Solution Approach 1:

The patent introduces a coordinating server as an intermediary between the core network and the radio access network. This intermediary queries the user page cache table to determine the optimal subset of cells for paging, acting as a smart router that directs paging messages only where needed. This intermediary layer maintains reliability by ensuring complete tracking area coverage capability while minimizing resource consumption through selective cell targeting.

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The patent changes the parameter of paging scope from 'all cells in tracking area' to 'specific subset of cells determined by last known location'. By dynamically adjusting which cells receive paging messages based on cached location information, the system maintains reliable delivery to the target user while significantly reducing the number of cells that consume radio and computing resources.

Inventive Principle:
Principle #35Parameter changes

3Productivity

If the user page cache table is queried for every paging message, then paging efficiency is improved, but the coordinating server processing load increases

Engineering Contradiction:
Improvepaging efficiencyVSAvoidcoordinating server processing power
Core Design Contradiction:
ProductivityVSPower

Solution Approach 1:

The patent applies partial action by querying the user page cache table selectively - only for users who require paging services - rather than performing exhaustive queries across all users or all cells. The system queries the cache to obtain the last known location and determines a partial subset of cells that need paging, avoiding the excessive processing that would result from broadcasting to all cells in the tracking area.

Inventive Principle:
Principle #16Partial or excessive action

Data Source

PatentUS11785579B2Paging optimization for VeNB
Publication Date: 2023.10.10 PARALLEL WIRELESS INC
  • US11785579B2 patent drawing
  • US11785579B2 patent drawing
  • US11785579B2 patent drawing

AI summary

A method is described, comprising: creating, at a coordinating server, a user page cache table, the user page cache table associates a user equipment (UE) identifier with a last known location of the UE and a virtual base station instance; creating, at the coordinating server, a neighbor relation table, the neighbor relation table associates each cell to neighbor cells; receiving, at the coordinating server from a core network, a paging message for a user equipment (UE), the paging message comprises a tracking area identity (TAI), the UE identifier, and the virtual base station instance; querying, at the coordinating server, in the user page cache table based on the UE identifier received in the paging message to identify the virtual base station instance and the last known location; forwarding, from the coordinating server to the last known location of the UE, the paging message based on the queried last known location.