LoRa communication method for parking lot control system data
By analyzing the parking status and popularity of parking spaces in parking lots, optimizing the data transmission sequence of LoRa technology, solving the problems of data transmission congestion and signal interference in large parking lots, and improving the overall efficiency and parking efficiency of parking lots.
Patent Information
- Application Number
- CN202411516971.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-10-29
- Publication Date
- 2024-11-26
- Estimated Expiration
- Not applicable · inactive patent
AI Technical Summary
In large parking lots, due to the dense deployment of parking spaces and complex environment, LoRa technology can easily lead to network congestion and signal interference when transmitting a large amount of data in a short time, resulting in chaotic data in the control system and untimely updates, reducing vehicle parking efficiency.
By obtaining the parking status, average parking density, parking complexity and popularity of each parking space, combining the distance between the parking space and the entrance and exit and the elevator path length, the transmission sequence of each parking space is calculated, and the queue-cutting index is calculated during the data transmission process. Optimize and use LoRa technology for transmission.
It improves the overall efficiency of the parking lot, reduces management difficulty, improves the utilization rate of popular parking spaces, and enables the status of more popular parking spaces to be quickly communicated to users or managers, thereby improving the parking efficiency of the parking lot.
Smart Images

Figure CN119031013A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of communication technology, and in particular to a LoRa communication method for parking lot control system data. Background Art
[0002] LoRa is a long-range wireless communication technology designed for remote communication of Internet of Things (IoT) devices. It is known for its long-range, low-power, anti-interference and high-capacity features, and is widely used in many fields such as smart cities, agricultural monitoring, industrial automation and environmental monitoring. Using LoRa technology for control communication of smart parking lots, the current solution is to monitor the status of parking spaces through sensors, which send information about the parking space status and detector ID to the connected detectors. Then, the LoRa module uses the LoRaWAN protocol to transmit this data in an encrypted manner to the nearest LoRa gateway, and finally the central control system updates the parking space status, thereby achieving effective management of the parking lot.
[0003] When LoRa technology is applied to parking space control scenarios in large parking lots, the system may need to transmit a large amount of data in a short period of time due to the dense deployment of parking spaces and complex environments. In this case, low data transmission rates and frequently changing parking space information may cause network congestion and signal interference, leading to data confusion and untimely updates in the control system, ultimately reducing the user's vehicle parking efficiency. Summary of the invention
[0004] In view of the above, it is necessary to provide a LoRa communication method for parking lot control system data to solve the above problems.
[0005] An embodiment of the present application provides a LoRa communication method for parking control system data, the method comprising: Obtain the parking status of each parking space in each partition of the parking lot at each time, wherein the parking status includes: free, occupied; According to the parking status of each partition in the historical time period corresponding to the current moment, the average parking density of each partition is obtained; according to the average parking density of each partition, combined with the distance between each parking space in each partition and the entrance and exit of the parking lot, and the distribution of the path length between each parking space and the elevator hall, the popularity of each parking space in each partition is analyzed; The analysis of the popularity of each parking space in each partition is as follows: According to the shortest path between each parking space in each partition and the entrance and exit of the parking lot, the parking complexity index of each parking space in each partition is obtained; Obtain the shortest path length from each parking space in each partition to each elevator hall in the parking lot, and calculate the mean to obtain the average path length; obtain the minimum value of the shortest path length from each parking space in each partition to all elevator halls in the parking lot; reversely fuse the parking complexity index, the average path length and the minimum value of each parking space in each partition, and combine the average parking density of each partition to obtain the popularity of each parking space in each partition; According to the number of parking spaces in each partition that are currently free, combined with the distance between the parking lot entrance and the partition, the user's parking priority for each partition at each entrance is obtained; according to the traffic volume of each entrance and the traffic volume of all entrances in the historical time period corresponding to the current moment, combined with the user's parking priority for each partition at different entrances, the parking index of each partition is obtained; the partitions are sorted based on the parking index, and then the parking spaces in each partition are sorted based on popularity, to obtain the transmission order of each parking space in each partition; By comparing the popularity of each parking space and the parking spaces before they were sorted, and combining the difference characteristics of the traffic flow of each entrance and all entrances, the queue-jumping index of each parking space at the current moment is obtained, and it is determined whether the parking status corresponding to each parking space at the current moment can be transmitted by queue-jumping; combined with the waiting transmission time of the parking status corresponding to each parking space, the position of the parking status corresponding to each parking space that can be transmitted by queue-jumping is obtained, and after re-sorting, it is transmitted using LoRa technology.
[0006] The average parking density of each partition is obtained as follows: The ratio of the number of occupied parking spaces in each partition at each moment to the number of all parking spaces in the corresponding partition is taken as the vehicle parking density of each partition at each moment; the average level of vehicle parking density in each partition at all moments in the historical time period is obtained to obtain the average parking density of each partition.
[0007] The parking complexity index of each parking space in each partition is obtained as follows: The shortest path lengths between each parking space in each partition and the parking lot exit and parking lot entrance are obtained, which are recorded as the first path length and the second path length respectively. The first path length and the second path length are weighted and averaged using a preset weight to obtain a parking complexity index for each parking space in each partition.
[0008] The method of obtaining the parking priority of the user for each partition at each entrance is specifically as follows: The popularity of all vacant parking spaces in each partition at the current moment is merged to obtain the overall popularity of each partition at the current moment. The parking priority of users for each partition at each entrance is obtained based on the shortest path length from each entrance to each partition, combined with the overall popularity of each partition at the current moment and the parking density of vehicles.
[0009] The parking index of each partition is obtained as follows: The parking index of the i-th partition at the current moment is recorded as , its formula form is: ;in, Indicates the number of all entrances to the parking lot; Indicates the traffic volume of all entrances in the historical time period corresponding to the current moment; Indicates the traffic flow of the cth entrance in the historical time period corresponding to the current moment; It indicates the parking priority of the user at the cth entrance for the i-th partition at the current moment.
[0010] The queue-jumping index of each parking space at the current moment is obtained as follows: Calculate the average popularity of all parking spaces in all partitions before the sorting of each parking space in each partition at the current moment; calculate the difference between the popularity of each parking space at the current moment and the average popularity, recorded as the first difference; obtain the average traffic flow of all entrances of the parking lot at the current moment and the comparison result of the traffic flow of each entrance, recorded as the second difference; When the second difference is less than 0, the result of merging the first difference with the second difference is used as the queue-interceptability index of each parking space in each partition at the current moment.
[0011] The specific steps of determining whether the parking status corresponding to each parking space at the current moment can be transmitted by queue jumping are as follows: The preset multiple of the popularity threshold corresponding to each parking space at the current moment is used as the judgment threshold; if the queue-jumping index of each parking space in each partition at the current moment is greater than the judgment threshold, the parking status corresponding to each parking space at the current moment can be transmitted by queue-jumping; otherwise, it cannot be transmitted by queue-jumping.
[0012] The acquisition of the position of each parking space corresponding to the parking status that can be transmitted by queue interruption is specifically: Get the waiting transmission time of the parking status of each parking space in each partition at the current moment, and combine the difference in popularity between each parking space in each partition at the current moment and the parking spaces whose parking status has changed before being sorted, to get the queue-jumping index of all parking spaces before being sorted at the current moment; The transmission position corresponding to the parking space with the smallest sorting sequence number and whose queue-jumping index is greater than the preset queue-jumping threshold is used as the transmission position corresponding to the parking status of each parking space in each partition at the current moment.
[0013] The step of obtaining the queue-jumping index of all parking spaces before the current moment includes: The parking space before the jth parking space in the ith partition is recorded as the bth parking space in the ath partition, and the queue-jumping index of the bth parking space in the ath partition is recorded as , its formula form is: ;in, It represents the waiting transmission time corresponding to the parking status of the jth parking space in the i-th partition; represents the popularity of the jth parking space in the i-th partition; Indicates the popularity of the bth parking space in the ath partition; Represents the normalization function.
[0014] This application has at least the following beneficial effects: This application first analyzes the parking status of all parking spaces in each partition of the parking lot within a period of time, and combines the location of each parking space in the parking lot to obtain the popularity of each parking space. Its beneficial effect is to analyze the convenience of parking vehicles in parking spaces through the location of parking spaces and the convenience of the surrounding environment, and provide an analysis basis for subsequent data transmission, so as to formulate a more effective transmission method and improve the overall efficiency of the parking lot; further, by obtaining the parking priority and parking index of different partitions and parking spaces, the transmission order of parking space status data can be optimized according to the needs and user convenience of different time periods. This will help reduce the difficulty of parking lot management. At the same time, a queue-jumping index can be constructed. During the data transmission process, queues can be jumped in time according to the changing characteristics of the parking space status, and information on high-demand parking spaces can be transmitted preferentially. This can improve the utilization rate of popular parking spaces, so that the status of more popular parking spaces can be quickly conveyed to users or managers, thereby improving the overall parking efficiency of the parking lot. BRIEF DESCRIPTION OF THE DRAWINGS
[0015] Figure 1 A flow chart of a LoRa communication method for parking control system data provided by this application; Figure 2 A flow chart for obtaining the transmission order provided in this application. DETAILED DESCRIPTION
[0016] In the description of the embodiments of the present application, words such as "exemplary", "or", "for example" and the like are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary" or "for example" in the embodiments of the present application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary", "or", "for example" and the like is intended to present related concepts in a concrete manner.
[0017] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those commonly understood by those skilled in the art in the present application. The terms used in the specification of the present application are only for the purpose of describing specific embodiments and are not intended to limit the present application.
[0018] It should also be noted that the terms "first" and "second" in this application and its drawings are used to distinguish similar objects, rather than to describe a specific order or sequence. The method disclosed in the embodiments of the present application or the method shown in the flow chart includes one or more steps for implementing the method. Without departing from the scope of protection of this application, the execution order of multiple steps can be interchanged with each other, and some steps can also be deleted.
[0019] Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs.
[0020] This application proposes a LoRa communication method for parking control system data, which is applied to the field of communication technology. Figure 1 , the method comprises the following steps: S1: Obtain the parking status of each parking space in each partition of the parking lot at each time, where the parking status includes: free and occupied.
[0021] The parking lot considered in this application has a plurality of partitions, each partition contains a number of parking spaces, and the parking lot has a plurality of entrances and exits.
[0022] LoRa sensors are installed in each parking space in the parking lot. These sensors are used to detect and report the parking status of the parking space, including: idle, occupied. A LoRa gateway is installed in the parking lot to ensure that the sensor signal of the entire parking lot can be covered, and connected to the Internet through an Ethernet or cellular network gateway; the parking status is detected in real time using sensors. In this embodiment, the detection frequency of the sensor is specified to be 1 time / minute, and the data is stored in the internal cache of the detector. The implementer can adjust the detection frequency of the sensor according to the actual situation.
[0023] It should be noted that in order to reduce the amount of data, data caching is triggered only when the parking status changes. Otherwise, only data collection is performed without caching.
[0024] S2: According to the parking status of each partition in the historical time period corresponding to the current moment, the average parking density of each partition is obtained; according to the average parking density of each partition, combined with the distribution of the distance between each parking space in each partition and the entrance and exit of the parking lot, and the length of the path between each parking space and the elevator hall, the popularity of each parking space in each partition is analyzed.
[0025] When choosing a parking space, users usually tend to choose those that are open, easy to park, and time-saving. These parking spaces are usually located near elevators, parking lot entrances and exits, and in areas with low vehicle density. Therefore, the popularity of each parking space varies depending on its location and the convenience of the surrounding environment.
[0026] Based on this, the average parking density of each partition at all times in the historical time period is obtained: the ratio of the number of occupied parking spaces in each partition at each moment to the number of all parking spaces in the corresponding partition is used as the vehicle parking density of each partition at each moment; the average level of vehicle parking density in each partition at all times in the historical time period is obtained to obtain the average parking density of each partition.
[0027] In this embodiment, the preset time period is specifically a time period consisting of the current moment and a certain number of previous moments; wherein, the historical time period is set to one week, and the implementer can adjust it according to actual conditions.
[0028] The shortest path lengths between each parking space in each partition and the parking lot exit and parking lot entrance are obtained, which are recorded as the first path length and the second path length respectively. The first path length and the second path length are weighted and averaged using a preset weight to obtain a parking complexity index for each parking space in each partition.
[0029] In this embodiment, the parking complexity index is specifically an average of the first path length and the second path length.
[0030] The parking complexity index of the jth parking space in the i-th partition is denoted as , its formula form is: ;in, represents the preset weight, which is 0.75 in this embodiment; represents the shortest path length between the jth parking space in the i-th partition and the parking lot entrance; It represents the shortest path length between the jth parking space in the i-th partition and the exit of the parking lot.
[0031] It should be understood that since parking spaces near the entrance are more convenient for entry and exit, they are usually given priority. Therefore, parking spaces farther from the entrance are relatively more difficult to park, and thus the parking complexity index is greater. In this case, the weight corresponding to the first path length is larger, which can reflect the difficulty and convenience of parking.
[0032] The shortest path length from each parking space in each partition to each elevator hall in the parking lot is obtained, and the mean is calculated to obtain the average path length; the minimum value of the shortest path length from each parking space in each partition to all elevator halls in the parking lot is obtained; the parking complexity index, the average path length and the minimum value of each parking space in each partition are reversely fused, and the popularity of each parking space in each partition is obtained by combining the average parking density of each partition.
[0033] In the process of obtaining the popularity of each parking space in each partition, multiple variables are reversely fused and reflected by the inverse of the cumulative sum of the multiple variables; that is, the popularity is specifically: calculating the cumulative sum of the parking complexity index, the average path length and the minimum value of each parking space in each partition, and then finding the inverse; multiplying the inverse with the average parking density of the corresponding partition to obtain the popularity of each parking space in each partition.
[0034] It should be understood that when users choose parking spaces, they usually tend to choose those that are spacious, easy to park, and save time, and the corresponding popularity is higher.
[0035] S3: Based on the number of free parking spaces in each partition at the current moment and the distance between the parking lot entrance and the partition, the parking priority of users at each entrance for each partition is obtained; based on the traffic volume at each entrance in the historical time period corresponding to the current moment and the traffic volume of all entrances, combined with the parking priority of users at different entrances for each partition, the parking index of each partition is obtained; the partitions are sorted based on the parking index, and then the parking spaces in each partition are sorted based on popularity, to obtain the transmission order of each parking space in each partition.
[0036] In order to improve the efficiency of vehicle traffic, parking lots will have multiple entrances and exits for users to choose from. When choosing a parking area, different entrances will have different priorities because the distances between different parking areas and different exits are different, and the popularity of vacancies in different parking areas also varies.
[0037] Based on this, the popularity of all vacant parking spaces in each partition at the current moment is merged as the overall popularity of each partition at the current moment; according to the shortest path length from each entrance to each partition, combined with the overall popularity of each partition at the current moment and the vehicle parking density, the parking priority of the user for each partition at each entrance is obtained.
[0038] In this embodiment, the parking priority of the user at the cth entrance for the i-th partition at the current moment is recorded as , ;in, represents the vehicle parking density of the i-th partition at the current moment; Indicates the overall popularity of the i-th partition at the current moment; represents the shortest path length between the c-th entry and the i-th partition; represents the normalization function; Indicates the preset value. In this embodiment, the value is 0.5. The implementer can adjust it according to the user's parking focus. size.
[0039] It should be understood that zones with lower vehicle parking density are more popular because they provide a more convenient parking experience and reduce the time to find a parking space. At the same time, zones close to the entrance are usually more attractive because users want to enter and exit the parking lot quickly. Therefore, when choosing parking zones, users tend to choose those areas that are both open and close to the entrance, which can improve the convenience and efficiency of parking.
[0040] According to the parking priority of each section in the parking lot and the popularity of different parking spaces, the data transmission order after the parking status changes can be sorted. At the same time, combined with the waiting time and current time of each data to be transmitted, further evaluation is made on which types of data can be transmitted first to improve the efficiency of overall information transmission.
[0041] According to the traffic flow of each entrance and the traffic flow of all entrances in the historical time period corresponding to the current moment, combined with the parking priority of users at different entrances for each partition, the parking index of each partition is obtained: In this embodiment, the parking index of the i-th partition at the current moment is recorded as , its formula form is: ;in, Indicates the number of all entrances to the parking lot; Indicates the traffic volume of all entrances in the historical time period corresponding to the current moment; Indicates the traffic flow of the cth entrance in the historical time period corresponding to the current moment; It indicates the parking priority of the user at the cth entrance for the i-th partition at the current moment.
[0042] Sort each partition based on the parking index, and then sort the parking spaces in each partition based on popularity; obtain the transmission order of each parking space in each partition.
[0043] Among them, the flow chart of obtaining the transmission order is as follows: Figure 2 shown.
[0044] S4: Compare the differences in popularity of each parking space and the parking spaces before they are sorted, and combine the difference characteristics of the traffic flow of each entrance and all entrances to obtain the queue-jumping index of each parking space at the current moment, and judge whether the parking status corresponding to each parking space at the current moment can be transmitted by queue-jumping; combine the waiting transmission time of the parking status corresponding to each parking space, obtain the position of the parking status corresponding to each parking space that can be transmitted by queue-jumping, re-sort, and transmit using LoRa technology.
[0045] During the data transmission process, the parking status change information corresponding to some parking spaces can be allowed to be queue-jumped, so as to improve the convenience for certain specific groups or users. When the popularity of a certain parking space is much higher than that of other parking spaces, a threshold is set to judge the queue-jumping index of the parking status transmission and determine its specific queue-jumping position. The specific operation steps are as follows: Calculate the average popularity of all parking spaces in all partitions before the sorting of each parking space in each partition at the current moment; calculate the difference between the popularity of each parking space at the current moment and the average popularity, recorded as the first difference; obtain the average traffic flow of all entrances of the parking lot at the current moment and the comparison result of the traffic flow of each entrance, recorded as the second difference; based on the value of the second difference, according to the result of merging the first difference and the second difference, obtain the queue-jumping index of each parking space in each partition at the current moment: In this embodiment, the difference between variables is measured by the difference between the variables, that is, the first difference is specifically: the difference between the popularity of each parking space at the current moment and the average popularity; the second difference is specifically: the difference between the average traffic flow of all entrances of the parking lot at the current moment and the traffic flow of each entrance; when the second difference is greater than or equal to 0, no queue-jumping transmission operation is performed on the data corresponding to each parking space, otherwise, the queue-jumping index of each parking space in each partition is obtained, that is, the queue-jumping index is specifically the normalized value of the product of the first difference and the second difference; the normalization method uses the sigmoid function.
[0046] Based on the queue-intercepting index of each parking space in each partition at the current moment, determine whether the parking status corresponding to each parking space at the current moment can be transmitted by queue-intercepting: The preset multiple of the popularity threshold corresponding to each parking space at the current moment is used as the judgment threshold; if the queue-jumping index of each parking space in each partition at the current moment is greater than the judgment threshold, the parking status corresponding to each parking space at the current moment can be transmitted by queue-jumping; otherwise, it cannot be transmitted by queue-jumping.
[0047] It should be understood that when the data transmission in the parking lot is at its peak, that is, the second difference is less than 0, queue interruption of data transmission may result in excessive computation and lower data transmission efficiency; when the data transmission in the parking lot is not at its peak, that is, the second difference is greater than 0, queue interruption of data transmission can be performed to ensure that these parking spaces are used first and improve overall parking efficiency.
[0048] Analyze the positions of each parking space corresponding to the parking status that can be queued for transmission: The waiting transmission time of the parking status of each parking space in each partition at the current moment is obtained, and the queue-jumping index of all parking spaces before the sorting at the current moment is obtained by combining the difference in popularity between each parking space in each partition at the current moment and the parking spaces whose parking status has changed before the sorting at the current moment; the transmission position corresponding to the parking space with the smallest sorting number whose queue-jumping index is greater than the preset queue-jumping threshold is used as the transmission position corresponding to the parking status of each parking space in each partition at the current moment.
[0049] In this embodiment, the parking space in the partition before the jth parking space in the ith partition is recorded as the bth parking space in the ath partition, and the queue-jumping index of the bth parking space in the ath partition is recorded as , its formula form is: ;in, It represents the waiting transmission time corresponding to the parking status of the jth parking space in the i-th partition; represents the popularity of the jth parking space in the i-th partition; represents the popularity of the bth parking space in the ath partition, represents the normalization function. The queue-jumping threshold is set to 0.6, which can be selected by the implementer according to the actual situation.
[0050] Get all the parking statuses to be transmitted that have completed the queue at the current moment, and use LoRa technology to complete the transmission of this data. Upload the parking status to the LoRa terminal (LoRa gateway) and the central control system to realize the transmission of parking space monitoring data. Integrate the data into the user interface through the application software on the server, so as to update the status of the parking space in real time for administrators and users to view. Through the application or website, users can view the current parking status, which can be combined with path planning algorithms such as ant colony algorithm to help users quickly find free parking spaces.
[0051] The present application provides a LoRa communication method for parking control system data, the method comprising: firstly analyzing the parking status of all parking spaces in each partition of the parking lot within a period of time, and combining the position of each parking space in the parking lot to obtain the popularity of each parking space, which has the beneficial effect of analyzing the convenience of parking vehicles in the parking spaces through the convenience of the parking space location and the surrounding environment, and providing an analysis basis for subsequent data transmission, so as to formulate a more effective transmission method and improve the overall efficiency of the parking lot; further, by obtaining the parking priority and parking index of different partitions and parking spaces, the transmission order of the parking space status data can be optimized according to the needs and user convenience of different time periods. This will help reduce the difficulty of parking lot management. At the same time, a queue-jumping index can be constructed, and in the process of data transmission, the queue can be jumped in time according to the changing characteristics of the parking space status, and the information of high-demand parking spaces can be transmitted preferentially. In this way, the utilization rate of popular parking spaces can be improved, and the status of more popular parking spaces can be quickly conveyed to users or managers, thereby improving the overall parking efficiency of the parking lot.
[0052] The flowchart and block diagram in the accompanying drawings show the possible architecture, function and operation of the system, method and computer program product according to the embodiment of the present application. In this regard, each box in the flowchart or block diagram can represent a module, a program segment or a part of the code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. In some alternative implementations, the function marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two continuous boxes can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, which can depend on the functions involved. In the description corresponding to the flowchart and the block diagram in the accompanying drawings, the operations or steps corresponding to different boxes can also occur in a different order from the order disclosed in the description, and sometimes there is no specific order between different operations or steps. For example, two continuous operations or steps can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, which can depend on the functions involved. Each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, may be implemented by a dedicated hardware-based system that performs the specified functions or actions, or may be implemented by a combination of dedicated hardware and computer instructions.
[0053] The above embodiments are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. These modifications or replacements do not deviate the essence of the corresponding technical solutions from the scope of the technical solutions of the embodiments of the present application, and should all be included in the protection scope of the present application.
Claims
1. A LoRa communication method for parking control system data, characterized in that: The method comprises the following steps: Obtain the parking status of each parking space in each partition of the parking lot at each time, wherein the parking status includes: free, occupied; According to the parking status of each partition in the historical time period corresponding to the current moment, the average parking density of each partition is obtained; according to the average parking density of each partition, combined with the distance between each parking space in each partition and the entrance and exit of the parking lot, and the distribution of the path length between each parking space and the elevator hall, the popularity of each parking space in each partition is analyzed; The analysis of the popularity of each parking space in each partition is as follows: According to the shortest path between each parking space in each partition and the entrance and exit of the parking lot, the parking complexity index of each parking space in each partition is obtained; Obtain the shortest path length from each parking space in each partition to each elevator hall in the parking lot, and calculate the mean to obtain the average path length; obtain the minimum value of the shortest path length from each parking space in each partition to all elevator halls in the parking lot; reversely fuse the parking complexity index, the average path length and the minimum value of each parking space in each partition, and combine the average parking density of each partition to obtain the popularity of each parking space in each partition; According to the number of parking spaces in each partition that are currently free, combined with the distance between the parking lot entrance and the partition, the user's parking priority for each partition at each entrance is obtained; according to the traffic volume of each entrance and the traffic volume of all entrances in the historical time period corresponding to the current moment, combined with the user's parking priority for each partition at different entrances, the parking index of each partition is obtained; the partitions are sorted based on the parking index, and then the parking spaces in each partition are sorted based on popularity, to obtain the transmission order of each parking space in each partition; By comparing the popularity of each parking space and the parking spaces before they were sorted, and combining the difference characteristics of the traffic flow of each entrance and all entrances, the queue-jumping index of each parking space at the current moment is obtained, and it is determined whether the parking status corresponding to each parking space at the current moment can be transmitted by queue-jumping; combined with the waiting transmission time of the parking status corresponding to each parking space, the position of the parking status corresponding to each parking space that can be transmitted by queue-jumping is obtained, and after re-sorting, it is transmitted using LoRa technology.
2. A LoRa communication method for parking control system data as claimed in claim 1, characterized in that: The average parking density of each partition is obtained as follows: The ratio of the number of occupied parking spaces in each partition at each moment to the number of all parking spaces in the corresponding partition is taken as the vehicle parking density of each partition at each moment; the average level of vehicle parking density in each partition at all moments in the historical time period is obtained to obtain the average parking density of each partition.
3. A LoRa communication method for parking control system data as claimed in claim 1, characterized in that: The parking complexity index of each parking space in each partition is obtained as follows: The shortest path lengths between each parking space in each partition and the parking lot exit and parking lot entrance are obtained, which are recorded as the first path length and the second path length respectively. The first path length and the second path length are weighted and averaged using a preset weight to obtain a parking complexity index for each parking space in each partition.
4. A LoRa communication method for parking control system data as claimed in claim 2, characterized in that: The parking priority of the user at each entrance for each partition is obtained as follows: The popularity of all parking spaces in each partition that are in the idle state at the current moment is merged to obtain the overall popularity of each partition at the current moment. According to the shortest path length from each entrance to each partition, combined with the overall popularity of each partition at the current moment and the vehicle parking density, the user's parking priority for each partition at each entrance is obtained.
5. A LoRa communication method for parking control system data as claimed in claim 1, characterized in that: The parking index of each partition is obtained as follows: The parking index of the i-th partition at the current moment is recorded as , its formula form is: ;in, Indicates the number of all entrances to the parking lot; Indicates the traffic volume of all entrances in the historical time period corresponding to the current moment; Indicates the traffic flow of the cth entrance in the historical time period corresponding to the current moment; It indicates the parking priority of the user at the cth entrance for the i-th partition at the current moment.
6. A LoRa communication method for parking control system data as claimed in claim 1, characterized in that: The queue-jumping index of each parking space at the current moment is obtained as follows: Calculate the average popularity of all parking spaces in all partitions before the sorting of each parking space in each partition at the current moment; calculate the difference between the popularity of each parking space at the current moment and the average popularity, recorded as the first difference; obtain the average traffic flow of all entrances of the parking lot at the current moment and the comparison result of the traffic flow of each entrance, recorded as the second difference; When the second difference is less than 0, the result of merging the first difference with the second difference is used as the queue-interceptability index of each parking space in each partition at the current moment.
7. A LoRa communication method for parking control system data as claimed in claim 1, characterized in that: The specific steps of determining whether the parking status corresponding to each parking space at the current moment can be transmitted by queue jumping are: The preset multiple of the popularity threshold corresponding to each parking space at the current moment is used as the judgment threshold; if the queue-jumping index of each parking space in each partition at the current moment is greater than the judgment threshold, the parking status corresponding to each parking space at the current moment can be transmitted by queue-jumping; otherwise, it cannot be transmitted by queue-jumping.
8. A LoRa communication method for parking control system data as claimed in claim 1, characterized in that: The position where the parking status corresponding to each parking space can be queued for transmission is obtained as follows: Get the waiting transmission time of the parking status of each parking space in each partition at the current moment, and combine the difference in popularity between each parking space in each partition at the current moment and the parking spaces whose parking status has changed before being sorted, to get the queue-jumping index of all parking spaces before being sorted at the current moment; The transmission position corresponding to the parking space with the smallest sorting sequence number and whose queue-jumping index is greater than the preset queue-jumping threshold is used as the transmission position corresponding to the parking status of each parking space in each partition at the current moment.
9. A LoRa communication method for parking control system data as claimed in claim 8, characterized in that: The method of obtaining the queue-jumping index of all parking spaces before the current moment includes: The parking space before the jth parking space in the ith partition is recorded as the bth parking space in the ath partition, and the queue-jumping index of the bth parking space in the ath partition is recorded as , its formula form is: ;in, It represents the waiting transmission time corresponding to the parking status of the jth parking space in the i-th partition; represents the popularity of the jth parking space in the i-th partition; Indicates the popularity of the bth parking space in the ath partition; Represents the normalization function.
