A vehicle identity rapid verification method and system with automatic identification code length expansion and contraction

Abstract

The present application relates to a kind of vehicle identity quick verification method and system of identification code length automatic expansion and contraction, comprising: constructing vehicle identity verification table, including multiple space blocks, each space block includes multiple data grid;The identification code of each vehicle of interest is stored in identity verification table;According to the position of the corresponding candidate space block calculated according to the set positioning method, all data grid spaces in the candidate space block are evenly distributed to the identification code of the vehicle of interest and the identification code registered in the candidate space block, and the data length is scaled according to the storage space size of each identification code;The identity of the past vehicle is verified based on vehicle identity verification table;In the elastic allocation mechanism of the overall equal division of the remaining storage space in the space block, the actual storage bit number of each identification code is continuously adjusted in equal proportion with the change of the registered number, the probability of different vehicles generating the same identification code is significantly reduced when the registered number is less, and the throughput of internet of vehicles identity verification is improved.

Description

Technical Field

[0001] This invention relates to the field of intelligent transportation and vehicle networking technology, and in particular to a method and system for rapid vehicle identity verification with automatically expandable and contractible identification codes. Background Technology

[0002] With the deepening advancement of vehicle intelligence and road infrastructure informatization, real-time interaction between vehicles and roadside equipment has become a crucial support for modern transportation systems. In numerous scenarios such as highway toll stations, urban road checkpoints, parking lot entrances and exits, refueling and charging stations, and restricted traffic control areas, roadside equipment needs to quickly identify whether a vehicle belongs to a group requiring special handling within a very short time after it passes by. This includes vehicles with outstanding traffic violations, vehicles with unpaid fees, vehicles entering specific areas without authorization, and vehicles on temporary control lists. The timeliness and accuracy of this identification directly impact traffic efficiency, control effectiveness, and the actual experience of drivers. However, roadside equipment is typically installed outdoors, subject to multiple limitations such as power supply conditions, equipment size, and heat dissipation capacity, resulting in computing power and capacity far lower than cloud servers. Furthermore, the number of vehicles requiring control is enormous and constantly changing; covering a medium-sized city may involve a dynamic list of hundreds of thousands of vehicles. How to quickly check massive and dynamic vehicle lists in the resource-constrained environment of roadside equipment is a pressing practical problem that needs to be solved in the engineering practice of the Internet of Vehicles (IoV).

[0003] To address these needs, the industry generally adopts a two-step approach: local rapid inspection and remote verification. Specifically, a lightweight local inspection mechanism is installed on the roadside equipment. This mechanism does not store complete vehicle information but instead generates and records a short identification code for each vehicle of interest. When a vehicle approaches, the roadside equipment first calculates the vehicle's identification code locally and checks its local records for a match. If the local inspection indicates that the vehicle's identification code does not exist, it can be allowed to pass directly without contacting the remote system. This covers the vast majority of normal daily traffic and significantly saves network communication resources. If the local inspection suggests that the vehicle's identification code may exist, remote verification is initiated, and the remote system returns the final decision. This layered design has been widely used in engineering practice, controlling roadside equipment resource consumption while keeping communication pressure within acceptable limits.

[0004] However, the above solution revealed a serious, long-standing flaw during actual installation. The size of the list of vehicles under monitoring fluctuates significantly over time; for example, it can multiply in a short period before and after major holidays, during special control periods, and during seasonal travel peaks. To cope with peak periods, maintenance personnel often allocate the local inspection mechanism's recording space based on the estimated maximum size and set a fixed length for each identification code accordingly. However, during most off-peak periods, the actual number of vehicles registered locally is far lower than the pre-allocated capacity, resulting in a large amount of recording space remaining idle for extended periods, leading to extremely low space utilization.

[0005] One direct solution is to enable the local inspection mechanism to scale on demand, that is, to initially allocate based on minimum demand and then dynamically expand as the number of registered vehicles increases. However, this approach is not feasible in the context of vehicle-to-everything (V2X) networks: roadside equipment needs to meet millisecond-level real-time response requirements, while the expansion process often involves large-scale record migration. During this period, the inspection function will experience a noticeable and significant lag, enough to cause passing vehicles to miss the judgment window, resulting in missed judgments or misprocessing. Another approach is to rely on external feedback to correct misidentifications afterward, but the feedback chain in V2X networks itself has a lag; misidentifications that have already occurred before feedback arrives cannot be reversed, and the correction process may introduce new inconsistencies in judgments, which may actually damage the reliability of the inspection mechanism. These infeasible solutions demonstrate that simply using existing expansion or correction approaches cannot fundamentally solve the problems of low record space utilization and locked misidentification probability. Therefore, a new vehicle identity inspection method is needed that can adaptively adjust the identification code length according to the number of registered vehicles, fully utilize the statically allocated capacity record space, and significantly reduce the probability of misidentification, in order to improve the throughput of V2X identity verification. Summary of the Invention

[0006] This invention addresses the technical problems existing in the prior art by providing a method and system for rapid vehicle identity verification with automatic scaling of identification code length. The unused remaining space within the space block is converted into additional storage bits for the registered identification code, making the actual length of the identification code exceed the basic length and improving the throughput of vehicle network identity verification.

[0007] According to a first aspect of the present invention, a method for rapid vehicle identity verification with automatically adjustable identification code length is provided, comprising: Step 1: Construct a vehicle identity verification form that stores the identification codes of the vehicles under interest; The vehicle identity verification form includes multiple spatial blocks; each spatial block includes multiple data cells. Step 2: Store the identification codes of each vehicle under interest into the identity verification table: The location of the corresponding candidate space block is calculated according to the set positioning method. All data cell spaces in the candidate space block are evenly distributed to the identification code of the vehicle of interest and the identification codes already registered in the candidate space block. The data length of each identification code is scaled according to the storage space size. Step 3: Verify the identity of passing vehicles based on the vehicle identity verification form.

