CN109450926B - Driving data packet compression time calculation method and data packet compression device - Google Patents

Driving data packet compression time calculation method and data packet compression device Download PDF

Info

Publication number
CN109450926B
CN109450926B CN201811484353.8A CN201811484353A CN109450926B CN 109450926 B CN109450926 B CN 109450926B CN 201811484353 A CN201811484353 A CN 201811484353A CN 109450926 B CN109450926 B CN 109450926B
Authority
CN
China
Prior art keywords
data
data packet
clock
packet
preset
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201811484353.8A
Other languages
Chinese (zh)
Other versions
CN109450926A (en
Inventor
陈剑波
叶清明
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chengdu Luxingtong Information Technology Co ltd
Original Assignee
Chengdu Luxingtong Information Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Chengdu Luxingtong Information Technology Co ltd filed Critical Chengdu Luxingtong Information Technology Co ltd
Priority to CN201811484353.8A priority Critical patent/CN109450926B/en
Publication of CN109450926A publication Critical patent/CN109450926A/en
Application granted granted Critical
Publication of CN109450926B publication Critical patent/CN109450926B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/04Protocols for data compression, e.g. ROHC
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/12Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/56Provisioning of proxy services
    • H04L67/565Conversion or adaptation of application format or content
    • H04L67/5651Reducing the amount or size of exchanged application data

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Health & Medical Sciences (AREA)
  • Computing Systems (AREA)
  • General Health & Medical Sciences (AREA)
  • Medical Informatics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a driving data packet compression time calculation method and a data packet compression device. The method comprises the following steps: a process of data packet acquisition; analyzing the speed and acceleration of the newly acquired data packet; determining a process of collecting the effective data packet according to the analysis result; screening the data packets to be compressed; and compressing the data packet. The device comprises: the data acquisition module, the memorizer, the data processing module, the control module and the data compression module that link to each other in proper order, the controller still is connected with the timer. According to the invention, the data packets are screened at the equipment end, so that a large number of invalid data packets can be filtered, the quantity of uploaded data packets is greatly saved, and the calculation overhead of the equipment end and the platform end is saved. Meanwhile, the compressed data packet is complete and clear in description of the event. Network overhead can be saved by a data packet compression mode, and packet loss is prevented.

Description

Driving data packet compression time calculation method and data packet compression device
Technical Field
The invention relates to the field of vehicle networking, in particular to a driving data packet compression time calculation method and a data packet compression device.
Background
In the large background of the internet of things, technologies for performing collision detection using vehicle-mounted devices are slowly emerging in the industry. In the collision detection technology based on the common GNSS + g-sensor device, there is a technology for uploading vehicle data to a platform in real time by using the device to perform collision detection. However, the driving data amount transmitted in real time is too large, which increases the bandwidth overhead of network transmission, easily causes network congestion and transmission delay, and pays a high communication cost (for transmitting data), and meanwhile, the device end and the platform end need to process the driving data transmitted in real time, which results in large calculation overhead.
Considering that for a single vehicle, there is much compressed data that is not relevant to collision detection, the data is not of much reference value for collision analysis, i.e., it may not be necessary to upload. Therefore, unnecessary driving data can be filtered out, and only few effective driving data can be uploaded. This requires a scheme for analyzing which part of the data packets are valid driving data packets.
Disclosure of Invention
The invention aims to: in order to solve the existing problems, the method and the device for calculating the compression time of the driving data packet determine the screening and compression time of the uploaded data packet by simply analyzing the data collected by the GNSS, the G-senser sensing equipment and the like, and compress the uploaded driving data packet, so that the uploaded data amount is reduced, and meanwhile, a plurality of data packets are compressed, so that the transmission flow and the bandwidth consumption are saved.
The technical scheme adopted by the invention is as follows:
a driving data packet compression opportunity calculation method comprises the following steps:
s001: the data acquisition module acquires driving data according to a preset sampling rule, and a corresponding data packet is obtained in each sampling; storing the sampled data packet into a memory;
s002: judging whether the speed VA of the data packet A obtained by latest sampling meets a first preset condition, if so, executing S005, and otherwise, executing S003;
s003: judging whether the acceleration of the data packet A meets a second preset condition, if so, executing S005, and otherwise, executing S004;
s004: judging whether a clock T is set by the timer or not, if so, executing S008, otherwise, executing S001;
s005: judging whether a timer has set a clock T or not, if so, executing S006, otherwise, executing S007;
s006: deleting the clock T, and executing S007;
s007: resetting a clock T;
s008: judging whether the clock T ending time is reached, if so, executing S009, otherwise, executing S001;
s009: extracting all data packets in the clock T and setting a preset time length T1 before the clock T starts from a memory;
s010: the extracted data packet is compressed in a predetermined format.
The speed and the acceleration are used as evaluation basis of the event behavior, so that the data acquisition and calculation are simpler, and the description of the event is clearer. The clock T is used as the acquisition duration of the valid data packets, the data in the time is specified as valid data when an event occurs, and the data in other times are invalid data, so that a large number of invalid data packets can be filtered. In addition, the data packets in the time T1 before the clock T are compressed together, so that the continuity of the uploaded data packets on the information can be ensured, and the driving data can be used as support for the three time points before, during and after the event. Meanwhile, the plurality of data packets are integrally compressed, so that compared with the real-time uploading of the data packets, on one hand, the data volume of transmission can be effectively saved, on the other hand, the time-sharing uploading can reduce the overhead of network bandwidth, and the phenomenon that packet loss occurs in the data uploading process is ensured.
Further, in S001, the data acquisition module acquires the driving data according to a preset sampling rule as follows: the data acquisition module acquires driving data at a sampling interval t 1. Sampling at a fixed frequency can ensure the continuity of the description of the driving behavior and the clearness of the description of the event.
Further, in S007, the sampling interval within the clock T is T2. For the determined suspected event behavior data, a higher (t 2 less than t 1) data sampling rate can be set to ensure that the data packet describes the event process more clearly and completely.
Further, in S002, the step of determining whether the speed VA of the data packet a obtained by the latest sampling meets the first preset condition is: and judging whether the speed VA of the data packet A obtained by latest sampling is smaller than a preset speed threshold V and the speed VB of the previous data packet of the data packet A is larger than the preset speed threshold V.
When an event occurs, the speed change (deceleration) is a more obvious characteristic, so that the data packets which are invalid can be preliminarily filtered out.
Further, in S003, the determining whether the acceleration of the packet a satisfies a second preset condition is: and judging whether the acceleration of the data packet A is greater than a preset acceleration threshold value a.
In an emergency, the sudden change of the acceleration (absolute value, the same applies later) is an obvious mark, and the data packet can be screened by monitoring the change rule of the acceleration, for example, the acceleration suddenly increases when the data packet collides, so that the data packet at the moment can be judged as a valid data packet.
In order to solve all or part of the problems, the invention provides a driving data packet compression device, which comprises a data acquisition module, a memory, a data processing module, a control module and a data compression module which are sequentially connected, wherein the control module is also connected with a timer, and the control module comprises:
the method comprises the following steps that in an initial state of a data acquisition module, driving data are acquired according to a preset sampling rule, and a corresponding data packet is obtained during each sampling; storing the sampled data packet into a memory;
the data processing module is used for sequentially extracting the data packets stored in the memory and analyzing whether the speed of at least one data packet obtained by latest sampling meets a first preset condition, if so, a signal S1 is sent to the control module, and if not, a signal S2 is sent to the control module; the acceleration analysis module is also used for analyzing whether the acceleration of the data packet obtained by the latest sampling meets a second preset condition, if so, a signal S3 is sent to the control module, and if not, a signal S4 is sent to the control module;
the control module is used for: when receiving the signal S1 or S3, determining whether the timer sets a clock T, if so, deleting the set clock T, and resetting a clock T, otherwise, resetting a clock T; when the signal S2 is received, the data processing module is triggered to analyze whether the acceleration of the data packet A meets a second preset condition; when a signal S4 is received, whether a clock T is set by the timer or not is judged, if yes, whether the end time of the clock T is reached or not is judged, if the end time is reached, the data compression module is controlled to extract the clock T from the memory and all data packets within a preset time length T1 before the clock T starts are set to be compressed, and if the end time is not reached, the data acquisition module is controlled to continue to acquire the data packets; if the timer is judged not to set the clock T when the signal S4 is received, the data acquisition module is controlled to continue to acquire the data packet;
the data compression module is used for compressing the data packets extracted from the memory according to a preset format.
Further, the data acquisition module has a sampling interval t1 in an initial state.
Further, the control module modifies the sampling interval of the data sampling module to T2 after setting the clock T.
Further, the data processing module analyzes whether the speed VA of the data packet a obtained by the latest sampling meets a first preset condition: and judging whether the speed VA of the data packet A obtained by latest sampling is smaller than a preset speed threshold V and the speed VB of the previous data packet of the data packet A is larger than the preset speed threshold V.
Further, the data processing module analyzes whether the acceleration of the data packet a meets a second preset condition: and judging whether the acceleration of the data packet A is greater than a preset acceleration threshold value a.
In summary, due to the adoption of the technical scheme, the invention has the beneficial effects that:
1. according to the invention, the data packets are screened at the equipment end, a large number of invalid data packets can be filtered, and the data volume uploaded by the equipment end and the calculation cost for processing the data packets can be greatly saved if the part of the data packets are not uploaded. For the screened data packets, the platform end can directly calculate, so that the calculation overhead of a large number of invalid packets in the calculation process is avoided, and the calculation cost performance of the platform end is improved.
2. The invention compresses and uploads a plurality of data packets, on one hand, the data volume of transmission is further saved, on the other hand, the bandwidth overhead can be reduced in an interval uploading mode, network congestion is prevented, and meanwhile, the data packets are compressed into the same compressed packet, so that the occurrence of packet loss can be prevented, and the integrity of the data is ensured.
3. The compressed packets to be transmitted are data collected in the clock T and a period of continuous time before the clock T, comprise data packets collected continuously in the front, middle and later periods of suspected events, and can completely and continuously describe the event behaviors.
Drawings
The invention will now be described, by way of example, with reference to the accompanying drawings, in which:
fig. 1 is a flow chart of a method for calculating a compression time of a data packet.
Fig. 2 is one embodiment of packet compression opportunity calculation.
Fig. 3 is a configuration diagram of a packet compression apparatus.
Detailed Description
All of the features disclosed in this specification, or all of the steps in any method or process so disclosed, may be combined in any combination, except combinations of features and/or steps that are mutually exclusive.
Any feature disclosed in this specification (including any accompanying claims, abstract) may be replaced by alternative features serving equivalent or similar purposes, unless expressly stated otherwise. That is, unless expressly stated otherwise, each feature is only an example of a generic series of equivalent or similar features.
As shown in fig. 1, the embodiment discloses a method for calculating a driving data packet compression time, which includes the following steps:
s001: the data acquisition module acquires driving data according to a preset sampling rule, and a corresponding data packet is obtained in each sampling; and storing the data packet obtained by sampling into a memory. Preferably, the collected data packets are stored in the memory in a cyclic duplication mode, namely if the residual capacity of the memory is enough to accommodate the driving data packet A, the data packets are directly added behind the previous driving data packet; otherwise, the data packet with the time farthest from the current time is covered by the driving data packet A, and so on, so that the storage of the data packets acquired for a long time can be finished without expanding a memory.
The driving data, that is, the state data of the vehicle operation, includes information such as speed, acceleration, angular velocity, longitude and latitude, heading, voltage, and positioning state, which can be acquired by a data acquisition module such as GNSS (Global Navigation Satellite System), G-sensor (acceleration sensor), gyroscope, OBD (On Board Diagnostics), and the like, and the acquisition principle and process are not described herein.
S002: and judging whether the speed of at least one data packet obtained by latest sampling meets a first preset condition, if so, executing S005, and otherwise, executing S003. I.e. the speed of at least one data packet closest to the current time.
S003: and judging whether the acceleration of the data packet obtained by the latest sampling meets a second preset condition, if so, executing S005, and otherwise, executing S004. I.e. the acceleration of the one packet that is the closest to the current time.
S004: and judging whether the timer has set a clock T or not, if so, executing S008, and otherwise, executing S001. That is, in the sampling period, the data packets are collected successively, and in the non-sampling period, the data packets are regarded as the data packets when non-collision occurs.
S005: it is determined whether a clock T has been set by the timer, if so, S006 is performed, otherwise, S007 is performed. That is, when a set speed or acceleration threshold condition is met, a sampling period is set to collect valid data packets.
S006: the clock T is deleted and S007 is executed. I.e. the data packets collected before this are all the data packets when no collision occurs.
S007: one clock T is reset. For example, a clock T is set to collect the following data packet, starting at the time of collision occurrence.
S008: and judging whether the clock T ending time is reached, if so, executing S009, and otherwise, executing S001. Namely, whether the data packet needing to be uploaded is acquired is judged.
S009: all packets within the clock T are extracted from memory and set a predetermined length of time T1 before the clock T begins. Namely, if the collision happens, the data packet after the collision moment is started is extracted, and the data packet a period of time before the collision happens is also extracted, so that when the judgment is carried out in the background, the data continuity exists, and the sufficient data support can be obtained.
S010: the extracted data packet is compressed in a predetermined format.
As shown in fig. 2, this embodiment discloses another driving data packet compression timing calculation method, which includes the following steps:
s001: the data acquisition module acquires the speed, the acceleration, the angular speed, the longitude and latitude, the course, the voltage and the positioning state of the vehicle at a sampling interval t1, and respectively writes the sampled data into a data packet; storing the sampled data packet into a flash storage module;
s002: and judging whether the speed VA of the data packet A obtained by latest sampling is smaller than a preset speed threshold V and the speed VB of the previous data packet of the data packet A is larger than the preset speed threshold V, if so, executing S005, and otherwise, executing S003. For example, a speed threshold V =5km/h is set, and when VA =3km/h and VB =10km/h, the operation goes to S005.
S003: and judging whether the acceleration of the data packet A is greater than a preset acceleration threshold value a, if so, executing S005, and otherwise, executing S004.
S004: and judging whether the timer has set a clock T or not, if so, executing S008, and otherwise, executing S001.
S005: it is determined whether a clock T has been set by the timer, if so, S006 is performed, otherwise, S007 is performed.
S006: the clock T is deleted and S007 is executed.
S007: one clock T is reset. The sampling interval within the clock T is T2 (corresponding to the sampling frequency F2).
S008: and judging whether the clock T ending time is reached, if so, executing S009, and otherwise, executing S001.
S009: all packets within the clock T are extracted from memory and set a predetermined length of time T1 before the clock T begins.
S010: the extracted data packet is compressed in a predetermined format.
As shown in fig. 3, this embodiment discloses a driving data packet compression device, including consecutive data acquisition module, memory, data processing module, control module and data compression module, control module still is connected with the timer, wherein:
the method comprises the following steps that in an initial state of a data acquisition module, driving data are acquired according to a preset sampling rule, and a corresponding data packet is obtained during each sampling; storing the sampled data packet into a memory;
the data processing module is used for sequentially extracting the data packets stored in the memory and analyzing whether the speed of at least one data packet obtained by latest sampling meets a first preset condition, if so, a signal S1 is sent to the control module, and if not, a signal S2 is sent to the control module; the acceleration analysis module is also used for analyzing whether the acceleration of the data packet obtained by the latest sampling meets a second preset condition, if so, a signal S3 is sent to the control module, and if not, a signal S4 is sent to the control module;
the control module is used for: when receiving the signal S1 or S3, determining whether the timer sets a clock T, if so, deleting the set clock T, and resetting a clock T, otherwise, resetting a clock T; when the signal S2 is received, the data processing module is triggered to analyze whether the acceleration of the data packet A meets a second preset condition; when a signal S4 is received, whether a clock T is set by the timer or not is judged, if yes, whether the end time of the clock T is reached or not is judged, if the end time is reached, the data compression module is controlled to extract the clock T from the memory and all data packets within a preset time length T1 before the clock T starts are set to be compressed, and if the end time is not reached, the data acquisition module is controlled to continue to acquire the data packets; if the timer is judged not to set the clock T when the signal S4 is received, the data acquisition module is controlled to continue to acquire the data packet;
the data compression module is used for compressing the data packets extracted from the memory according to a preset format.
The driving data, that is, the state data of the vehicle operation, includes information such as speed, acceleration, angular velocity, longitude and latitude, heading, voltage, and positioning state, which can be acquired by a data acquisition module such as GNSS (Global Navigation Satellite System), G-sensor (acceleration sensor), gyroscope, OBD (On Board Diagnostics), and the like, and the acquisition principle and process are not described herein. The memory generally selects a flash memory module, the timer selects a clock circuit, the data processing module selects devices with logic computing capability such as MCU and PLC, and the control module and the data processing module can be integrated into a system on chip.
In one embodiment, the data acquisition module is in an initial state with a sampling interval of t1 (corresponding to a sampling frequency of F1).
In one embodiment, the control module modifies the sampling interval of the data sampling module to T2 (corresponding to a sampling frequency of F2) after setting the clock T.
In one embodiment, the data processing module analyzes whether the speed of the at least one data packet obtained by the latest sampling satisfies a first preset condition: and judging whether the speed VA of the data packet A obtained by latest sampling is smaller than a preset speed threshold V and the speed VB of the previous data packet of the data packet A is larger than the preset speed threshold V.
In one embodiment, the data processing module analyzes whether the acceleration of the data packet obtained by the latest sampling satisfies a second preset condition: and judging whether the acceleration of the data packet A is greater than a preset acceleration threshold value a.
The present embodiment discloses the above method for compressing a data packet, which corresponds to step S010 of the above embodiment, and includes the following steps:
s101: acquiring N data packets to be compressed;
s102: initializing a data structure of the compressed packet Z;
s103: taking a first data packet or a last data packet in a data packet to be compressed as a reference packet, configuring reference data of the compressed packet based on the data contained in the reference packet, and configuring position data of a first bit position or a last bit position of the compressed packet based on the data of the reference packet;
s104: and sequentially filling the position data in each remaining data packet to be compressed and the relation data between the position data and the position data of the last compressed data packet into corresponding fields of the position data part in the Z data structure of the compressed packet in the sampling time sequence.
S105: and updating the length, the sequence number, the CRC check code and the end bit of the compressed packet Z.
In the embodiment, the data parts acquired from a plurality of data packets are correlated with each other and then compressed into the same compressed packet, and only one packet header and the end identifier are adopted, so that the data bits can be effectively saved, and meanwhile, the loss and the loss of the data packets are avoided. Compressing and uploading a plurality of data packets at intervals can reduce the requirement on transmission bandwidth.
The embodiment discloses another method for compressing a data packet, which comprises the following steps:
s101: acquiring N data packets to be compressed;
s102: initializing a data structure of a compressed packet Z, wherein the data structure comprises N updated data packets;
s103: taking a data packet closest to the current time as a reference packet, arranging reference data of a compressed packet based on data (corresponding to a reference data portion) included in the reference packet, and arranging position data of an nth bit position of the compressed packet based on data (corresponding to a position data portion) of the reference packet;
s104: the position data in each remaining data packet to be compressed (i.e. to be compressed) and the relationship data between the position data in the data packet to be compressed (i.e. the data of the data packet to be compressed) and the data of the last (i.e. latest) compressed data packet are sequentially filled into the corresponding fields of the position data part in the data structure of the compressed packet Z in the order of time of sampling. The data structure of the compressed packet Z includes fields for configuring position data of each data packet, and sequentially extracts data in the data packets in a time sequence of sampling of each packet to be compressed (for example, in a sequence from first to last if the reference packet is the first sampling packet, and in a sequence from last to last if the reference packet is the last sampling packet, that is, for example, in a sequence from last to last if the reference packet is the latest data packet, and calculates relationship data between the data and the data of the latest compressed data packet, and then assembles the rest of the extracted data (i.e., the rest of the extracted data is divided or can be understood as the rest of the extracted data is replaced by the relationship data) and the calculated relationship data into corresponding fields of the position data part of the compressed packet Z until all the packets to be compressed are compressed.
S105: and updating the length, the sequence number, the CRC check code and the end bit of the compressed packet Z. I.e. indicating the end of the compression.
The present embodiment discloses a method for compressing a non-reference packet in the previous embodiment, that is, the step S104 includes the following steps:
s1041: initializing the number i of the remaining data packets to be compressed to be N-1, and executing S1042;
s1042: judging whether i is larger than 0, if so, executing S1043, otherwise, jumping to S105;
s1043: and updating a corresponding field in the ith bit position data in the compressed packet Z based on the data of the ith data packet and the relationship between the data of the ith data packet and the data of the (i + 1) th data packet, wherein i is reduced by 1, and the step is skipped to S1042.
In a specific embodiment, the embodiment is:
s101: acquiring N data packets to be compressed from a flash storage module;
s102: initializing the data structure of the compressed packet Z, wherein the data structure comprises the number N of the update packets. The initialization process also comprises initialization start bits, protocol numbers and the like;
s103: the data packet closest to the current time is taken as a reference packet, reference data of the compressed packet is arranged based on data (same as above) included in the reference packet, and position data of the nth bit position of the compressed packet is arranged based on data (same as above) of the reference packet. Specifically, a timestamp, longitude and latitude in the reference packet are obtained and assigned to reference time, reference longitude and reference latitude in the compressed packet Z; updating longitude difference and latitude difference of the Nth position data in the compressed packet Z to be 0, acquiring course, G-sensor (acceleration sensor) triaxial value, angular velocity triaxial value, whether positioning is performed, external voltage and speed in a reference packet, and updating to corresponding fields in the Nth position data in the compressed packet Z;
s1041: initializing the number i of the remaining data packets to be compressed to be N-1, and executing S1042;
s1042: judging whether i is larger than 0, if so, executing S1043, otherwise, jumping to S105;
s1043: updating a corresponding field in the ith bit position data in the compressed packet Z based on the data of the ith data packet and the relationship between the data of the ith data packet and the data of the (i + 1) th data packet, wherein i is reduced by 1, and the step is skipped to S1042;
s105: and updating the length, the sequence number, the CRC check code and the end bit of the compressed packet Z.
The present embodiment discloses a method for updating position data of non-reference data bits in a compressed packet Z in the data packet compression method, that is, S1043 in the previous embodiment, specifically including:
s10431: performing difference operation on the longitude and latitude in the ith data packet (namely, the data for calculating the relation data part) and the longitude and latitude in the (i + 1) th data packet;
s10432: updating the longitude difference and the latitude difference (namely the relation data) of the S10431 to the longitude difference and the latitude difference of the ith position data in the compressed packet Z;
s10433: and acquiring the data of the rest part (namely the part except the longitude and latitude) in the ith data packet, updating the data to a corresponding field in the ith bit position data in the compressed packet Z, and skipping to S1042 after the value i is reduced by 1.
Specifically, S10433 is: and obtaining the course, the G-sensor triaxial value and the angular speed triaxial value in the ith data packet, whether positioning is needed, the external voltage and the speed, updating the corresponding fields in the ith position data in the Z, and skipping to S1042 after i is reduced by 1.
The invention is not limited to the foregoing embodiments. The invention extends to any novel feature or any novel combination of features disclosed in this specification and any novel method or process steps or any novel combination of features disclosed.

Claims (10)

1. A driving data packet compression opportunity calculation method is characterized by comprising the following steps:
s001: the data acquisition module acquires driving data according to a preset sampling rule, and a corresponding data packet is obtained in each sampling; storing the sampled data packet into a memory;
s002: judging whether the speed VA of at least one data packet A obtained by latest sampling meets a first preset condition, if so, executing S005, and otherwise, executing S003;
s003: judging whether the acceleration of the data packet A obtained by latest sampling meets a second preset condition, if so, executing S005, and otherwise, executing S004;
s004: judging whether a clock T is set by the timer or not, if so, executing S008, otherwise, executing S001;
s005: judging whether a timer has set a clock T or not, if so, executing S006, otherwise, executing S007;
s006: deleting the clock T, and executing S007;
s007: resetting a clock T;
s008: judging whether the clock T ending time is reached, if so, executing S009, otherwise, executing S001;
s009: extracting all data packets in the clock T and setting a preset time length T1 before the clock T starts from a memory;
s010: the extracted data packet is compressed in a predetermined format.
2. The method of claim 1, wherein in S001, the data collecting module collects the driving data according to a preset sampling rule as follows: the data acquisition module acquires driving data at a sampling interval t 1.
3. The method of claim 1, wherein in S007, the sampling interval within the clock T is T2.
4. The method according to any one of claims 1 to 3, wherein in S002, the determining whether the speed VA of the at least one data packet a obtained by the latest sampling satisfies a first preset condition is: and judging whether the speed VA of the data packet A obtained by latest sampling is smaller than a preset speed threshold V and the speed VB of the previous data packet of the data packet A is larger than the preset speed threshold V.
5. The method according to claim 4, wherein in S003, the step of determining whether the acceleration of the data packet a obtained by the latest sampling satisfies a second preset condition is: and judging whether the acceleration of the data packet A is greater than a preset acceleration threshold value a.
6. The utility model provides a driving data package compression device which characterized in that, includes consecutive data acquisition module, memory, data processing module, control module and data compression module, control module still is connected with the timer, wherein:
the method comprises the following steps that in an initial state of a data acquisition module, driving data are acquired according to a preset sampling rule, and a corresponding data packet is obtained during each sampling; storing the sampled data packet into a memory;
the data processing module is used for sequentially extracting the data packets stored in the memory and analyzing whether the speed VA of the data packet A obtained by latest sampling meets a first preset condition, if so, a signal S1 is sent to the control module, and if not, a signal S2 is sent to the control module; the acceleration detection module is also used for analyzing whether the acceleration of the data packet A meets a second preset condition, if so, a signal S3 is sent to the control module, and if not, a signal S4 is sent to the control module;
the control module is used for: when receiving the signal S1 or S3, determining whether the timer sets a clock T, if so, deleting the set clock T, and resetting a clock T, otherwise, resetting a clock T; when the signal S2 is received, the data processing module is triggered to analyze whether the acceleration of the data packet A meets a second preset condition; when a signal S4 is received, whether a clock T is set by the timer or not is judged, if yes, whether the end time of the clock T is reached or not is judged, if the end time is reached, the data compression module is controlled to extract the clock T from the memory and all data packets within a preset time length T1 before the clock T starts are set to be compressed, and if the end time is not reached, the data acquisition module is controlled to continue to acquire the data packets; if the timer is judged not to set the clock T when the signal S4 is received, the data acquisition module is controlled to continue to acquire the data packet;
the data compression module is used for compressing the data packets extracted from the memory according to a preset format.
7. The apparatus of claim 6, wherein the data acquisition module has a sampling interval of t1 in an initial state.
8. The apparatus of claim 6, wherein the control module modifies a sampling interval of the data sampling module to T2 after setting the clock T.
9. The apparatus according to any of claims 6 to 8, wherein the data processing module analyzes whether the speed VA of the data packet a obtained by the latest sampling satisfies a first preset condition: and judging whether the speed VA of the data packet A obtained by latest sampling is smaller than a preset speed threshold V and the speed VB of the previous data packet of the data packet A is larger than the preset speed threshold V.
10. The apparatus of claim 9, wherein the data processing module analyzes whether the acceleration of the data packet a satisfies a second preset condition as: and judging whether the acceleration of the data packet A is greater than a preset acceleration threshold value a.
CN201811484353.8A 2018-12-06 2018-12-06 Driving data packet compression time calculation method and data packet compression device Active CN109450926B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811484353.8A CN109450926B (en) 2018-12-06 2018-12-06 Driving data packet compression time calculation method and data packet compression device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811484353.8A CN109450926B (en) 2018-12-06 2018-12-06 Driving data packet compression time calculation method and data packet compression device

Publications (2)

Publication Number Publication Date
CN109450926A CN109450926A (en) 2019-03-08
CN109450926B true CN109450926B (en) 2021-05-25

Family

ID=65557080

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811484353.8A Active CN109450926B (en) 2018-12-06 2018-12-06 Driving data packet compression time calculation method and data packet compression device

Country Status (1)

Country Link
CN (1) CN109450926B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110045675A (en) * 2019-05-10 2019-07-23 四川航天神坤科技有限公司 Data processing method, data processing module based on PLC
CN111835700B (en) * 2019-12-04 2022-07-22 北京嘀嘀无限科技发展有限公司 Data processing method and device, electronic equipment and storage medium
CN114328622A (en) * 2021-12-28 2022-04-12 成都路行通信息技术有限公司 Data anomaly capture real-time processing method and system for large data flow type calculation

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102411677A (en) * 2011-11-29 2012-04-11 福建工程学院 Pre-processing method for data collection based on floating car
CN102800197B (en) * 2012-02-27 2014-07-16 东南大学 Preprocessing method of road section dynamic traffic stream essential data of urban road
CN103065471A (en) * 2012-12-21 2013-04-24 福建工程学院 Floating car information collection and optimization method based on active information reporting
CN103903433B (en) * 2012-12-27 2016-09-14 南京中兴新软件有限责任公司 The Real-time and Dynamic method of discrimination of a kind of road traffic state and device
CN106813669B (en) * 2015-12-01 2020-01-03 骑记(厦门)科技有限公司 Motion information correction method and device
CN107025704A (en) * 2017-03-14 2017-08-08 上海小蚁科技有限公司 Driving behavior detection method and device, drive recorder and automobile based on acceleration transducer
CN106935032B (en) * 2017-04-24 2019-12-10 日立楼宇技术(广州)有限公司 data uploading method and system for vehicle-mounted positioning terminal

Also Published As

Publication number Publication date
CN109450926A (en) 2019-03-08

Similar Documents

Publication Publication Date Title
CN109450926B (en) Driving data packet compression time calculation method and data packet compression device
US11153718B2 (en) Telematics furtherance visualization system
US11539550B2 (en) Systems and methods for detection of vehicle bus protocol using signal analysis
GB2541511A (en) Rapid traffic parameter estimation
CN109873921A (en) A kind of transmission method of image temporal stamp, analysis method and device
WO2021173120A1 (en) Systems and methods for detection of vehicle bus protocol using signal analysis
CN111613059A (en) Data processing method and equipment
CN107943859B (en) System and method for collecting, processing and feeding back mass sensor data
CN107135267B (en) Vehicle speed change data processing method and system, terminal and memory
US10098328B2 (en) Method of monitoring the physical condition and/or suitability of animal feed of ruminant animals
JP6388093B1 (en) Data transmission apparatus, data processing system, and data transmission method
CN111130674A (en) Synchronous signal acquisition method for automobile electronic control unit, electronic equipment, server and storage medium
JP6141148B2 (en) Time series recording data analyzer
CN114328622A (en) Data anomaly capture real-time processing method and system for large data flow type calculation
WO2020146947A1 (en) Dynamic data collection for vehicle tracking
CN116934995A (en) Tunnel monitoring data processing method and system for digital twin model
CN109768959B (en) Method for compressing and decompressing data packet under high-frequency sampling of GNSS (Global navigation satellite System) equipment
KR102023627B1 (en) Method and apparatus for efficient sensor data compression and decompression for low rate wireless communication
CN111724501A (en) Data synchronous acquisition method and device applied to unmanned equipment
CN114945033A (en) Vehicle end data returning method, vehicle end controller, cloud server and vehicle
CN111831959A (en) Motion data processing method, motion data processing device, terminal and computer-readable storage medium
JP6568662B2 (en) Data collection system, data collection method, client device, server device, and program
JP7190049B2 (en) Improvements in or relating to storage of accelerometer data
CN116946154A (en) Real-time vehicle weight estimation method, server and system
CN110136434A (en) A kind of data processing method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant