IP Library Granted Patent US 10,505,812
Granted Patent B1
US 10,505,812 · App. 15/076,539 · Granted Dec 10, 2019

Method and system for neighbor tier counting in three dimensions

Inventors: Eamonn Gormley (Bothell, WA); Vafa Ghazi-Moghadam (Seattle, WA)
Assignee: NOKIA SOLUTIONS AND NETWORKS OY
H04L41/12G06T17/205H04W24/02H04W36/0061
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,505,812
App. No.
15/076,539
Granted
Dec 10, 2019
Kind
B1
Abstract

Neighbor tier relationships between cells or base stations in a wireless network may be accurately determined by projecting a plurality of points representing the cells or base stations into three dimensional space along with a reference point, creating a plurality of polygons between the plurality of points including the reference point, and removing lines connected to the reference point. Each remaining line represents a first tier neighbor relationship between the two points it connects.

Claims (36)

1. A method for determining relationships in a telecommunications network, the method comprising:

translating a plurality of cell points into three dimensional coordinates by establishing a 3D convex hull that comprises a plurality of triangles that define a surface of the network;

establishing a reference point;

creating a plurality of polygons connecting triangles disposed at the edge of the network to the reference point;

removing edges of polygons that connect to the reference point;

determining a plurality of neighbor tier relationships from remaining polygon edges; and

performing a handover operation or adjusting an antenna based on the plurality of neighbor tier relationships,

wherein creating the plurality of polygons includes establishing a 3D convex hull using the plurality of cell points and the reference point.

2. The method of claim 1 , wherein creating the plurality of polygons includes performing Delaunay triangulation on the plurality of cell points and the reference point.

3. The method of claim 1 , wherein the cell points represent cells of a cellular telecommunications network.

4. The method of claim 3 , wherein a location of the reference point is outside of a space bounded by the cell points.

5. The method of claim 4 , wherein translating the plurality of cell points includes translating the plurality of cell points into points on a surface of a sphere.

6. The method of claim 5 , wherein the reference point is beneath the surface of the sphere.

7. The method of claim 5 , wherein the reference point is the center of the sphere.

8. The method of claim 1 , wherein the cell points represent base stations.

9. The method of claim 1 , wherein translating the plurality of cell points includes converting latitude and longitude coordinates for the plurality of cell points into three dimensional coordinates.

10. The method of claim 1 , wherein the reference point is located under the surface of the earth.

11. A network resource controller in a wireless telecommunications network, the controller comprising:

a memory;

a processor; and

a non-transitory computer readable medium with executable instructions stored thereon which, when executed by the processor, perform the following operations:

translating a plurality of cell points into three dimensional coordinates by establishing a 3D convex hull that comprises a plurality of triangles that define a surface of the network;

establishing a reference point;

creating a plurality of polygons connecting triangles disposed at the edge of the network to the reference point;

removing edges of polygons that connect to the reference point;

determining a plurality of neighbor tier relationships from remaining polygon edges; and

performing a handover operation or adjusting an antenna based on the plurality of neighbor tier relationships.

12. The network resource controller of claim 11 , wherein creating the plurality of polygons includes performing Delaunay triangulation on the plurality of cell points and the reference point.

13. The network resource controller of claim 11 , wherein the cell points represent cells of a cellular telecommunications network.

14. The network resource controller of claim 13 , wherein a location of the reference point is outside of a space bounded by the cell points.

15. The network resource controller of claim 14 , wherein translating the plurality of cell points includes translating the plurality of cell points into points on a surface of a sphere.

16. The network resource controller of claim 15 , wherein the reference point is beneath the surface of the sphere.

17. The network resource controller of claim 15 , wherein the reference point is the center of the sphere.

18. The network resource controller of claim 11 , wherein the cell points represent base stations.

19. The network resource controller of claim 18 , wherein translating the plurality of cell points includes converting latitude and longitude coordinates for the plurality of cell points into three dimensional coordinates.

20. The network resource controller of claim 11 , wherein the reference point is located under the surface of the earth.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 5, 2016
From: GORMLEY, EAMONN; GHAZI-MOGHADAM, VAFA
To: NOKIA SOLUTIONS AND NETWORKS OY
Reel/Frame 038198/0961 →