# US 11,909,817 B2 · Scalable and secure vehicle to everything communications

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

- Number: US 11,909,817 B2
- Document ID: US11909817B2
- Status: Granted
- Kind: B2
- Application number: 16/992,403
- Filed: 2020-08-13
- Published: 2020-11-26
- Granted: 2024-02-20
- Earliest claimed: 2017-06-30
- Assignees: Verizon Patent and Licensing Inc.
- Applicants: Verizon Patent and Licensing Inc.
- Inventors: Ming Chen; Pramod Kalyanasundaram; Jianxiu Hao; Dahai Ren
- Web page: https://patentgrep.com/patent/US11909817B2

## CPC

- H04L 67/1044: {Group management mechanisms (management of multicast group membership H04L12/185; reconfiguring of node membership in a computing system to eliminate errors G06F11/1425)}
- H04L 67/12: specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
- H04L 67/52: specially adapted for the location of the user terminal
- H04W 4/40: for vehicles, e.g. vehicle-to-pedestrians [V2P]
- H04W 4/44: for communication between vehicles and infrastructures, e.g. vehicle-to-cloud [V2C] or vehicle-to-home [V2H]
- H04W 4/46: for vehicle-to-vehicle communication [V2V]
- G07C 5/008: {communicating information to a remotely located station (transmission systems for measured values G08C)}
- H04W 4/02: Services making use of location information
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- G07C: TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE

## Abstract

A method for scalable and secure vehicle to everything communications may include receiving telematics data from a plurality of vehicles and tracking the vehicles within a window which is centered based on the telematics data. The position of the window may be determined based on positions of the vehicles. The method may include dividing the vehicles within the window into partitions having sizes based on a maximum number of vehicles within the partitions, and determining a metric representing a suitability of communications between the vehicles in the window.

## Claims

### Claim 1

A method, comprising:
segregating a plurality of vehicles into clusters based on telematics data received from the vehicles;
tracking the vehicles within a window which is centered based on the telematics data, wherein a position of the window is determined based on positions of the vehicles;
dividing the vehicles within the window into partitions having sizes based on a maximum number of vehicles within the partitions;
dividing the clusters into the partitions comprising binary space partitions of varying sizes;
determining a metric representing a suitability of communications between the vehicles in the window;
generating a quad tree data structure corresponding to the binary space partitions; and
establishing nodes in the quad tree data structure as validator nodes for a block chain.

### Claim 2 (depends on 1)

The method of claim 1, wherein at least one of a size or a shape of the window is based on characteristics of communications between the vehicles, wherein the characteristics comprise at least one of a bandwidth of a communication signal, or whether the communications are for emergency or non-emergency purposes.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
selecting a point as an initial position;
determining the window over a geographic area that is centered on the selected point;
computing a weighted mean based on the positions of vehicles within the window;
shifting the position of the window over the geographic area based on the weighted mean; and
repeating the computing of the weighted mean and the shifting the position of the window until the center of the window converges on the weighted mean.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
determining, for a first vehicle within an associated binary space partition, the metric between the first vehicle and other vehicles in the associated binary space partition;
receiving updated telematics data from the other vehicles;
shifting one or more of the clusters based on the updated telematics data; and
updating the associated binary space partition based on the shifted clusters.

### Claim 5 (depends on 4)

The method of claim 4, wherein shifting one or more of the clusters further comprises:
determining a new position of the one or more of the clusters based on the updated telematics data;
determining if any new vehicles have entered a boundary of the window centered on the shifted clusters based on the updated telematics data; and
determining if any of the other vehicles have exited the boundary of the window centered on the shifted clusters based on the updated telematics data.

### Claim 6 (depends on 4)

The method of claim 4, further comprising:
collecting data exchanged between one or more vehicles corresponding to children of the validator nodes in the quad tree data structure;
packing the collected data into blocks; and
appending the blocks to existing blocks in the block chain.

### Claim 7 (depends on 4)

The method of claim 4, wherein determining the metric representing the suitability of communications further comprises:
searching for matches, within the associated binary space partition, between parameters associated with the first vehicle and parameters associated with the other vehicles.

### Claim 8 (depends on 7)

The method of claim 7, wherein the parameters are stored in different layers, wherein a layer is a two-dimensional data structure having indices corresponding to geographic areas.

### Claim 9 (depends on 7)

The method of claim 7, wherein searching for matches further comprises:
comparing at least one of positions, velocities, or times associated with the positions and velocities of the first vehicle and the other vehicles to ascertain a match for permitting inter-vehicle communications.

### Claim 10 (depends on 9)

The method of claim 9, wherein the comparing further comprises:
altering the comparison based on at least one of class of vehicles in the associated binary space partition, a class of communication associated with the first vehicle, a terrain type or weather conditions within the associated binary space partition.

### Claim 11 (depends on 9)

The method of claim 9, wherein the comparing further comprises:
calculating a distance metric between the first vehicle and the other vehicles based on at least one of the positions, the velocities, or the times associated with the positions and velocities.

### Claim 12

A device, comprising:
an interface configured to communicate over a network;
a memory configured to store instructions; and
a processor, coupled to the interface and the memory, wherein the processor is configured to execute the instructions stored in the memory to:
segregate a plurality of vehicles into clusters based on telematics data received from the vehicles,
track the vehicles within a window which is centered based on the telematics data, wherein a position of the window is determined based on positions of the vehicles,
divide the vehicles within the window into partitions having sizes based on a maximum number of vehicles within the partitions,
divide the clusters into the partitions comprising binary space partitions of varying size,
determine a metric representing a suitability of communications between the vehicles in the window,
generate a quad tree data structure corresponding to the binary space partitions; and
establish nodes in the quad tree data structure as validator nodes for a block chain.

### Claim 13 (depends on 12)

The device of claim 12, wherein at least one of a size or a shape of the window is based on characteristics of communications between the vehicles, wherein the characteristics comprise at least one of a bandwidth of a communications signal, or whether the communications are for emergency or non-emergency purposes.

### Claim 14 (depends on 12)

The device of claim 12, wherein the instructions further cause the processor to:
select a point as an initial position;
determine the window over a geographic area that is centered on the selected point;
compute a weighted mean based on the positions of vehicles within the window;
shift the position of the window over the geographic area based on the weighted mean; and
repeat the computing of the weighted mean and the shifting of the position of the window until the center of the window converges on the weighted mean.

### Claim 15 (depends on 12)

The device of claim 12, wherein the instructions further cause the processor to:
determine, for a first vehicle within an associated binary space partition, the metric between the first vehicle and other vehicles in the associated binary space partitions;
receive updated telematics data from the other vehicles;
shift one or more of the clusters based on the updated telematics data; and
update the associated binary space partition based on the shifted clusters.

### Claim 16 (depends on 15)

The device of claim 15, wherein the instructions to determine the metric representing the suitability of communications further cause the processor to:
search for matches, within the associated binary space partition, between parameters associated with the first vehicle and parameters associated with the other vehicles.

### Claim 17 (depends on 16)

The device of claim 16, wherein the instructions to search for matches further cause the processor to:
compare at least one of positions, velocities, or times associated with the positions and velocities of the first vehicle and the other vehicles to ascertain a match for permitting inter-vehicle communications.

### Claim 18 (depends on 17)

The device of claim 17, wherein the instructions to compare further cause the processor to:
alter the comparison based on at least one of class of vehicles in the associated binary space partition, a class of communication associated with the first vehicle, a terrain type or weather conditions within the associated binary space partition.

### Claim 19 (depends on 17)

The device of claim 17, wherein the instructions to compare further cause the processor to:
calculate a distance metric between the first vehicle and the other vehicles based on at least one of the positions, the velocities, or the times associated with the positions and velocities.

### Claim 20

A non-transitory computer-readable medium comprising instructions, which, when executed by a processor, cause the processor to:
segregate a plurality of vehicles into clusters based on telematics data received from the vehicles;
track the vehicles within a window which is centered based on the telematics data, wherein a position of the window is determined based on positions of the vehicles;
divide the vehicles within the window into partitions having sizes based on a maximum number of vehicles within the partitions; and
divide the clusters into the partitions comprising binary space partitions of varying size,
determine a metric representing a suitability of communications between the vehicles in the window,
generate a quad tree data structure corresponding to the binary space partitions; and
establish nodes in the quad tree data structure as validator nodes for a block chain.