Abstract: A graph of devices is constructed, each network device serving an amount of bandwidth over the network, each vertex of the graph corresponding to a respective one of the network devices, each edge of the graph connecting network devices by interference weight, such that edges between connected network devices using different channels have an interference weight of zero, and edges between connected network devices using the same channel have an interference weight denoting an amount of interference between the connected network devices. A cell utilization of each of the network devices is determined according to an amount of traffic served by the respective network device compared to a total of the amounts of bandwidth for all network devices. A vehicle requesting bandwidth is assigned to the one of the network devices having a smallest product of cell utilization and maximum interference weight edge.

Abstract: A computer is programmed to divide respective data of a first high-resolution map of a first geographic area and a second high-resolution map of a second geographic area into a plurality of respective subsets, assign one of the subsets of each of the first high-resolution map and the second high-resolution map to a first vehicle and a second vehicle, identify respective locations of the first vehicle and the second vehicle and the one of the first high-resolution map or the second high-resolution map that includes the locations of the first and second vehicles, and send, to the first and second vehicles, a map dataset that is a result of applying an XOR function to (1) the subset of the identified high-resolution map including the location of the first vehicle and (2) the subset of the identified high-resolution map including the location of the second vehicle.

Abstract: A computer is programmed to allocate respective connectivity quality data of a geographic area to a first map or a second map. The computer is further programmed to assign one of a plurality of subsets of the first map and one of a plurality of subsets of the second map to a first vehicle, identify respective locations of the first and second vehicles and one of the first or second maps that includes the locations of the first and second vehicles. The computer is further programmed to send, to the first and second vehicles, a map dataset that is a result of applying an XOR function to (1) the subset of the identified map that includes the location of the first vehicle assigned to the first vehicle and (2) the subset of the identified map that includes the location of the second vehicle assigned to the second vehicle.

Abstract: A computer includes a processor and a memory, the memory storing instructions executable by the processor to receive, from each of a plurality of vehicles, a request to exchange data, each request including metadata about the request; sort the vehicles into a plurality of priority sets determined from the metadata; determine a first set of data transfer lines available for vehicles in a first one of the priority sets; select a first optimal data transfer line from the first set of data transfer lines for a first one of the vehicles in the first priority set; and assign the first optimal data transfer line to the first one of the vehicles.

Abstract: A graph of devices is constructed, each device requiring an amount of bandwidth over the network, each vertex of the graph corresponding to a respective one of the devices, each edge of the graph connecting devices according to a weight denoting interference between the connected devices. The vertices of the graph are labeled with labels such that no two vertices sharing the same edge have the same label, each label requiring bandwidth corresponding to the device of that label requiring the most bandwidth. If the sum of the bandwidth required for the labels exceeds the set bandwidth, the edge of the graph having the least interference is deleted, and the perform the construct and label operations are repeated. If the sum of the bandwidth required for the labels is within the set bandwidth, the bandwidth is assigned to the devices.

Abstract: A graph of devices is constructed, each device requiring an amount of bandwidth over the network, each vertex of the graph corresponding to a respective one of the devices, each edge of the graph connecting devices according to a weight denoting interference between the connected devices. The vertices of the graph are labeled with labels such that no two vertices sharing the same edge have the same label, each label requiring bandwidth corresponding to the device of that label requiring the most bandwidth. If the sum of the bandwidth required for the labels exceeds the set bandwidth, the edge of the graph having the least interference is deleted, and the perform the construct and label operations are repeated. If the sum of the bandwidth required for the labels is within the set bandwidth, the bandwidth is assigned to the devices.

Abstract: A computer is programmed to divide respective data of a first high-resolution map of a first geographic area and a second high-resolution map of a second geographic area into a plurality of respective subsets, assign one of the subsets of each of the first high-resolution map and the second high-resolution map to a first vehicle and a second vehicle, identify respective locations of the first vehicle and the second vehicle and the one of the first high-resolution map or the second high-resolution map that includes the locations of the first and second vehicles, and send, to the first and second vehicles, a map dataset that is a result of applying an XOR function to (1) the subset of the identified high-resolution map including the location of the first vehicle and (2) the subset of the identified high-resolution map including the location of the second vehicle.

Abstract: A computer includes a processor and a memory, the memory storing instructions executable by the processor to receive, from each of a plurality of vehicles, a request to exchange data, each request including metadata about the request; sort the vehicles into a plurality of priority sets determined from the metadata; determine a first set of data transfer lines available for vehicles in a first one of the priority sets; select a first optimal data transfer line from the first set of data transfer lines for a first one of the vehicles in the first priority set; and assign the first optimal data transfer line to the first one of the vehicles.