[0008] Based on the above technical solution, the present invention can also be improved as follows.

[0009] Optionally, each space block is equipped with a status flag that records whether the data storage status of that space block is sparse or full: When the number of registered identifiers in a spatial block is less than the total number of data cells, the spatial block is in a sparse state. When the number of registered identifiers in a space block equals the total number of data cells, the space block is in a fully loaded state.

[0010] Optionally, the space blocks in the vehicle identity verification form are arranged sequentially, and each space block is divided into an equal number of data cells; In step 2, when the state of the space block is sparse after the identification code is registered into the space block, the remaining storage space of the space block, excluding the state flag bit, is equally allocated to all existing identification codes and newly registered identification codes. When the state of the space block changes from a sparse state to a full state after the identification code is registered into the space block, both the original identification codes and the newly registered identification codes in the space block are compressed to the length of the basic identification code, and each identification code is written into all data cells in ascending order of value.

[0011] Optionally, the status flag is composed of the highest bit of each data cell, and the number of registered identifiers in the current space block is recorded by the combination of the highest bits.

[0012] Optionally, in step 2, the positions of the two candidate spatial blocks corresponding to the vehicle of interest r are calculated according to the two set positioning methods, and the status flags of the two candidate spatial blocks are determined: When the flag bit of at least one candidate space block is in a sparse state, the identification code of the vehicle of interest r is registered into any of the candidate space blocks in a sparse state. When the flags of both candidate space blocks are in a full state, a data coordination mechanism is triggered; the data coordination mechanism includes: Take an existing identifier from the candidate space block corresponding to a positioning method, register the identifier of vehicle r into it, and rearrange the identifiers in the space block in ascending order. The retrieved original identifier will be re-registered into the backup candidate space block corresponding to another positioning method; if the backup candidate space block is already full, the data coordination processing mechanism will continue to be triggered.

[0013] Optionally, the process of verifying the identity of passing vehicles in step 3 includes: Based on the information of the vehicle to be verified, the identification code to be verified is calculated; The location numbers of the two candidate spatial blocks are calculated using the two positioning methods described above. The status flags of the two candidate space blocks are accessed and determined sequentially according to the location numbers; When the status flag is in a sparse state, the remaining storage space is divided equally according to the number of registered entries indicated by the status flag, each registered identifier is read out in sequence, and the identifier to be verified is truncated to the same number of digits and then compared one by one. When the status flag is in a full-load state, all registered identifier codes are read out sequentially according to the basic identifier code length, and the identifier codes to be verified are truncated to the basic length and then compared one by one. If any of the candidate spatial blocks is successfully matched, an identifier code may be returned. If both candidate space blocks fail to match, the identifier code is returned as not found.

[0014] Optionally, the process of deregistering a registered vehicle from the vehicle identity verification form includes: The identification code of the vehicle to be deregistered is calculated based on the license plate information. The candidate space block in which the vehicle is located is located using the two positioning methods mentioned above. The target identification code is then removed from the space block. If the space block was originally in a full state, and the number of registered items decreases after removal, the space block is switched back to a sparse state, the remaining identification codes are redistributed evenly in the remaining storage space except for the status flag bits, and the status flag values ​​corresponding to the new number of registered items are written. If the space block was originally in a sparse state, after removal, the remaining storage space is redistributed equally according to the new registered quantity, and the status flag is updated to the value corresponding to the new quantity.

[0015] Optionally, if the identification code of the passing vehicle is not found in the vehicle identity verification table in step 3, the vehicle is determined not to belong to the group of vehicles of interest, and the roadside equipment allows it to pass directly. If the identification code of the passing vehicle is found in the vehicle identity verification table, the roadside equipment initiates remote verification and performs corresponding processing based on the verification result.

[0016] Optionally, the vehicle identification code is a hash value generated by the identification code generation method, representing the unique identification information of the vehicle. The unique identification information includes: license plate number and vehicle identification number.

[0017] According to a second aspect of the present invention, a vehicle identity rapid verification system with automatically expandable and contractible identification code length is provided, comprising: an identity verification form construction unit and a roadside device; The identity verification form construction unit is used to construct a vehicle identity verification form that stores the identification code of the vehicle of interest. The vehicle identity verification form includes multiple spatial blocks; each spatial block includes multiple data cells. The identification codes of each vehicle under surveillance are stored in the identity verification table: The location of the corresponding candidate space block is calculated according to the set positioning method. All data cell spaces in the candidate space block are evenly distributed to the identification code of the vehicle of interest and the identification codes already registered in the candidate space block. The data length of each identification code is scaled according to the storage space size. The roadside equipment is used to verify the identity of passing vehicles based on the vehicle identity verification form.

[0018] This invention provides a method and system for rapid vehicle identity verification with automatically expandable and contractible identification codes. By registering the identification codes of vehicles of interest in a vehicle identity verification table, roadside equipment can quickly complete identity verification when a vehicle approaches, significantly reducing space usage compared to directly querying all vehicles. The verification table will not miss identifying vehicles of interest as normal vehicles during the identification process, and will only misidentify normal vehicles as vehicles of interest in rare cases. The overall reliability of the identification meets the actual management and control requirements of the Internet of Vehicles. The core innovation of this invention lies in designing the space blocks in the verification table into two working states: sparse and full. Through the interaction of status flags and an ascending sorting rule, the two states can be accurately distinguished without introducing any additional storage overhead. In the sparse state, data cells that were originally idle are automatically converted into new space for registered identification codes, giving each identification code an actual length exceeding the basic length, thereby significantly reducing the probability of misidentification.

