US 11,909,817 B2
Scalable and secure vehicle to everything communications
Ming Chen, Bedford, MA (US); Pramod Kalyanasundaram, Acton, MA (US); Jianxiu Hao, Acton, MA (US); and Dahai Ren, Lincoln, MA (US)
Assigned to Verizon Patent and Licensing Inc., Basking Ridge, NJ (US)
Filed by Verizon Patent and Licensing Inc., Basking Ridge, NJ (US)
Filed on Aug. 13, 2020, as Appl. No. 16/992,403.
Application 16/992,403 is a continuation of application No. 15/639,257, filed on Jun. 30, 2017, granted, now 10,778,758.
Prior Publication US 2020/0374342 A1, Nov. 26, 2020
Int. Cl. H04L 67/10 (2022.01); H04L 67/104 (2022.01); H04L 67/12 (2022.01); H04W 4/40 (2018.01); H04W 4/46 (2018.01); H04W 4/44 (2018.01); G07C 5/00 (2006.01); H04W 4/02 (2018.01)
CPC H04L 67/1044 (2013.01) [H04L 67/12 (2013.01); H04W 4/40 (2018.02); H04W 4/44 (2018.02); H04W 4/46 (2018.02); G07C 5/008 (2013.01); H04W 4/02 (2013.01)] 20 Claims
OG exemplary drawing
 
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.