# US 2019/0174359 A1 · Method and system for frequency allocation in a shared access system

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2019/0174359 A1
- Document ID: US20190174359A1
- Status: Published application
- Kind: A1
- Application number: 15/977,767
- Filed: 2018-05-11
- Published: 2019-06-06
- Earliest claimed: 2017-12-05
- Assignees: CommScope Technologies LLC
- Applicants: CommScope Technologies LLC
- Inventors: Ariful Hannan
- Web page: https://patentgrep.com/patent/US20190174359A1

## CPC

- H04W 16/18: Network planning tools
- H04W 28/20: Negotiating bandwidth
- H04W 16/10: Dynamic resource partitioning
- H04W 16/14: Spectrum sharing arrangements {between different networks}
- H04W 72/0453: Resources in frequency domain, e.g. a carrier in FDMA
- H04W 72/53: based on regulatory allocation policies
- H04W 88/10: adapted for operation in multiple networks, e.g. multi-mode access points
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

A method of allocating bandwidth to co-existence groups of a connected set in a spectrum access system (SAS) is provided. The method comprises: receiving data about co-existence groups in the connected set of the SAS, where such data includes a number of the co-existence groups, G, in the connected set, and a number of radios, ni, in each co-existence group; determining an allocated bandwidth for each of the G co-existence group by subtracting a splitting disincentive bandwidth for a co-existence group from a co-existence incentive bandwidth for the co-existence group; and sending the determined allocated bandwidths for the co-existence groups.

## Claims

### Claim 1

A method of allocating bandwidth to co-existence groups of a connected set in a spectrum access system (SAS), comprising:
receiving data about co-existence groups in the connected set of the SAS, where such data includes a number of the co-existence groups, G, in the connected set, and a number of radios, ni, in each co-existence group;
determining an allocated bandwidth for each of the G co-existence group by subtracting a splitting disincentive bandwidth for a co-existence group from a co-existence incentive bandwidth for the co-existence group; and
sending the determined allocated bandwidths for the co-existence groups.

### Claim 2 (depends on 1)

The method of claim 1, wherein determining the allocated bandwidth for each co-existence group comprises determining:
B
i
=
[
B
G
]
-
[
B
g
⋆
{
2
G
-
n
i
N
}
]
,
where Bi is an allocated bandwidth for an ith co-existence group,
B=Σ1G Bi, where B is a total bandwidth available to all co-existence groups in the connected set,
[
B
G
]
is a co-existence incentive bandwidth,
Bg is a total guard bandwidth,
N is a total number of radios in the connected set, and
[
B
g
⋆
{
2
G
-
n
i
N
}
]
is an ith co-existence group splitting disincentive bandwidth.

### Claim 3 (depends on 1)

The method of claim 1, wherein determining the allocated bandwidth for each co-existence group comprises determining:
B
i
=
{
B
G
⋆
w


1
+
(
B
⋆
A
i
A
)
⋆
w


2
}
-
[
B
g
⋆
{
2
G
-
n
i
N
}
]
,

where Bi is an allocated bandwidth for an ith co-existence group,
B=Σ1G Bi, where B is a total bandwidth available to all co-existence groups in the connected set,
{
B
G
*
w


1
+
(
B
*
A
i
A
)
*
w


2
}
is an ith co-existence group splitting incentive bandwidth,
Ai is a coverage area of the ith coexistence group;
A=Σ1G Ai, where A is a total coverage area of all coexistence groups in the connected set,
w1 is a first weighting factor,
w2 is a second weighting factor,
w1+w2=1,
Bg is a total guard bandwidth,
N is a total number of radios in the connected set, and
[
B
g
*
{
2
G
-
n
i
N
}
]
is an ith co-existence group splitting disincentive bandwidth.

### Claim 4 (depends on 1)

The method of claim 1, wherein if Bi is determined to be less than a minimum bandwidth, Bmin, then Bi=Bmin.

### Claim 5 (depends on 1)

The method of claim 1, wherein receiving data about co-existence groups in the connected set of the SAS comprises dynamically receiving data about co-existence groups as at least one of: at least one co-existence group is added or removed from a connected set, and a number of radios in a co-existence group changes.

### Claim 6 (depends on 1)

The method of claim 1, wherein receiving data about the co-existence groups in the connected set of the SAS comprises receiving data about the co-existence groups in the connected set of the SAS, where at least one co-existence group in the connected set has a radio access technology different from a radio access technology of at least one other co-existence group in the connected set.

### Claim 7

A non-transitory computer readable medium storing a program causing a computer to perform a method to allocate bandwidth to co-existence groups of a connected set in a spectrum access system (SAS), the method comprising:
receiving data about co-existence groups in the connected set of the SAS, where such data includes a number of the co-existence groups, G, in the connected set, and a number of radios, ni, in each co-existence group;
determining an allocated bandwidth for each of the G co-existence group by subtracting a splitting disincentive bandwidth for a co-existence group from a co-existence incentive bandwidth for the co-existence group; and
sending the determined allocated bandwidths for the co-existence groups.

### Claim 8 (depends on 7)

The non-transitory computer readable medium of claim 7, wherein determining the allocated bandwidth for each co-existence group comprises determining:
B
i
=
[
B
G
]
-
[
B
g
*
{
2
G
-
n
i
N
}
]
,
where Bi is an allocated bandwidth for an ith co-existence group,
B=Σ1G Bi, where B is a total bandwidth available to all co-existence groups in the connected set,
[
B
G
]
is a co-existence incentive bandwidth,
Bg is a total guard bandwidth,
N is a total number of radios in the connected set, and
[
B
g
*
{
2
G
-
n
i
N
}
]
is an ith co-existence group splitting disincentive bandwidth.