[0019] This invention not only fully utilizes the previously wasted statically allocated capacity but also allows the verification form's representation capability to automatically adjust with changes in the number of registered vehicles: when the number of registered vehicles is small, each identification code has a longer effective length, stronger representation capability, and higher recognition accuracy; when the number of registered vehicles increases, the verification form's representation capability returns to a basic level. The entire adjustment process is completely automatic, requiring no intervention from maintenance personnel. The reduced probability of false identification means fewer normal vehicles are misidentified as vehicles of interest, thus reducing the number of remote requests triggered. This alleviates the communication pressure between roadside equipment and the remote server, correspondingly reducing the processing burden on the remote server, and thereby improving the overall operational efficiency of the entire vehicle network identity verification link. In summary, this invention fundamentally solves the problems of low space utilization and locked false identification rates in existing vehicle identity verification schemes without increasing storage overhead, relying on external feedback, or interrupting external services. It has significant engineering value for the efficient deployment of vehicle networks under resource-constrained conditions. Attached Figure Description

[0020] Figure 1 A flowchart illustrating an embodiment of a vehicle identification fast verification method with automatically resizing identification code length; Figure 2 A schematic diagram of a verification table in sparse and full-load states provided in an embodiment of the present invention; Figure 3 This is a schematic diagram of the verification form identification code registration scheme provided in an embodiment of the present invention; Figure 4 This is a schematic diagram comparing the end-to-end verification throughput of a vehicle identity rapid verification method with automatically expanding and contracting identification code length before and after application to roadside equipment, as provided in an embodiment of the present invention. Detailed Implementation

[0021] The principles and features of the present invention are described below with reference to the accompanying drawings. The examples given are only for explaining the present invention and are not intended to limit the scope of the present invention.

[0022] Figure 1 A flowchart of a vehicle identification rapid verification method with automatically expandable and contractible identification code provided by the present invention is shown below. Figure 1 As shown, the method includes: Step 1: Construct a vehicle identity verification form that stores the identification codes of the vehicles under interest.

[0023] The vehicle identification verification form consists of multiple spatial blocks; each spatial block contains multiple data cells.

[0024] Step 2: Store the identification codes of each vehicle under investigation in the identity verification table: The location of the corresponding candidate space block is calculated according to the set positioning method. All data cells in the candidate space block are evenly distributed to the identification code of the vehicle of interest and the identification codes already registered in the candidate space block. The data length of each identification code is scaled according to the storage space size.

[0025] Step 3: Verify the identity of passing vehicles based on the vehicle identity verification form.

[0026] This invention provides a vehicle identity verification method with automatic scaling of identification code length. It employs an elastic allocation mechanism that equally divides the remaining storage space within a space block. The actual number of bits stored for each identification code is continuously and proportionally adjusted according to the number of registered vehicles. When the number of registered vehicles is small, this significantly reduces the probability of different vehicles generating the same identification code and improves the throughput of vehicle network identity verification.

[0027] Example 1

[0028] Embodiment 1 provided by this invention is an embodiment of a vehicle identity rapid verification method with automatically expanding and contracting identification code length provided by this invention, combined with... Figure 1 It can be seen that the embodiments of this verification method include: Step 1: Construct a vehicle identity verification form that stores the identification codes of the vehicles under interest.

[0029] The vehicle identification verification form consists of multiple spatial blocks; each spatial block contains multiple data cells.

[0030] In one possible embodiment, each space block is provided with a status flag bit that records whether the data storage state of the space block is sparse or full: When the number of registered identifiers within a spatial block is less than the total number of data cells, the spatial block is in a sparse state.

[0031] When the number of registered identifiers within a space block equals the total number of data cells, the space block is in a fully loaded state.

[0032] When the verification table is initialized, all space blocks do not contain any identifiers and are in a sparse state.

[0033] In one possible implementation, the space blocks in the vehicle identification form are arranged sequentially, and each space block is divided into an equal number of data cells.

[0034] In one possible implementation, the status flag is composed of the highest bits of each data cell, and the number of registered identifiers in the current space block is recorded by the combination of the highest bits.

[0035] The specific values ​​of the status flags correspond one-to-one with the number of registered data. Furthermore, when selecting these values, all possible combinations of values ​​for the highest bit of the first few data cells under full load conditions are deliberately avoided. This allows the two working states to be clearly distinguished solely by the values ​​of the status flags, without introducing any additional storage overhead.

[0036] In one possible embodiment, the vehicle's identification code is a hash value generated by an identification code generation method, representing the vehicle's unique identification information.

[0037] Unique identification information includes: license plate number and vehicle identification number, etc.

[0038] Step 2: Store the identification codes of each vehicle under investigation in the identity verification table: The location of the corresponding candidate space block is calculated according to the set positioning method. All data cells in the candidate space block are evenly distributed to the identification code of the vehicle of interest and the identification codes already registered in the candidate space block. The data length of each identification code is scaled according to the storage space size.

[0039] In one possible embodiment, in step 2, when the space block is in a sparse state after the identifier is registered into the space block, the remaining storage space of the space block, excluding the status flag bit, is equally allocated to all existing identifiers and newly registered identifiers; so that the actual number of bits stored in the identifier is proportionally shortened as the number of registrations increases.

[0040] When the state of the space block changes from sparse to full after the identifier is registered into the space block, both the original identifier and the newly registered identifier in the space block are compressed to the length of the basic identifier, and each identifier is written into all data cells in ascending order of value.

[0041] In one possible embodiment, in step 2, the positions of the two candidate spatial blocks corresponding to the vehicle of interest r are calculated according to the two set positioning methods. In the specific implementation process, the two positioning methods are independent of each other. The current working status of the two candidate spatial blocks is checked in turn, and a spatial block that is still in a sparse state is selected and the vehicle's identification code is registered in it. After the registration is completed, the status flag bit is updated according to the new number of registered spatial blocks, and the remaining storage space of the spatial block other than the status flag bit is equally allocated to all registered identification codes.

