IP Library Granted Patent US 10,848,981
Granted Patent B2
US 10,848,981 · App. 16/341,125 · Granted Nov 24, 2020

System and method for scalable radio network slicing

Inventors: Hassan Halabian (Ottawa, CA); Afshin Sahabi (Kanata, CA); Mike Skof (Nepean, CA)
Assignee: Telefonaktiebolaget LM Ericsson (publ)
H04W16/18H04W24/10H04W84/18
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,848,981
App. No.
16/341,125
Granted
Nov 24, 2020
Kind
B2
Abstract

A method and node are disclosed. According to one aspect, a method includes receiving scan reports from a plurality of access points, AP, and partitioning a wireless communication network into clusters of APs for which scan reports are received, the APs being partitioned into clusters based on neighbor relationships, there being a first limit to a number of APs that can be in a cluster. In some embodiments, the node is a manager node such as a self-organizing network (SON) manager node.

Claims (25)

1. A method for network slicing for use in node, the method comprising:

receiving scan reports from a plurality of access points (APs);

partitioning a wireless communication network into clusters of APs for which scan reports are received, the APs being partitioned into clusters based on neighbor relationships, there being a first limit to a number of APs that can be in a cluster; and

deleting an AP if the node does not receive a scan report from the deleted AP for a specified period of time.

2. The method of claim 1 , further comprising segmenting the clusters into segments, the APs in a segment being connected, there being a second limit to a number of APs that can be in a segment.

3. The method of claim 1 , further comprising adding a new AP to a cluster based on whether the cluster has APs that are neighbors of the new AP and whether the first limit would be exceeded if the new AP is added.

4. The method of claim 1 , further comprising merging two clusters when one cluster has a number of APs that falls below a minimum threshold.

5. The method of claim 4 , wherein the merging occurs if and only if merging the two clusters will not result in a cluster having a number of APs that exceeds the first limit.

6. The method of claim 1 , wherein the node is a self-organizing network (SON) manager node.

7. A slicer in a node, the slicer comprising:

a processing circuitry configured to:

store a list of access points (APs) organized by membership in a cluster and a segment;

receive scan reports from a plurality of access points (APs);

partition a wireless communication network into clusters of APs for which scan reports are received, the APs being grouped into clusters based on neighbor relationships, there being a first limit to a number of APs that can be in the cluster; and

delete an AP if the node does not receive a scan report from the deleted AP for a specified period of time.

8. The slicer of claim 7 , wherein the processing circuitry is further configured to segment the clusters into segments, the APs in a segment being connected, there being a second limit to a number of APs that can be in a segment.

9. The slicer of claim 7 , wherein the processing circuitry is further configured to add a new AP to a cluster based on whether the cluster has APs that are neighbors of the new AP and whether the first limit would be exceeded if the new AP is added.

10. The slicer of claim 7 , wherein the processing circuitry is further configured to merge two clusters when one cluster has a number of APs that falls below a minimum threshold.

11. The slicer of claim 10 , wherein the merging occurs if and only if merging the two clusters will not result in a cluster having a number of APs that exceeds the first limit.

12. The slicer of claim 7 , wherein the node is a self-organizing network (SON) manager node.

13. A slicer in a node, the slicer comprising:

a processor configured to:

receive scan reports from a plurality of access points (APs);

partition a wireless communication network into clusters of APs for which scan reports are received, the APs being grouped into clusters based on neighbor relationships, there being a first limit to a number of APs that can be in a cluster; and

delete an AP if the node does not receive a scan report from the deleted AP for a specified period of time.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 11, 2019
From: HALABIAN, HASSAN; SAHABI, AFSHIN; SKOF, MIKE
To: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
Reel/Frame 048856/0691 →
Continuity (2)
Provisional Application 62411339 · Oct 21, 2016
Related Publication 20190320325A1 · Oct 17, 2019