Automated, dynamic minimization of inter-cell site interference in CDMA networks

US10887040B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-10887040-B2
Application numberUS-201816218110-A
CountryUS
Kind codeB2
Filing dateDec 12, 2018
Priority dateMar 14, 2014
Publication dateJan 5, 2021
Grant dateJan 5, 2021

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Methods and apparatus for allocating scrambling codes to cells of a wireless network. In an example method, current scrambling code allocation information for a plurality of cells and network configuration information for a radio access network are received. A reallocation of scrambling codes to the plurality of cells is computed, based on the current scrambling code allocation information and the network configuration information, using a metaheuristic algorithm. A change in scrambling code for at least one of the plurality of cells is then triggered, based on the computed reallocation. In some embodiments, the metaheuristic algorithm is based on an objective function that comprises a summation of interference metrics for each of the plurality of cells, wherein the interference metrics depend on scrambling code allocations to the plurality of cells. In some embodiments, a simulated annealing metaheuristic is used.

First claim

Opening claim text (preview).

What is claimed is: 1. A method, in a network management node operatively connected to a radio access network that comprises a plurality of cells, for allocating scrambling codes to the cells, the method comprising: receiving current scrambling code allocation information for the plurality of cells and receiving network configuration information for the radio access network; computing a reallocation of scrambling codes to the plurality of cells, based on the current scrambling code allocation information and the network configuration information, using a metaheuristic algorithm, wherein the metaheuristic algorithm is based on an objective function that comprises a summation of interference metrics for each of the plurality of cells and wherein the interference metrics depend on scrambling code allocations to the plurality of cells; and triggering a change in scrambling code for at least one of the plurality of cells, based on the computed reallocation. 2. The method of claim 1 , wherein the metaheuristic algorithm employs a simulated annealing metaheuristic. 3. The method of claim 1 , wherein a predetermined number of scrambling codes are changed from each iteration of the metaheuristic algorithm to the next. 4. The method of claim 3 , wherein the predetermined number is 1. 5. The method of claim 1 , wherein scrambling code changes from each iteration of the metaheuristic algorithm to the next are tested to ensure that there are no duplicate scrambling codes among neighboring cells. 6. The method of claim 5 , further comprising determining neighbor cells for at least some of the plurality of cells based at least in part on neighbor cell information obtained from one or more radio network controllers. 7. The method of claim 5 , further comprising determining neighbor cells for at least some of the plurality of cells based at least in part on geo-positioning information for at least some of the plurality of cells. 8. The method of claim 1 , further comprising, after the reallocation has been computed, testing the computed reallocation to ensure that there are no duplicate scrambling codes among neighboring cells. 9. The method of claim 1 , wherein at least the computing operation of claim 1 is repeated at pre-determined intervals. 10. The method of claim 1 , wherein at least the computing and triggering operations are initiated in response to a problem detection in the radio access network. 11. The method of claim 1 , wherein at least the computing and triggering operations are initiated in response to an addition of a new cell to the radio access network. 12. A network management node, comprising: communications interface circuitry configured to communicate with one or more nodes in a radio access network, and a processing circuit configured to control the communications interface circuitry and to: receive current scrambling code allocation information for the plurality of cells and receive network configuration information for the radio access network; compute a reallocation of scrambling codes to the plurality of cells, based on the current scrambling code allocation information and the network configuration information, using a metaheuristic algorithm, wherein the metaheuristic algorithm is based on an objective function that comprises a summation of interference metrics for each of the plurality of cells and wherein the interference metrics depend on scrambling code allocations to the plurality of cells; and trigger a change in scrambling code for at least one of the plurality of cells, based on the computed reallocation. 13. The network management node of claim 12 , wherein the metaheuristic algorithm employs a simulated annealing metaheuristic. 14. The network management node of claim 12 , wherein the processing circuit is configured to change a predetermined number of scrambling codes from each iteration of the metaheuristic algorithm to the next. 15. The network management node of claim 12 , wherein the processing circuit is configured to test scrambling code changes from each iteration of the metaheuristic algorithm to the next to ensure that there are no duplicate scrambling codes among neighboring cells. 16. The network management node of claim 15 , wherein the processing circuit is further configured to determine neighbor cells for at least some of the plurality of cells based at least in part on neighbor cell information obtained from one or more radio network controllers (RNCs). 17. The network management node of claim 15 , wherein the processing circuit is further configured to determine neighbor cells for at least some of the plurality of cells based at least in part on geo-positioning information for at least some of the plurality of cells. 18. The network management node of claim 12 , wherein the processing circuit is further configured to test, after the reallocation has been computed, the computed reallocation, to ensure that there are no duplicate scrambling codes among neighboring cells. 19. A network management node, comprising: communications interface circuitry configured to communicate with one or more nodes in a radio access network, and a processing circuit configured to control the communications interface circuitry and to: receive current scrambling code allocation information for the plurality of cells and receive network configuration information for the radio access network; compute a reallocation of scrambling codes to the plurality of cells, based on the current scrambling code allocation information and the network configuration information, using a metaheuristic algorithm; test the computed reallocation, after the reallocation has been computed, to ensure that there are no duplicate scrambling codes among neighboring cells; and trigger a change in scrambling code for at least one of the plurality of cells, based on the computed reallocation.

Assignees

Inventors

Classifications

  • using the level of interference · CPC title

  • Configuration management of networks or network elements (address allocation H04L61/50) · CPC title

  • H04J13/16Primary

    Code allocation · CPC title

  • Access point devices · CPC title

  • of intercell interference · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US10887040B2 cover?
Methods and apparatus for allocating scrambling codes to cells of a wireless network. In an example method, current scrambling code allocation information for a plurality of cells and network configuration information for a radio access network are received. A reallocation of scrambling codes to the plurality of cells is computed, based on the current scrambling code allocation information and …
Who is the assignee on this patent?
Ericsson Telefon Ab L M
What technology area does this patent fall under?
Primary CPC classification H04J13/16. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue Jan 05 2021 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 3 related publications on this page (citations in our corpus or others sharing the same primary CPC).