[0042] Determine the status flags of the two candidate space blocks: When the flag bit of at least one candidate space block is in a sparse state, the identification code of the vehicle of interest r is registered into any sparse candidate space block.

[0043] When the flags of both candidate space blocks are in a full state, the data coordination mechanism is triggered; the data coordination mechanism includes: Take an existing identifier from the candidate space block corresponding to a positioning method, register the identifier of vehicle r into it, and rearrange the identifiers in the space block in ascending order.

[0044] The original identifier code is retrieved and then registered in the backup candidate space block corresponding to another positioning method. If the backup candidate space block is full, the data coordination processing mechanism is triggered again.

[0045] In practice, to prevent getting bogged down in an infinite number of coordination operations, this embodiment of the invention sets the maximum number of coordination operations per registration to 256. If the registration is not completed after reaching the maximum, it is determined that the verification form has reached saturation, meaning there is no remaining space, and the verification form needs to be expanded.

[0046] In a sparse state, the remaining storage space of a space block, excluding the status flag, is equally allocated to all registered identifiers. The fewer the number of registered identifiers, the more actual storage bits each identifier receives, exceeding the base identifier length under full load conditions. When only one identifier is registered within a space block, that identifier exclusively occupies all remaining space except for the status flag. As the number of registrations increases, the remaining space is divided equally among all identifiers, and the actual storage bits of each identifier decrease proportionally. Through this flexible allocation mechanism that equally divides the remaining storage space within the space block using the status flag as the boundary, the actual storage bits of each identifier are continuously and proportionally adjusted according to the number of registered identifiers. This significantly reduces the probability of different vehicles generating the same identifier when the number of registered identifiers is small, thereby improving the throughput of vehicle network identity verification.

[0047] In full-load mode, all registered identifiers within the space block use the basic identifier length, with each data cell storing exactly one complete identifier. All identifiers must be arranged in ascending order of value. Since the combination of the highest bits of the first few data cells after sorting does not overlap with all the values ​​of the status flag bits in the sparse state, the current working state of the space block can be immediately determined by reading the combination of the highest bits of the first few data cells during the verification process, without introducing additional storage overhead.

[0048] In one possible embodiment, Step 3: Verify the identity of passing vehicles based on the vehicle identity verification form.

[0049] In one possible embodiment, step 3, which involves verifying the identity of passing vehicles, includes: Based on the information of the vehicle to be verified, the identification code to be verified is calculated.

[0050] In the specific implementation process, the same identification code generation method as that used in the construction of the vehicle identity verification form is employed.

[0051] The location numbers of the two candidate spatial blocks were calculated using two different positioning methods.

[0052] Access and determine the status flags of the two candidate space blocks sequentially based on their position numbers.

[0053] In practice, the status of the status flag can be determined by reading the highest bit combination of the first few data cells of each space block.

[0054] When the status flag is in a sparse state, the remaining storage space is divided equally according to the number of registered entries indicated by the status flag. Each registered identifier is read out in turn, and the identifier to be verified is truncated to the same number of bits and then compared one by one.

[0055] When the status flag is in full load, all registered identifiers are read out sequentially according to the basic identifier length, and the identifiers to be verified are truncated to the basic length and then compared one by one.

[0056] If any candidate space block is successfully matched, the returned identifier code may exist.

[0057] If both candidate space blocks fail to match, the identifier code is returned as not found.

[0058] In one possible embodiment, the process of deregistering a registered vehicle from a vehicle identity verification form includes: The identification code of the vehicle to be deregistered is calculated based on its license plate information. The candidate space block in which the vehicle is located is located using two positioning methods, and the target identification code is removed from the space block.

[0059] If the space block was originally in a full state, and the number of registered entries decreases after removal, the space block is switched back to a sparse state. The remaining identifiers are redistributed evenly across the remaining storage space except for the status flag bits, and the status flag values ​​corresponding to the new number of registered entries are written.

[0060] If the space block was originally in a sparse state, after removal, the remaining storage space is redistributed equally according to the new registered quantity, and the status flag is updated to the value corresponding to the new quantity.

[0061] When a cancellation operation causes a space block to switch from a full state to a sparse state, the remaining identifier codes are stretched back to the length of the identifier codes allocated to the corresponding number of registered entities in the sparse state, and the corresponding status flag values ​​are written. The above switching process is completed independently within the space block, without involving any modification to other space blocks, and without interrupting the query and registration services provided by the verification form.

[0062] In one possible implementation, if the identification code of the passing vehicle is not found in the vehicle identity verification table in step 3, then the vehicle is determined not to belong to the group of vehicles of interest, and the roadside equipment allows it to pass directly.

[0063] If the identification code of a passing vehicle is found in the vehicle identity verification table, the roadside equipment initiates remote verification and performs corresponding processing based on the verification results.

[0064] Example 2

[0065] Embodiment 2 of the present invention is an embodiment of a vehicle identity rapid verification system with automatically expandable and contractible identification code length provided by the present invention. This embodiment of the verification system includes: The verification system includes: an identity verification form construction unit and roadside equipment.

[0066] The identity verification form construction unit is used to construct a vehicle identity verification form that stores the identification codes of the vehicles under interest.

[0067] The vehicle identification verification form consists of multiple spatial blocks; each spatial block contains multiple data cells.

[0068] Store the identification codes of each vehicle under surveillance in the identity verification form: The location of the corresponding candidate space block is calculated according to the set positioning method. All data cells in the candidate space block are evenly distributed to the identification code of the vehicle of interest and the identification codes already registered in the candidate space block. The data length of each identification code is scaled according to the storage space size.

