# US 2021/0176594 A1 · Adaptive Geolocation Quality Optimization In Wireless Networks

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

- Number: US 2021/0176594 A1
- Document ID: US20210176594A1
- Status: Published application
- Kind: A1
- Application number: 16/762,731
- Filed: 2017-11-09
- Published: 2021-06-10
- Earliest claimed: 2017-11-09
- Assignees: Everynet BV
- Applicants: Everynet BV
- Inventors: Vitaly Kleban; Sergey Velder
- Web page: https://patentgrep.com/patent/US20210176594A1

## CPC

- H04W 4/02: Services making use of location information
- H04W 4/024: Guidance services
- G01S 7/40: Means for monitoring or calibrating
- G01S 13/34: using transmission of continuous, frequency-modulated waves while heterodyning the received signal, or a signal derived therefrom, with a locally-generated signal related to the contemporaneously transmitted signal
- G06F 17/16: Matrix or vector computation {, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization (matrix transposition G06F7/78)}
- H04W 72/21: in the uplink direction of a wireless link, i.e. towards the network
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- G01S: RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

The invention relates to the field of geolocation. In particular the invention relates to a method for geolocation of at least one wireless device logged in a network, wherein the said network comprises a number of wireless devices and a number of network nodes, wherein each network node is realized as a gateway and wherein each wireless device of the network interacts with at least one gateway.

## Claims

### Claim 1

A method for geolocation of at least one wireless device logged in in a network, wherein the network comprises a number of wireless devices and a number of network nodes, wherein each network node is realized as a gateway and wherein each wireless device of the network interacts with at least one gateway, including following steps:
(A) Initiating a geolocation procedure by one of the wireless devices of the network;
(B) Determining a moment of time T0 within a specified time period, at which moment of time T0 a first uplink message is to be sent to at least one gateway from the wireless device;
(C) Choosing a first frequency channel fx from at least one pre-determined frequency band using a random choice of the first frequency channel fx, wherein the random choice obeys the uniform probability distribution P(X), which first frequency channel is to be used to send the first uplink message to the at least one gateway from the wireless device;
(D) Sending the first uplink message to the at least one gateway by means of the wireless device at the moment of time T0 and at the first frequency channel fX;
(E) Receiving a downlink message from the at least one gateway by the wireless device, wherein the downlink message comprises relevant network parameters Z;
(F) Determining by the wireless device of a pre-specified time delay dT, after which a second uplink message is to be sent to the at least one gateway from the wireless device after the wireless device has received the downlink message;
(G) Specifying a conditional probability distribution PZ(Y|X) for choosing a second frequency channel fY, which second frequency channel fY is to be used to send the second uplink message to the at least one gateway from the wireless device, wherein the specification is made depending on the relevant network parameters Z and the first frequency channel fx;
(H) Choosing a second frequency channel fY according to the conditional probability distribution PZ(Y|X);
(I) Sending the second uplink message to the least one gateway by means of the wireless device after the time delay dT and at the second frequency channel fy;
(J) Locating the wireless device based on the first and the second uplink messages, which first and second uplink messages were sent at the first frequency channel fx and the second frequency channel fy.

### Claim 2 (depends on 1)

The method according to claim 1, further comprising the following step;
(K) If there is more than one wireless device logged in into the network, repeating Steps B to J for other wireless devices logged in into the network.

### Claim 3 (depends on 1)

The method according to claim 1, wherein, in case that Step G has been already performed at least once, the conditional probability distribution PZ(Y|X) in Step G also depends on data obtained from the previous iterations.

### Claim 4 (depends on 1)

The method according to claim 1,
wherein there is a finite number of the frequencies or frequency channels allowed for the transmission of the first and the second uplink messages and the downlink message and these frequencies or frequency channels are ordered in a list,
wherein the conditional probability distribution PZ(Y|X) in Step G is realized as a stochastic matrix DZ with rows and columns, identified by row and column numbers, wherein row and column numbers of the stochastic matrix correspond to the numbers of the first and the second frequency channels in the list of the specified frequency channels respectively.

### Claim 5 (depends on 4)

The method according to claim 4, wherein the conditional probability distribution PZ(Y|X) is degenerate and is specified by a mapping on the set of the frequency channels.

### Claim 6 (depends on 4)

The method according to claim 4, wherein the relevant network parameters Z comprise a number, specifying a total number N of the wireless devices logged in into the network and the specification of the stochastic matrix DN in Step G is performed by means of optimization of a first geolocation quality function (F1) of the network, while keeping values of a second geolocation quality function (F2) above a predetermined value.

### Claim 7 (depends on 6)

The method according to claim 6, wherein the optimization of the first geolocation quality function (F1) of the network is performed within a first sub-class D1N of stochastic matrices of the form
D

1
N
=
(
0
D
1
D
1
′
0
)
where 0 is a zero matrix, D1 and D1′ are permutation matrices.

### Claim 8 (depends on 6)

The method according to claim 6, wherein the optimization of the first geolocation quality function (F1) of the network is performed within a second sub-class D2N of stochastic matrices of the form
D

2
N
=
(
0
D
2
D
2
′
0
)
where 0 is a zero matrix, D2 is a matrix consisting only of zeros and ones, whereas the ones are arranged into vectors, wherein the first vector is located in the top right corner of the matrix D2 and (i+1)th vector is diagonally adjacent to the last element of the ith vector, wherein D2′ is achieved from the matrix D2 by rotating the matrix D2 by 180° around its center.