### Claim 9 (depends on 7)

The non-transitory computer readable medium of claim 7, wherein determining the allocated bandwidth for each co-existence group comprises determining:
B
i
=
{
B
G
*
w


1
+
(
B
*
A
i
A
)
*
w


2
}
-
[
B
g
*
{
2
G
-
n
i
N
}
]
,
where Bi is an allocated bandwidth for an ith co-existence group,
B=Σ1G Bi, where B is a total bandwidth available to all co-existence groups in the connected set,
{
B
G
*
w


1
+
(
B
*
A
i
A
)
*
w


2
}
is an ith co-existence group splitting incentive bandwidth,
Ai is a coverage area of the ith coexistence group;
A=Σ1G Ai, where A is a total coverage area of all coexistence groups in the connected set,
w1 is a first weighting factor,
w2 is a second weighting factor,
w1+w2=1,
Bg is a total guard bandwidth,
N is a total number of radios in the connected set, and
[
B
g
*
{
2
G
-
n
i
N
}
]
is an ith co-existence group splitting disincentive bandwidth.

### Claim 10 (depends on 7)

The non-transitory computer readable medium of claim 7, wherein if Bi is determined to be less than a minimum bandwidth, Bmin, then Bi=Bmin.

### Claim 11 (depends on 7)

The non-transitory computer readable medium of claim 7, wherein receiving data about co-existence groups in the connected set of the SAS comprises dynamically receiving data about co-existence groups as at least one of: at least one co-existence group is added or removed from a connected set, and a number of radios in a co-existence group changes.

### Claim 12 (depends on 7)

The non-transitory computer readable medium of claim 7, wherein receiving data about the co-existence groups in the connected set of the SAS comprises receiving data about the co-existence groups in the connected set of the SAS, where at least one co-existence group in the connected set has a radio access technology different from a radio access technology of at least one other co-existence group in the connected set.

### Claim 13

A spectrum access system (SAS), comprising:
a processing system comprising processing circuitry coupled to memory circuitry;
a communications system coupled to the processing system;
radios coupled to the communications system;
wherein the processing system is configured to allocate bandwidth to co-existence groups of a connected set in the SAS by:
receiving data about co-existence groups in the connected set of the SAS, where such data includes a number of the co-existence groups, G, in the connected set, and a number of radios, ni, in each co-existence group;
determining an allocated bandwidth for each of the G co-existence group by subtracting a splitting disincentive bandwidth for a co-existence group from a co-existence incentive bandwidth for the co-existence group; and
sending the determined allocated bandwidths for the co-existence groups.

### Claim 14 (depends on 13)

The system of claim 13, wherein determining the allocated bandwidth for each co-existence group comprises determining:
B
i
=
[
B
G
]
-
[
B
g
*
{
2
G
-
n
i
N
}
]
,
where Bi is an allocated bandwidth for an ith co-existence group,
B=Σ1G Bi, where B is a total bandwidth available to all co-existence groups in the connected set,
[
B
G
]
is a co-existence incentive bandwidth,
Bg is a total guard bandwidth,
N is a total number of radios in the connected set, and
[
B
g
*
{
2
G
-
n
i
N
}
]
is an ith co-existence group splitting disincentive bandwidth.

### Claim 15 (depends on 13)

The system of claim 13, wherein determining the allocated bandwidth for each co-existence group comprises determining:
B
i
=
{
B
G
*
w


1
+
(
B
*
A
i
A
)
*
w


2
}
-
[
B
g
*
{
2
G
-
n
i
N
}
]
,
wherein determining the allocated bandwidth for each co-existence group comprises determining:
B
i
=
{
B
G
*
w


1
+
(
B
*
A
i
A
)
*
w


2
}
-
[
B
g
*
{
2
G
-
n
i
N
}
]
,
where Bi is an allocated bandwidth for an ith co-existence group,
B=Σ1G Bi, where B is a total bandwidth available to all co-existence groups in the connected set,
{
B
G
*
w


1
+
(
B
*
A
i
A
)
*
w


2
}
is an ith co-existence group splitting incentive bandwidth,
Ai is a coverage area of the ith coexistence group;
A=Σ1G Ai, where A is a total coverage area of all coexistence groups in the connected set,
w1 is a first weighting factor,
w2 is a second weighting factor,
w1+w2=1,
Bg is a total guard bandwidth,
N is a total number of radios in the connected set, and
[
B
g
*
{
2
G
-
n
i
N
}
]
is an ith co-existence group splitting disincentive bandwidth.

### Claim 16 (depends on 13)

The system of claim 13, wherein if Bi is determined to be less than a minimum bandwidth, Bmin, then Bi=Bmin.

### Claim 17 (depends on 13)

The system of claim 13, wherein receiving data about co-existence groups in the connected set of the SAS comprises dynamically receiving data about co-existence groups as at least one of: at least one co-existence group is added or removed from a connected set, and a number of radios in a co-existence group changes.

### Claim 18 (depends on 13)

The system of claim 13, wherein receiving data about the co-existence groups in the connected set of the SAS comprises receiving data about the co-existence groups in the connected set of the SAS, where at least one co-existence group in the connected set has a radio access technology different from a radio access technology of at least one other co-existence group in the connected set.

### Claim 19 (depends on 13)

The system of claim 13, wherein the SAS is coupled to at least one of: at least one environmental sensing capability system, and at least one external database.

### Claim 20 (depends on 13)

The system of claim 13, wherein the SAS is coupled to at least one other SAS.