[0069] Roadside equipment is used to verify the identity of passing vehicles based on vehicle identity verification forms.

[0070] It is understood that the vehicle identity rapid verification system with automatically expandable and contractible identification code provided by the present invention corresponds to the vehicle identity rapid verification method with automatically expandable and contractible identification code provided in the foregoing embodiments. The relevant technical features of the vehicle identity rapid verification system with automatically expandable and contractible identification code can be referred to the relevant technical features of the vehicle identity rapid verification method with automatically expandable and contractible identification code, and will not be repeated here.

[0071] Example 3

[0072] Embodiment 3 of the present invention is a specific application embodiment of the vehicle identity rapid verification method with automatic scaling of identification code length provided by the present invention. This specific application embodiment includes: A unique identifier is constructed for each vehicle of interest, and each identifier is a fixed-length binary string. For example, the identifier 'r' of a vehicle of interest can be represented as a 192-bit binary sequence, with the first few bits being "10110100011010011100001001010111", the remaining bits omitted, and the last few bits being "0100111011100101". This identifier can be obtained by combining the license plate number, vehicle identification number (VIN), or other unique vehicle information.

[0073] A list of vehicles of interest, S, is generated based on the identification codes of each vehicle of interest.

[0074] For the aforementioned list of vehicles under surveillance S, determine whether an approaching vehicle belongs to the group of vehicles under surveillance, that is, search in S for a matching identifier code corresponding to that vehicle. For example... Figure 1 As shown in the figure, this embodiment discloses a vehicle identity verification method in a vehicle-to-everything (V2X) scenario that automatically stretches or compresses the length of the identification code based on the number of registered vehicles. The method includes the following four stages: verification form initialization stage, vehicle list loading stage, roadside verification stage, and list maintenance stage.

[0075] The specific steps in the verification table initialization phase are as follows: Based on the specific deployment scenario, determine the overall size and internal structure of the verification table. Specifically, this requires determining the total number of space blocks contained in the verification table, the number of data cells contained in each space block, and the number of bits per data cell.

[0076] In one embodiment of the present invention, each space block contains 4 data cells, each data cell occupies 8 bits, so a space block occupies a total of 32 bits. When the verification table is initialized, the contents of all data cells are set to zero, and all space blocks are in a sparse state. At this time, no vehicles have been registered in the verification table.

[0077] The specific steps of the vehicle list loading stage are as follows: each vehicle of interest in list S is registered into the verification form in turn, and finally a verification form instance containing complete list information is formed and stored in the local storage of the roadside equipment.

[0078] Specifically, such as Figure 2 The diagram shown illustrates a verification table provided by an embodiment of the present invention in sparse and full-load states. Figure 2It can be seen that each space block exhibits two different working states under different filling conditions: when the number of registered identifiers in the space block is less than 4, the space block is in a sparse state; when the number of registered identifiers in the space block is equal to 4, the space block switches to a full-load state. In the sparse state, this invention reserves one bit in the highest bit of each data cell as a status flag bit. The highest bits of the first 3 data cells of the entire space block together form a 3-bit status flag bit, used to record the number of registered identifiers in the current space block. For example... Figure 3 The diagram shown is a schematic diagram of the verification form identification code registration scheme provided in an embodiment of the present invention, combined with... Figure 3 It can be seen that when 0, 1, 2, and 3 identifiers are registered in the space block respectively, the status flag bits are 010, 100, 101, and 110 respectively. These four values ​​were intentionally selected to avoid possible value combinations under full load conditions, so that the two working states can be clearly distinguished by the values ​​of the status flag bits.

[0079] For each vehicle r in the list S, the registration process is as follows: First, based on the license plate information of vehicle r, the identification code of the vehicle is calculated using a preset identification code generation method; then, the location numbers of two candidate spatial blocks are calculated using two independent positioning methods; then, the current status of these two candidate spatial blocks is checked in turn, and corresponding processing methods are taken according to the status.

[0080] If at least one candidate space block still has free data cells, select one and register the vehicle r's identifier code there. After registration, update the status flag bit according to the new number of registered identifiers in the space block, and evenly allocate the remaining storage space of the space block, excluding the status flag bit, to all registered identifier codes. For example, when only one identifier code is registered in the space block, that identifier code occupies all the space except for the status flag bit, and the identifier code length is 29 bits (i.e., 32 minus 3 equals 29 bits); when two identifier codes are registered in the space block, they share the remaining space equally, and each identifier code length is 14 bits (i.e., 32 minus 3 divided by 2, rounded down); when three identifier codes are registered in the space block, they share the remaining space equally, and each identifier code length is 9 bits (i.e., 32 minus 3 divided by 3, rounded down).

[0081] When the number of registered identifiers within a space block increases from 3 to 4, the space block switches from a sparse state to a full state. During the switch, the original 3 identifiers are compressed to the basic identifier length, i.e., 8 bits per data cell, and written into the 4 data cells in ascending order along with the newly registered identifiers. In the full-load state, all 4 identifiers use the basic identifier length, and each data cell stores one complete identifier; there is no need to retain status flags.

[0082] If both candidate space blocks are full, data coordination processing is triggered: an existing identifier is temporarily removed from one of the candidate space blocks, the vehicle r's identifier is registered there, and the identifiers in that space block are rearranged in ascending order. The removed identifier is then attempted to be registered in its backup candidate space block. If the backup candidate space block is also full, data coordination is triggered again. To prevent an infinite number of coordination operations, this embodiment sets the maximum number of coordination operations per registration to 256. If the registration is not completed after reaching the maximum, the verification table is determined to be saturated, meaning there is no remaining space, and the verification table needs to be expanded.