### Claim 9 (depends on 8)

The Method according to claim 8, wherein the matrix D2 is a matrix from a certain sub-class of “0-1 reverse vertical line block matrices” in order to optimize the first geolocation quality function (F1) efficiently.

### Claim 10 (depends on 9)

The method according to claim 9, wherein the length of each vector except the first one and the last one is the same and is equal to L, and the length of the last block preferably does not exceed this length L.

### Claim 11 (depends on 8)

The method according to claim 8, wherein the length of each vector except the first block is equal to 1.

### Claim 12 (depends on 6)

The method according to claim 6, wherein the optimization of the first geolocation quality function (F1) of the network is performed within a third sub-class D3N of stochastic matrices of the form
D

3
N
=
(
0
D
3
D
3
′
0
)
where 0 is a zero matrix, D3 is a matrix of a matrix designed such that its non-zero entries are arranged into vectors, wherein the first vector is located in one of the corners of the matrix D3 and (i+1)th vector is diagonally adjacent or laterally adjacent to the last or to the first element of the ith vector, wherein D3′ is matrix D3 after a 180° rotation around its center.

### Claim 13 (depends on 12)

The method according to claim 12, wherein the relevant network parameters Z further comprise message capacities {C1, C2, . . . }, wherein each message capacity Ci is assigned to each second frequency channel if and the optimization of the first geolocation quality function (F1) of the network within the third sub-class D3N of stochastic matrices is performed among stochastic matrices computed on the base of the message capacities of the channels {C1, C2, . . . }.

### Claim 14 (depends on 13)

The method according to claim 13, wherein performing the optimization of the first geolocation quality function (F1) of the network within the third sub-class D3N of stochastic matrices in terms of the message capacities of the channels {C1, C2, . . . } comprises the following steps:
Determining the message capacities of the channels {C1, C2, . . . } that optimize the first geolocation function, while keeping values of a second geolocation quality function (F2) above a predetermined value;
Determining matrix entries of the matrix of a snake-like type in terms of the message capacities {C1, C2, . . . } that optimize the first geolocation function.

### Claim 15 (depends on 14)

The method according to claim 14, wherein determining the message capacities of the channels {C1, C2, . . . } that optimize the first geolocation function comprises the following steps:
Step 1: Choosing a second frequency channel fi;
Step 2: Determining a number Xi of the second uplink messages, such that distributing 2Xi messages over the frequency channels with message capacities Xi for the ith and Xi for the (C+1−i)th frequency channel and 0 for all other frequency channels gives the optimal value of the first geolocation quality function (F1) of the network;
Step 3: Choosing another second frequency channel fj;
Step 4: Determining a number Xj of the second uplink messages, such that distributing 2(Xi+Xj) messages over the frequency channels with message capacities Xi for the ith and for the (C+1−i)th frequency channels, Xj for the jth and for the (C+1−j)th frequency channels and 0 for all other frequency channels gives the optimal value of the first geolocation quality function (F1) of the network, while keeping values of a second geolocation quality function (F2) above a predetermined value;
Step 5: Performing this procedure mutatis mutandis for all remaining second frequency channels.

### Claim 16 (depends on 5)

The method according to claim 5, wherein
the network comprises N wireless devices,
the list of the specified frequency channels includes C=8 channels,
a time, which is needed to perform Steps B to J, is approximately 3600 times larger than a time of sending any uplink message in the network, and
the second geolocation quality function (F2) is designed as a probability for any wireless device to successfully deliver the first and the second uplink message, which is preferably at least 10%.

### Claim 17 (depends on 16)

The method according to claim 16, wherein the time, which is needed to perform Steps B to J, is about 30 minutes and the time of sending any uplink message in the network is about 0.5 seconds.

### Claim 18 (depends on 16)

The method according to claim 16, wherein the stochastic matrix is an 8-by-8 right stochastic matrix, wherein
if N=1, . . . 447, the right stochastic matrix is designed as:
(
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
1
1
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
)
if N=448, . . . 2100, the right stochastic matrix is designed as:
(
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
1
0
0
0
0
0
0
1
0
0
1
0
0
0
0
0
0
1
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
)
if N=2101, . . . 10824, the right stochastic matrix is designed as:
(
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
)
.

### Claim 19 (depends on 6)

The method according to claim 6, wherein the optimization of the first geolocation quality function of the network is performed within a sub-class EN of stochastic matrices of the form
E
N
=
(
0
E
E
′
0
)
where 0 is a zero matrix.

### Claim 20 (depends on 4)

A according to claim 4, wherein the stochastic matrix representing the conditional probability distribution PZ(Y|X) is chosen so that the position of the maximum element in each row of this matrix coincides with the position of the maximum element in the corresponding row of the matrix.

### Claim 21

A wireless device with a computer-readable storage medium,
wherein the computer-readable storage medium comprises a conditional probability distribution PZ(Y|X),
wherein the wireless device is adapted to send a first and a second uplink message for geolocation to at least one gateway, to receive a downlink message, which downlink message includes relevant network parameters, and to choose a first frequency channel for sending the first uplink message according to a uniform probability distribution and to choose a second frequency channel for sending the second uplink message according to the conditional probability distribution PZ(Y|X).
