METHOD FOR SCHEDULING PAGING IN TELECOMMUNICATION NETWOK

Abstract

Method for scheduling paging in telecommunication network making the list candidate base station to send paging message. This method based on the Haversine formula to calculate distance between pair of base station from position information (latitude, longitude) and filter by situation: Distance=<Δ*Min (which Δ is 3) to make the list candidate base station for each of base station in list input. This method is useable for the telecommunication system which need to page UE for mobile terminated (MT) service.

Claims

1. Method for scheduling paging in telecommunication network, comprising i) Initialization: Input: information of list base station managed by the system (L), Each of base station includes the information as the below: + Base station identify + Base station position: Latitude, Longitude + Tracking Area ii) Calculate distance and make the list candidate base station Each of base station in the list from step i) is the anchor station to calculate distance and make the list candidate base station of its as the below: + Step 1: filter from L to get all of the base station which have same TA value with anchor station (except anchor station); + Step 2: calculate the distance from the anchor station to each of station in filter list in Step 1 by the Haversine formula + Step 3: Sort all of Distance value from step 2 by order increase and choose Min is minimum Distance value; Set Δ=3, Make the candidate base station of anchor station from filter list of step 1 and distance value of step 2 by filter: The base station in filter of step 1 which have distance value with anchor station=<Δ*Min, iii) When need to page UE: determine the last base station that UE used service and get the list candidate base station of it to send paging message.

Description

BRIEF DESCRIPTIONS AND DRAWINGS

[0022] FIG. 1: Base station and radio connect from UE

[0023] FIG. 2: Tracking Area—Group base station/cells

[0024] FIG. 3: Flow process

DETAIL OF INVENTION

[0025] This method is described as the below: [0026] i) Initialization: [0027] Input: information of list of base stations managed by the system (L). Each of the base stations include the information as the below: [0028] + Base station identify [0029] + Base station position: Latitude, Longitude [0030] + Tracking Area [0031] ii) Calculate distance and make the list of candidate base stations [0032] Each of base station in the list from step i) is the anchor station to calculate distance and make the list candidate base station as the below: [0033] + Step 1: filter from L to get all of the base stations which have same TA value with anchor station (except anchor station). [0034] + Step 2: calculate the distance from the anchor station to each of station in filter list in Step 1 by the Haversine formula:

R=6378137 (unit: m,Earth's Radius) [0035] Lat1: Latitude value of anchor station [0036] Lat2: Latitude value of other station [0037] Lon1: Longitude value of anchor station [0038] Lon2: Longitude value of other station

DeltaLon=(Lon2−Lon1)*π/180

DeltaLat=(Lat2−Lat1)*π/180

Lat1Ra=Lat1*π/180

Lat2Ra=Lat2*π/180

A=(sin(DeltaLat/2)){circumflex over ( )}2+cos(Lat1)*cos(Lat2)*(sin(DeltaLon/2){circumflex over ( )}2

C=2*a tan(sqrt(A),sqrt(1−A))

Distance=R*C [0039] + Step 3: Sort all of Distance value from step 2 by increasing order and choose Min is minimum Distance value. [0040] Set Δ=3. [0041] Make the candidate base station of anchor station from filter list of step 1 and distance value of step 2 by filter: The base station in filter of step 1 which have distance value with anchor station=<Δ*3. [0042] iii) When need to page UE: determine the last base station that UE used service and get the list candidate base station of it to send paging message

Application

[0043] Using in module to Manage ID of Mobility Management Entity—MME.

[0044] Compare between the system using method 2 above and the system apply the inventive method (both systems manage 1 TA including 137 base stations)

TABLE-US-00001 S1 RRC RRC S1 connection Number RRC connection connection S1 connection attempt of paging connect attempt success connection attempt success Method Day message attempt success rate attempt success rate Method Sep. 14, 2020 9054613071 37972976 37956602 0.99956875 37956603 37933729 0.99939736 2 invention Sep. 21, 2020 1273916315 39034512 39017592 0.99956654 39015635 39007389 0.99978865

Effect

[0045] Number of paging messages is reduced (˜86% in application case, other case depending on network planning); [0046] Number of message on radio network is also reduced, contributing to power saving for UE; [0047] PSR is not decreased.

[0048] While a preferred embodiment of the present invention has been shown and described, it will be apparent to those skilled in the art that many changes and modifications may be made without departing from the invention in its broader aspects. The appended claims are therefore intended to cover all such changes and modifications as fall within the true spirit and scope of the invention.