[0083] The roadside verification process includes the following steps: When a vehicle approaches the roadside equipment, the equipment first accesses its local verification table to determine if the vehicle's identification code exists in the table. If it does not exist, the vehicle is not part of the monitored vehicle group and can be allowed to pass directly without further processing. If it does exist, the equipment needs to contact the remote system for final verification and take appropriate action based on the verification results, such as restricting passage, adjusting toll collection strategies, or recording the vehicle's trajectory.

[0084] The process of accessing the verification table for a vehicle r' to be verified is described as follows. First, based on the license plate information of vehicle r', the identification code to be verified for the vehicle is calculated using the same identification code generation method; then, the location numbers of two candidate spatial blocks are calculated using two independent positioning methods; and then, these two candidate spatial blocks are accessed sequentially.

[0085] For each candidate space block, first read the highest bit of the first 3 data cells of the space block to obtain a 3-bit value combination, and compare this value combination with the four state flag values ​​(i.e., 010, 100, 101, 110) in the sparse state. If one of them is matched, the space block is determined to be in the sparse state, and the number of registered identifiers can be directly read. The number ranges from 0 to 3. If no match is found, the space block is determined to be in the full state, and the number of registered identifiers is 4.

[0086] If the space block is in a sparse state, the remaining storage space of the space block, excluding the status flag, is divided equally according to the number of registered identifiers, and each registered identifier is read out sequentially. The identifier to be verified is truncated to the same identifier length and compared with each registered identifier one by one. If any comparison is successful, the candidate space block is successfully matched. If the space block is in a full state, the four basic-length identifiers in the four data cells are read out sequentially. The identifier to be verified is truncated to the basic identifier length and compared with each registered identifier one by one. If any comparison is successful, the candidate space block is successfully matched.

[0087] If either of the two candidate spatial blocks is matched successfully, the verification form will return an identification code that may exist, and the roadside equipment will initiate remote verification accordingly. If both candidate spatial blocks fail to be matched, the verification form will return an identification code that does not exist, and the roadside equipment will allow passage directly.

[0088] In this embodiment, the specific steps of the verification form list maintenance phase are as follows: When the list of vehicles under surveillance changes, the verification form needs to be updated. The update includes two types of operations: registering new vehicles and deregistering already registered vehicles. The process for registering new vehicles is consistent with the registration process in the vehicle list loading phase.

[0089] The specific process for deregistering a registered vehicle includes: first, calculating the identification code based on the license plate information of the vehicle to be deregistered; then, calculating the location numbers of two candidate spatial blocks using two independent positioning methods; next, sequentially accessing these two candidate spatial blocks and locating the specific location of the vehicle's identification code according to the verification process; finally, removing the target identification code from the spatial block and updating the internal layout of the spatial block according to the following rules.

[0090] If the space block was originally in a full state, after removing one identifier, the number of registered identifiers becomes 3, and the space block switches from a full state to a sparse state. The remaining 3 identifiers are stretched back to the sparse state, with the remaining space divided equally among the 3 identifiers, and the corresponding status flags (i.e., 110) are written to them. If the space block was originally in a sparse state, after removing one identifier, the remaining storage space is redistributed equally according to the new number of registered identifiers, and the status flags are updated to the values ​​corresponding to the new number.

[0091] Cancellation operations can only be performed on vehicles that have actually been registered. Performing a cancellation operation on a vehicle that has never been registered would violate the verification form's feature of not omitting vehicles of interest as normal vehicles. Specifically, since the location method only generates the location number of the candidate spatial block based on vehicle information and cannot verify whether the vehicle has actually been registered, performing a cancellation operation on an unregistered vehicle may inadvertently affect the identification codes of other registered vehicles in the same spatial block, causing these vehicles to be incorrectly reported as non-existent in subsequent verifications. In actual deployment, roadside equipment should initiate a verification before performing a cancellation operation to confirm that the target vehicle has indeed been registered.

[0092] The entire state transition process is completed within the spatial block, without involving any modifications to other spatial blocks, and without interrupting the external service of the verification form. This means that even if the verification form is processing a large number of vehicle verification requests, the list maintenance operation of the verification form can be carried out in parallel without any service interruption that is perceptible to vehicle owners.

[0093] The parameter values ​​given in this embodiment, such as each spatial block containing 4 data cells, each data cell occupying 8 bits, and a maximum data coordination number of 256, are only a typical implementation and do not constitute a limitation of the present invention. In actual deployment, the parameters can be flexibly adjusted according to the specific scenario. For example, roadside equipment with more abundant resources can choose a longer number of data cells, such as 12 or 16 bits, to obtain a lower probability of false recognition; in scenarios where the vehicle list fluctuates more drastically, more data cells can be selected, such as 5 or 6, to provide a larger range of spatial variation; for scenarios with extremely high real-time requirements, the maximum number of data coordination times can be appropriately reduced to ensure the worst-case time consumption of a single registration operation.

[0094] In one possible embodiment, the vehicle identity verification method described in this invention was verified through simulation experiments. The method was implemented in C++, and its performance was compared with three existing representative fast verification schemes. Scheme 1 is a compact fixed-length verification scheme (CFV) based on a fixed-length identifier code; Scheme 2 is a verification scheme based on a fixed-length identifier code with auxiliary tags (FVAT); and Scheme 3 is a cumulative identification verification unit (CIVU) scheme based on a fixed-length identifier code. The difference between these three existing schemes and the method described in this invention is that they all use a fixed-length identifier code and cannot adaptively adjust the length of the identifier code according to the number of registered vehicles. When this invention is applied to Scheme 1, it is referred to as the improved version of Scheme 1 (ElasticCompact Fixed-length Verification, ECFV).

[0095] In the experiment, all programs were run on an edge computing device equipped with an Intel(R) Xeon(R) Gold 5218R CPU@2.10GHz processor, 64GB of RAM, 1TB of solid-state storage, and an Ubuntu 22.04.2 LTS Linux operating system, compiled using the gcc 12.2.0 compiler with O3 level optimizations enabled. The dataset of vehicles of interest consisted of 12.8 million entries, with each data cell occupying 8 bits.

[0096] like Figure 4 The diagram shows a comparison of the end-to-end verification throughput of roadside equipment before and after the application of a vehicle identification rapid verification method with automatically expanding and contracting identification code length provided by an embodiment of the present invention. Figure 4This paper demonstrates a comparison of end-to-end verification throughput when applying the method of this invention to roadside equipment before and after performing vehicle identity verification tasks under the aforementioned hardware environment and the same size of the list of vehicles of interest. After constructing the vehicle identity verification table and loading all the identification codes of the vehicles of interest, a sequence of vehicle requests to be verified that do not belong to the group of vehicles of interest is constructed and continuously input into the roadside equipment for verification processing. Since all test vehicles do not belong to the group of vehicles of interest, all requests are processed directly in the local verification stage without triggering remote verification operations. The end-to-end verification throughput is obtained by statistically analyzing the number of vehicle verification requests that can be completed per unit time, and its unit is MOPS (millions of times per second). This metric reflects the overall capability of the roadside equipment to process normal vehicle verification requests under typical operating scenarios.

[0097] Experimental results show that: Scheme 1 has an end-to-end verification throughput of 0.61 MOPS; Scheme 2 has an end-to-end verification throughput of 0.39 MOPS; Scheme 3 has an end-to-end verification throughput of 0.04 MOPS; while the end-to-end verification throughput of this invention is 0.9 MOPS. This indicates that after introducing the vehicle identity verification method described in this invention, the probability of a normal vehicle being misidentified as a vehicle of interest is significantly reduced, thereby reducing the number of remote verification operations triggered. This allows more verification requests to be processed directly at the local stage, ultimately increasing the number of vehicle verification requests that the system can complete per unit time. The experimental results show that the end-to-end verification throughput of this invention is significantly improved, indicating that the method of this invention can effectively improve the overall verification processing capability of roadside equipment in actual deployment scenarios.

[0098] The experimental results above show that the method described in this invention can effectively reduce the probability of false identification, thereby reducing the remote verification operations triggered by false identification, enabling roadside equipment to process more vehicle verification requests per unit time, and thus significantly improving the throughput of the vehicle network identity verification link.

[0099] In summary, this invention fully utilizes the previously wasted space of statically allocated capacity in the verification table, using this space to increase the length of registered identification codes. This significantly reduces the false recognition rate without adding any extra space, and adapts the method described in this invention to the rapid vehicle identity verification scenario in the Internet of Vehicles (IoV). Therefore, during vehicle identity verification, it avoids misclassifying vehicles of interest as legitimate vehicles and reduces the number of times legitimate vehicles are mistakenly identified as vehicles of interest, thereby reducing the additional overhead of subsequent remote verification steps. Furthermore, compared to solutions that directly query the complete vehicle database, this invention has lower space requirements and shorter verification time per transaction, demonstrating significant engineering value for resource-constrained roadside equipment deployment.

[0100] This invention provides a method and system for rapid vehicle identity verification with automatically expandable and contractible identification codes. By registering the identification codes of vehicles of interest in a vehicle identity verification table, roadside equipment can quickly complete identity verification when a vehicle approaches, significantly reducing space usage compared to directly querying all vehicles. The verification table will not miss identifying vehicles of interest as normal vehicles during the identification process, and will only misidentify normal vehicles as vehicles of interest in rare cases. The overall reliability of the identification meets the actual management and control requirements of the Internet of Vehicles. The core innovation of this invention lies in designing the space blocks in the verification table into two working states: sparse and full. Through the cooperation of status flags and ascending sorting rules, the two states can be accurately distinguished without introducing any additional storage overhead. In the sparse state, data cells that were originally idle are automatically converted into new space for registered identification codes, giving each identification code an actual length exceeding the basic length, thereby significantly reducing the probability of misidentification.

[0101] This invention not only fully utilizes the previously wasted statically allocated capacity but also allows the verification form's representation capability to automatically adjust with changes in the number of registered vehicles: when the number of registered vehicles is small, each identification code has a longer effective length, stronger representation capability, and higher recognition accuracy; when the number of registered vehicles increases, the verification form's representation capability returns to a basic level. The entire adjustment process is completely automatic, requiring no intervention from maintenance personnel. The reduced probability of false identification means fewer normal vehicles are misidentified as vehicles of interest, thus reducing the number of remote requests triggered. This alleviates the communication pressure between roadside equipment and the remote server, correspondingly reducing the processing burden on the remote server, and thereby improving the overall operational efficiency of the entire vehicle network identity verification link. In summary, this invention fundamentally solves the problems of low space utilization and locked false identification rates in existing vehicle identity verification schemes without increasing storage overhead, relying on external feedback, or interrupting external services. It has significant engineering value for the efficient deployment of vehicle networks under resource-constrained conditions.

[0102] It should be noted that the descriptions of each embodiment in the above embodiments have different focuses. For parts that are not described in detail in a certain embodiment, please refer to the relevant descriptions in other embodiments.

[0103] Those skilled in the art will understand that embodiments of the present invention can be provided as methods, systems, or computer program products. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention can take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0104] This invention is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart illustrations. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0105] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0106] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0107] Although preferred embodiments of the invention have been described, those skilled in the art, upon learning the basic inventive concept, can make other changes and modifications to these embodiments. Therefore, the appended claims are intended to be interpreted as including both the preferred embodiments and all changes and modifications falling within the scope of the invention.

[0108] Obviously, those skilled in the art can make various modifications and variations to this invention without departing from its spirit and scope. Therefore, if these modifications and variations fall within the scope of the claims of this invention and their equivalents, this invention also intends to include these modifications and variations.

Claims

1. A method for rapid vehicle identity verification with automatically adjustable identification code length, characterized in that, The verification method includes: Step 1: Construct a vehicle identity verification form that stores the identification codes of the vehicles under interest; The vehicle identity verification form includes multiple spatial blocks; each spatial block includes multiple data cells. Step 2: Store the identification codes of each vehicle under interest into the identity verification table: The location of the corresponding candidate space block is calculated according to the set positioning method. All data cell spaces in the candidate space block are evenly distributed to the identification code of the vehicle of interest and the identification codes already registered in the candidate space block. The data length of each identification code is scaled according to the storage space size. Step 3: Verify the identity of passing vehicles based on the vehicle identity verification form.

2. The verification method according to claim 1, characterized in that, Each space block contains a status flag that records whether the data storage status of that space block is sparse or full: When the number of registered identifiers in a spatial block is less than the total number of data cells, the spatial block is in a sparse state. When the number of registered identifiers in a space block equals the total number of data cells, the space block is in a fully loaded state.

3. The verification method according to claim 2, characterized in that, The space blocks in the vehicle identity verification form are arranged sequentially, and each space block is divided into an equal number of data cells. In step 2, when the space block is in a sparse state after the identifier is registered into the space block, the remaining storage space of the space block, excluding the status flag bit, is equally allocated to all existing identifiers and newly registered identifiers. When the state of the space block changes from a sparse state to a full state after the identification code is registered into the space block, both the original identification codes and the newly registered identification codes in the space block are compressed to the length of the basic identification code, and each identification code is written into all data cells in ascending order of value.

4. The verification method according to claim 2, characterized in that, The status flag is composed of the highest bit of each data cell, and the number of registered identifiers in the current space block is recorded by the combination of the highest bits.

5. The verification method according to claim 2, characterized in that, In step 2, the positions of the two candidate spatial blocks corresponding to the vehicle of interest r are calculated according to the two set positioning methods, and the status flags of the two candidate spatial blocks are determined: When the flag bit of at least one candidate space block is in a sparse state, the identification code of the vehicle of interest r is registered into any of the candidate space blocks in a sparse state. When the flags of both candidate space blocks are in the full state, the data coordination processing mechanism is triggered. The data coordination and processing mechanism includes: Take an existing identifier from the candidate space block corresponding to a positioning method, register the identifier of vehicle r into it, and rearrange the identifiers in the space block in ascending order. The retrieved original identifier will be re-registered into the backup candidate space block corresponding to another positioning method; if the backup candidate space block is already full, the data coordination processing mechanism will continue to be triggered.

6. The verification method according to claim 5, characterized in that, The process of verifying the identity of passing vehicles in step 3 includes: Based on the information of the vehicle to be verified, the identification code to be verified is calculated; The location numbers of the two candidate spatial blocks are calculated using the two positioning methods described above. The status flags of the two candidate space blocks are accessed and determined sequentially according to the location numbers; When the status flag is in a sparse state, the remaining storage space is divided equally according to the number of registered entries indicated by the status flag, each registered identifier is read out in sequence, and the identifier to be verified is truncated to the same number of digits and then compared one by one. When the status flag is in a full-load state, all registered identifier codes are read out sequentially according to the basic identifier code length, and the identifier codes to be verified are truncated to the basic length and then compared one by one. If any of the candidate spatial blocks is successfully matched, an identifier code may be returned. If both candidate space blocks fail to match, the identifier code is returned as not found.

7. The verification method according to claim 5, characterized in that, The process of deregistering a registered vehicle from the vehicle identity verification form includes: The identification code of the vehicle to be deregistered is calculated based on the license plate information. The candidate space block in which the vehicle is located is located using the two positioning methods mentioned above. The target identification code is then removed from the space block. If the space block was originally in a full state, and the number of registered items decreases after removal, the space block is switched back to a sparse state, the remaining identification codes are redistributed evenly in the remaining storage space except for the status flag bits, and the status flag values ​​corresponding to the new number of registered items are written. If the space block was originally in a sparse state, after removal, the remaining storage space is redistributed equally according to the new registered quantity, and the status flag is updated to the value corresponding to the new quantity.

8. The verification method according to claim 1, characterized in that, In step 3, if the identification code of the passing vehicle is not found in the vehicle identity verification table, the vehicle is determined not to belong to the group of vehicles of concern, and the roadside equipment allows it to pass directly. If the identification code of the passing vehicle is found in the vehicle identity verification table, the roadside equipment initiates remote verification and performs corresponding processing based on the verification result.

9. The verification method according to claim 1, characterized in that, The vehicle identification code is a hash value generated by the identification code generation method, representing the unique identification information of the vehicle. The unique identification information includes: license plate number and vehicle identification number.

10. A vehicle identification rapid verification system with automatically expandable and contractible identification code length, characterized in that, The verification system includes: an identity verification form construction unit and roadside equipment; The identity verification form construction unit is used to construct a vehicle identity verification form that stores the identification code of the vehicle of interest. The vehicle identity verification form includes multiple spatial blocks; each spatial block includes multiple data cells. The identification codes of each vehicle under surveillance are stored in the identity verification table: The location of the corresponding candidate space block is calculated according to the set positioning method. All data cell spaces in the candidate space block are evenly distributed to the identification code of the vehicle of interest and the identification codes already registered in the candidate space block. The data length of each identification code is scaled according to the storage space size. The roadside equipment is used to verify the identity of passing vehicles based on the vehicle identity verification form.

Images