Data sending method, vehicle-mounted device and vehicle machine system
By assigning priority to events in the automotive network and sending data in time segments, the problem of message signal blocking and conflict during communication between ECUs is solved, and the priority transmission of important information and data transmission stability is achieved.
Patent Information
- Application Number
- CN202411732980.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-11-29
- Publication Date
- 2025-04-18
AI Technical Summary
In modern automotive networks, when multiple ECUs communicate at the same time, message signals may be blocked and conflicted, resulting in the loss of important information, especially messages with high time sensitivity.
By dividing events into different priorities and sending them in segments in time segments, priority transmission of important information is achieved, while avoiding long-term transmission or stopping of data transmission, reducing data jitter and delay.
While ensuring priority transmission of important data, this method sends data through fragments, avoiding data instability and improving the stability and reliability of data transmission.
Smart Images
Figure CN119854229A_ABST
Abstract
Description
Technical Field
[0001] The present technology belongs to the technical field related to communication data transmission, and in particular, relates to a data sending method, a vehicle-mounted device and a vehicle-mounted system. Background Art
[0002] In modern automotive networks, communication between electronic control units (ECUs) is becoming increasingly important. However, when multiple ECUs communicate simultaneously, there may be message signal blockage and conflicts caused by sending too many messages at the same time, which may cause some important information to be lost due to blockage and conflicts when the network fluctuates. Especially for time-sensitive messages, they are greatly affected by network fluctuations.
[0003] In order to solve the above problems, in the prior art, different priorities are set and bandwidth is allocated according to the priorities. Although this method can solve the problem of some important information being lost, there is still a high possibility of packet loss and message congestion. The reason is that the bandwidth of different queues may overlap, resulting in large data jitter and delay in a time period, causing data instability, and thus leading to the possibility of packet loss. Summary of the invention
[0004] In order to solve the above problems, the present invention proposes a data transmission method, a vehicle-mounted device and a vehicle-mounted system. By dividing events into different priorities and then sending them in segments in the form of time segments, important information can be sent first, and the situation of sending data for a long time or stopping sending for a long time during the sending cycle can be avoided, thereby reducing data jitter and delay and avoiding data instability.
[0005] The purpose of the present invention is achieved through the following technical solutions:
[0006] In a first aspect, a data sending method comprises:
[0007] Acquire a sending information package, wherein the sending information package has multiple services, and the service has multiple events;
[0008] Determine a first priority of a plurality of services and a second priority of a plurality of events according to the sent information packet;
[0009] The third priority is obtained by calculating the priority of the first priority and the second priority, and all events are sorted according to the third priority to generate a sending queue;
[0010] All events are sent in slices according to the sending queue.
[0011] By obtaining a sending information packet, wherein the sending information packet has multiple services, and the service has multiple events; and according to the sending information packet, determining the first priority of the multiple services and the second priority of the multiple events; further obtaining the third priority by performing priority calculation on the first priority and the second priority, and sorting all events according to the third priority to generate a sending queue; and according to the sending queue, slicing and sending all events. Through the above method, while allowing important data to be sent first, sending data in fragments avoids data jitter caused by long-term data sending or stopping of sending, thereby making the sending more stable.
[0012] In some implementations, obtaining the sent data packet includes transmitting through a SOME / IP protocol and obtaining the sent data packet from a message configuration file of SOME / IP.
[0013] The reliability of data transmission can be further improved through the reliability of the SOME / IP protocol.
[0014] In some implementations, priority calculation is performed on the first priority and the second priority to obtain a third priority, including:
[0015] Add one to the second priority to obtain the first data;
[0016] Obtain second data by multiplying the first priority by the first data;
[0017] The target sending queue number is obtained from the sending data packet, and the second data is divided by the target sending queue number to obtain the third priority.
[0018] By acquiring and calculating the first priority and the second priority, important data can be sent first.
[0019] In some implementations, all events are sorted according to the third priority level to generate a sending queue; including:
[0020] A queue buffer is set, events are combined into multiple sending queues according to the third priority, and the sending queues are arranged according to the third priority.
[0021] By setting a queue buffer and combining the sending queues according to the third priority, important data can be sent first through the third priority sending queues.
[0022] In some implementations, all events are sent in slices according to a sending queue, including:
[0023] Sending information packets also includes each event cycle;
[0024] Get each event cycle in the sending queue and get the network cycle sent by a single queue;
[0025] The network cycle is divided into multiple cycle segments, and the sum of event cycles of the same queue is divided into multiple event cycle segments;
[0026] Send the event cycle segments in order in the cycle segments.
[0027] By dividing the queue's network cycle into multiple segments, and dividing the sum of the event cycles according to the unit length of the network cycle, the event cycle segments are sent at intervals within the network cycle, avoiding long-term sending and long-term waiting for sending states.
[0028] In some implementations, obtaining each event cycle in a sending queue and obtaining a network cycle sent by a single queue includes:
[0029] Get the event period and calculate the lowest common multiple of all event periods and set it as the network period.
[0030] The network cycle of each queue is calculated through the least common multiple to ensure that the same event can be sent completely in one cycle.
[0031] In some implementations, a network cycle is divided into a plurality of cycle segments, and a sum of event cycles in a same queue is divided into a plurality of event cycle segments; including:
[0032] The smallest cycle among all events is used as the unit time, and the network cycle is divided into multiple cycle segments according to the unit time, and the sequence numbers are set in sequence;
[0033] The total event cycle length of the event cycles of the same queue is obtained, and the total event cycle length is divided by the unit time to obtain the number of event cycle fragments required to send all event cycles of the queue, and a plurality of the event cycle fragments.
[0034] By cutting the network cycle and the total event cycle according to the minimum cycle as the unit time, the number of network cycle segments required for the total event cycle is obtained, and the transmission is arranged at intervals according to the number to prevent long transmission or long waiting states of data transmission.
[0035] In some implementations, sending event cycle segments in sequence in cycle segments includes:
[0036] Selecting the sequence number in a discrete manner according to the number of event cycle segments required;
[0037] Send the event cycle fragments in the order of the cycle fragments corresponding to the sequence numbers.
[0038] By selecting the cycle segments in a discrete manner, a long transmission time or a long waiting time for sending long data can be avoided.
[0039] In a second aspect, the present invention provides a vehicle-mounted device, the vehicle-mounted device comprising:
[0040] An information acquisition module, used for acquiring a sending information packet, wherein the sending information packet has multiple services, and the service has multiple events;
[0041] A priority acquisition module, used for determining the first priorities of multiple services and the second priorities of multiple events according to the sent information packet;
[0042] A priority arrangement module, used to obtain a third priority by performing priority calculation on the first priority and the second priority, and to sort all events according to the third priority to generate a sending queue;
[0043] The event sending module is used to slice and send all events according to the sending queue.
[0044] In a third aspect, the present invention proposes a vehicle system, including a processor, a memory, a communication interface, a communication bus and a collection device, wherein the processor and the memory are integrated in a system chip, and the system chip and the communication interface communicate with each other through the communication bus;
[0045] The memory is used to store at least one executable instruction, and the executable instruction enables the processor to execute the operation of any one of the data sending methods of the first aspect.
[0046] The beneficial effects of a data transmission method, a vehicle-mounted device and a vehicle-mounted system of the present invention are:
[0047] By obtaining a sending information packet, wherein the sending information packet has multiple services, and the service has multiple events; and according to the sending information packet, determining the first priority of the multiple services and the second priority of the multiple events; further obtaining the third priority by performing priority calculation on the first priority and the second priority, and sorting all events according to the third priority to generate a sending queue; and according to the sending queue, slicing and sending all events. Through the above method, while allowing important data to be sent first, sending data in fragments avoids data jitter caused by long-term data sending or stopping of sending, thereby making the sending more stable. BRIEF DESCRIPTION OF THE DRAWINGS
[0048] The accompanying drawings are only used to illustrate the embodiments and are not to be considered as limiting the present invention. In addition, the same reference symbols are used to represent the same components throughout the accompanying drawings. In the accompanying drawings:
[0049] Figure 1A flow chart of a data sending method of the present invention;
[0050] Figure 2 A flow chart of event slicing of a data sending method of the present invention;
[0051] Figure 3 A framework diagram of a vehicle-mounted device of the present invention;
[0052] Figure 4 The present invention is a framework diagram of a vehicle system.
[0053] Exemplary embodiments of the present invention will be described in more detail below with reference to the accompanying drawings. Although exemplary embodiments of the present invention are shown in the drawings, it should be understood that the present invention can be implemented in various forms and should not be limited to the embodiments set forth herein.
[0054] Embodiment 1:
[0055] like Figure 1 As shown, the present invention proposes a data sending method, comprising the following steps:
[0056] Step 101: Acquire a sending information packet, wherein the sending information packet has multiple services, and the service has multiple events;
[0057] Specifically, the sending information package is obtained, and the sending information package can be obtained from the configuration file in the protocol, which mainly includes the information configuration for sending, such as the name of the service, the name of the event in the service, the service size, the event size, the cycle length required for the service sending, the cycle length required for the event sending, and other basic data configurations. The configuration can be saved in a specific module in the configuration file.
[0058] The beneficial effect of this step is that by acquiring the sent information package, relevant configuration information such as the information service and event to be sent can be acquired.
[0059] Step 102: Determine first priorities of multiple services and second priorities of multiple events according to the sent information packet;
[0060] By sending the priority information in the information packet, the first priority of the service and the second priority of multiple events are obtained; generally, the first priority can be defined as N and the second priority as M.
[0061] The beneficial effect of this step is that by setting two priorities, namely, service priority and event priority, important data can be more accurately located.
[0062] Step 103: Obtain a third priority by performing priority calculation on the first priority and the second priority, and sort all events according to the third priority to generate a sending queue;
[0063] Specifically, the third priority is obtained by calculating the priority of the first priority and the second priority. More specifically, the third priority can be calculated according to the weight of the first priority and the second priority, or can be calculated according to the priority product in a superposition method. The important data in the event can be sent in advance through the third priority, so as to achieve the effect of sending important data first.
[0064] The beneficial effect of this step is that by defining the third priority level, important data can be sent first and more accurately.
[0065] Step 104: Slice and send all events according to the sending queue.
[0066] Specifically, events are sliced and sent, and important data is sent first according to priority. At the same time, events are sliced and sent, such as a 100ms sending cycle required for complete sending. By dividing 100ms into several cycles such as 5 20ms, it is possible to avoid long-term sending of periodic data and long waiting for sending in a certain time period.
[0067] By obtaining a sending information packet, wherein the sending information packet has multiple services, and the service has multiple events; and according to the sending information packet, determining the first priority of the multiple services and the second priority of the multiple events; further obtaining the third priority by performing priority calculation on the first priority and the second priority, and sorting all events according to the third priority to generate a sending queue; and according to the sending queue, slicing and sending all events. Through the above method, while allowing important data to be sent first, sending data in fragments avoids data jitter caused by long-term data sending or stopping of sending, thereby making the sending more stable.
[0068] Embodiment 2:
[0069] like Figure 2 As shown, this embodiment further optimizes and illustrates the method in Embodiment 1, the difference being that:
[0070] In some embodiments, obtaining the sent data packet includes transmitting through the SOME / IP protocol and obtaining the sent data packet from a message configuration file of the SOME / IP.
[0071] Specifically, the sending data packet can be obtained through the message configuration file of SOME / IP during SOME / IP protocol transmission. Furthermore, it can also be obtained according to the configuration file in the DBS protocol used for communication between vehicles. In other optional embodiments, the sending data packet can be obtained in the protocol selected between vehicle communications.
[0072] The reliability of data transmission can be further improved through the reliability of the SOME / IP protocol.
[0073] In some embodiments, priority calculation is performed on the first priority and the second priority to obtain a third priority, including:
[0074] Add one to the second priority to obtain the first data;
[0075] Obtain second data by multiplying the first priority by the first data;
[0076] The target sending queue number is obtained from the sending data packet, and the second data is divided by the target sending queue number to obtain the third priority.
[0077] Specifically, it can be simplified into the following formula, that is:
[0078] P=(M)*(N+1) / Q
[0079] Among them, P is the third priority, M is the first priority, N is the second priority, and Q is the number of target sending queues.
[0080] By acquiring and calculating the first priority and the second priority, important data can be sent first.
[0081] In some embodiments, all events are sorted according to the third priority level to generate a sending queue; including:
[0082] A queue buffer is set, events are combined into multiple sending queues according to the third priority, and the sending queues are arranged according to the third priority.
[0083] Specifically, a queue buffer is provided to sort and send events in the queue buffer. Further, in order to cooperate with the priority sending method of the sending end, a corresponding queue buffer is also provided at the receiving end, and the events are combined according to the priority decoding in the queue buffer of the receiving end and then sent to the ECU of the receiving end.
[0084] By setting a queue buffer and combining the sending queues according to the third priority, important data can be sent first through the third priority sending queues.
[0085] In some embodiments, all events are sent in slices according to a sending queue; including:
[0086] Sending information packets also includes each event cycle;
[0087] Step 201: Obtain each event cycle in the sending queue and obtain the network cycle sent by a single queue;
[0088] Specifically, obtain each event cycle in the same queue, and obtain the network cycle that a single queue is allowed to send. The network cycle can be set in advance, can be determined based on the sum of all events, or can be determined by the lowest common multiple of all event cycles. When determining the network cycle, generally speaking, the sending network cycle of each queue is consistent. Optionally, the network cycle sent by the sending queue of each queue may also be inconsistent. Generally speaking, the higher the priority of the event, the smaller the cycle required. Therefore, in the distribution of network cycles, the higher the priority, the smaller the network cycle sent by the queue to save the resources occupied by sending. When the sum of the event cycles in the same queue is greater than the network cycle, the network cycle of the queue can be relatively increased to adapt to the event cycle.
[0089] The beneficial effect of this step is that the sending cycle is determined by obtaining the cycle of each event, so as to avoid the situation where the queue has insufficient network cycle for sending when the event is sent.
[0090] Step 202: Divide the network cycle into a plurality of cycle segments, and divide the sum of the same event cycle into a plurality of event cycle segments;
[0091] Specifically, the network cycle is divided into multiple cycle segments. This step can be understood as the sending window and gate control theory. Each cycle segment corresponds to a time period sending window. In this cycle segment, you can send (open) or close the sending (close). The sum of the event cycles of the same queue is divided into multiple sending segments, which are set in different cycle segments, that is, sending in the sending window.
[0092] The beneficial effect of this step is that data jitter caused by multiple adjacent period segments being in a state of sending or waiting to be sent for a long time can be avoided.
[0093] Step 203: Send the event cycle segments in sequence in the cycle segments.
[0094] Specifically, different cycle segments are selected in sequence for the event cycle segments of the semicolon, that is, the sending windows are sent.
[0095] The beneficial effect of this step is that by dividing the data into different segments for sending, it is possible to avoid data jitter caused by multiple adjacent periodic segments being sent or waiting to be sent for a long time. At the same time, it is also possible to avoid network fluctuations at a certain moment, which may cause the entire data to fail to be sent.
[0096] By dividing the queue's network cycle into multiple segments, and dividing the sum of the event cycles according to the unit length of the network cycle, the event cycle segments are sent at intervals within the network cycle, avoiding long-term sending and long-term waiting for sending states.
[0097] In some embodiments, obtaining each event cycle in a sending queue and obtaining a network cycle sent by a single queue includes:
[0098] Get the event period and calculate the lowest common multiple of all event periods and set it as the network period.
[0099] Specifically, the network cycle selects the lowest common multiple. For example, if the cycle of event 1 is 50ms, the cycle of event 2 is 150ms, and the cycle of event 3 is 60ms, then 300ms is the best network cycle. The selection of the lowest common multiple can ensure that the same event can be sent completely in one queue, and can also minimize the waste of sending resources.
[0100] In some embodiments, a network cycle is divided into a plurality of cycle segments, and a sum of event cycles in a same queue is divided into a plurality of event cycle segments; including:
[0101] The smallest cycle among all events is used as the unit time, and the network cycle is divided into multiple cycle segments according to the unit time, and the sequence numbers are set in sequence;
[0102] The total event cycle length of the event cycles of the same queue is obtained, and the total event cycle length is divided by the unit time to obtain the number of event cycle fragments required to send all event cycles of the queue, and a plurality of the event cycle fragments.
[0103] Specifically, the network cycle and the sum of all event cycles in the same event queue are evenly divided by the minimum event cycle, so that the network cycle fragment of the queue and the event cycle fragment obtained by evenly dividing the sum of all event cycles in the same event queue can correspond in length, avoiding the transmission of cross-cycle fragments. By dividing the same queue by the minimum cycle of all events, the number of event cycle fragments required to send the same queue, that is, the number of cycle fragments, can be known. Generally speaking, the number of event cycle fragments required is less than the number of cycle fragments. When the number of event cycle fragments required is greater than the number of cycle fragments, the length of the queue segment can be increased and the number of cycle fragments can be increased to adapt to the sum of the event lengths of the queue.
[0104] At the same time, since the network cycle of the queue is the least common multiple of all event cycles, the network cycle sent by the queue can be evenly divided into multiple segments according to the minimum event cycle.
[0105] By cutting the network cycle and the total event cycle according to the minimum cycle as the unit time, the number of network cycle segments required for the total event cycle is obtained, and the transmission is arranged at intervals according to the number to prevent long transmission or long waiting states of data transmission.
[0106] In some embodiments, the event cycle segments are sent in sequence in the cycle segments; including:
[0107] The sequence number is selected in a discrete manner according to the number of event cycle segments required;
[0108] Send the event cycle fragments in the order of the cycle fragments corresponding to the sequence numbers.
[0109] Specifically, when the network cycle sent by the queue is evenly divided, it is sorted in sequence. For example, if the network cycle is 2000ms and the minimum event cycle is 20ms, it is divided into the first segment of 20ms with sequence number 0, the second segment of 20ms with sequence number 1, and so on, there are 100 segments. If the required number of event cycle fragments is 50, then generally, the cycle fragments selected for transmission are discrete, that is, [0, 1, 2, 4, 6, 9, 10...], etc., to avoid selecting adjacent sequence numbers as much as possible. It should be noted that, since the data is diverse, it is inevitable that the later sequence numbers are selected adjacently. In some optional embodiments, the network cycle length can be increased to adapt to the discrete selection method as much as possible to avoid long-term data transmission or the state of data waiting to be sent. The discrete selection method can refer to the following formula:
[0110] d_i=D / m_i
[0111] Among them, d_i is the required interval, D is the number of period fragments of the network cycle, that is, the number of windows, and m_i is the number of event cycle fragments required.
[0112] By selecting the cycle segments in a discrete manner, a long transmission time or a long waiting time for sending long data can be avoided.
[0113] Example 3
[0114] This embodiment specifically gives an actual application example in the SomeIP protocol based on the data sending method proposed in Embodiment 1 and Embodiment 2:
[0115] Part of the content obtained in the someip configuration file is:
[0116] Service 1 includes: event1 10ms, event2 15ms, event3 20ms, event4 30ms, event550ms, event660ms, event7 100ms, event8 150ms, event9 300ms;
[0117] Service 2 includes: event1 10ms, event2 15ms, event3 20ms, event4 30ms, event550ms, event660ms, event7 100ms, event8 150ms, event9 300ms;
[0118] Service 3 includes: event1 10ms, event2 15ms, event3 20ms, event4 30ms, event550ms, event660ms, event7 100ms, event8 150ms, event9 300ms.
[0119] The above is the someip configuration file. According to the above events, according to the least common multiple T = LCM (10, 20, 30, 50, 100, 150, 300) = 300ms, it can be seen that the minimum event cycle is 10ms, so the preset cycle segment is 300ms / 10ms = 30; and the obtained priority is:
[0120] Service1: event1, 7; Event2, 6; Even3, 5; Even4, 4; Event5, 3; Event6, 2; Event 7, 1; Event8, event9, 0;
[0121] Service2: event1, 7; Event2, 6; Event3, 5; Event4, 4; Event5, 3; Event6, 2; Event7, 1; Event8, event9, 0;
[0122] Service3: event1, 7; Event2, 6; Event3, 5; Event4, 4; Event5, 3; Event6, 2; Event7, 1; Event8, event9, 0.
[0123] At the same time, we get that the priority of Service1 is 7, the priority of Service2 is 6, and the priority of Service3 is 5. Then according to the priority calculation formula, we get the following priority queues:
[0124] Queue7: Service1_event1;
[0125] Queue6:Service1_event2,Service2_event1;
[0126] Queue5:Service1_event3,Service1_event4,Service2_event2,Service2_event3,Service3_event1;
[0127] Queue4:Service1_event5,Service2_event4,Service3_event3;
[0128] Queue3:Service1_event6,Service2_event5,Service3_event4,Service3_event5;
[0129] Queue2:Service1_event7,Service2_event6,Service2_event7,Service3_event6;
[0130] Queue1:Service1_event8,Service1_event9,Service2_event8,Service2_event9,Service3_event7,Service3_event8,Service3_event9;
[0131] Queue0: None.
[0132] The number of event cycle segments required for each queue, that is, the sum of the time periods of the same queue / the minimum time period (rounded off), is:
[0133] Queue7:1; Queue6:3; Queue5:10; Queue4:10; Queue3:19; Queue2:32; Queue1:145;
[0134] It is obvious that the number of event cycle segments required by Queue2:Queue1: exceeds the preset 30, so Queue2:Queue1 needs to increase the network cycle to adapt to this length.
[0135] In order to achieve the minimum delay and jitter, the Open window needs to be evenly distributed. The number of windows corresponding to each queue is evenly and discretely distributed in the network cycle. The specific method is, for example, Queue3: the selected cycle segment number can be [0,1,2,3,4,6,7,8,9,11,13,15,17,19,20,22,23,25,28]. Other numbers can also be selected in this way. When it exceeds, the subsequent window allocation is also selected and increased according to the discrete and even selection and increase of the network cycle.
[0136] Through external methods, important brackets can be sent first and long-time sending or long-time waiting for sending status can be avoided.
[0137] Embodiment 4:
[0138] like Figure 3 As shown, based on Embodiment 1, the present invention proposes a vehicle-mounted device, the vehicle-mounted device comprising:
[0139] The information acquisition module is used to acquire a sent information packet, wherein the sent information packet has multiple services, and the service has multiple events; the information acquisition module is used to execute step 101 to acquire the services in the sent information packet and the events in the services.
[0140] The priority acquisition module is used to acquire a transmission information packet, wherein the transmission information packet has multiple services and the service has multiple events; the priority acquisition module is used to execute step 102 to extract the priority from the services in the transmission information packet and the events in the services.
[0141] The priority arrangement module is used to obtain a third priority by calculating the first priority and the second priority, and to sort all events according to the third priority to generate a sending queue; through the priority arrangement module, step 103 is executed to calculate and arrange the priorities in the priority arrangement module.
[0142] The event sending module is used to send all events in slices according to the sending queue. Step 104 is then executed to send all events in slices.
[0143] Embodiment 5:
[0144] like Figure 4 As shown, based on Example 1, the present invention proposes a vehicle system, including a processor 401, a memory 402, a communication interface 403, a communication bus 405 and a collection device, the processor 401 and the memory 402 are integrated in a system chip, and the system chip and the communication interface 403 communicate with each other through the communication bus 405;
[0145] The memory 402 is used to store at least one executable instruction, and the executable instruction enables the processor to execute the operation of the data sending method described in Example 1.
[0146] The vehicle system may include: a processor 401, a communications interface 403, a memory 402, and a communication bus 405. The memory 402 is used to store programs. The memory 402 may include a high-speed RAM memory 402, and may also include a non-volatile memory 402, such as at least one disk memory 402.
[0147] The algorithms or displays provided herein are not inherently related to any particular computer, virtual system or other device. In addition, the embodiments of the present invention are not directed to any particular programming language.
[0148] In the description provided herein, a large number of specific details are described. However, it is understood that embodiments of the present invention can be practiced without these specific details. Similarly, in order to simplify the present invention and help understand one or more of the various inventive aspects, in the above description of exemplary embodiments of the present invention, the various features of the embodiments of the present invention are sometimes grouped together into a single embodiment, figure, or description thereof. Wherein, the claims that follow the specific embodiment are hereby expressly incorporated into the specific embodiment, wherein each claim itself is a separate embodiment of the present invention.
[0149] Those skilled in the art will appreciate that the modules in the devices in the embodiments may be adaptively changed and arranged in one or more devices different from the embodiments. The modules or units or components in the embodiments may be combined into one module or unit or component, and further may be divided into a plurality of submodules or subunits or subcomponents. Except that at least some of such features and / or processes or units are mutually exclusive.
[0150] It should be noted that the above embodiments illustrate the present invention rather than limit it, and that those skilled in the art may devise alternative embodiments without departing from the scope of the appended claims. In the claims, any reference symbol between brackets shall not be construed as a limitation on the claims. The word "comprising" does not exclude the presence of elements or steps not listed in the claims. The word "one" or "an" preceding an element does not exclude the presence of a plurality of such elements. The present invention may be implemented by means of hardware comprising a number of different elements and by means of a suitably programmed computer. In a unit claim enumerating a number of devices, several of these devices may be embodied by the same hardware item. The use of the words first, second, and third, etc. does not indicate any order. These words may be interpreted as names. The steps in the above embodiments, unless otherwise specified, should not be understood as limitations on the order of execution.
Claims
1. A data transmission method, characterized in that: include: Acquire a sending information packet, wherein the sending information packet has multiple services, and the service has multiple events; Determining, according to the sent information packet, a first priority of a plurality of the services and a second priority of a plurality of the events; Obtaining a third priority by performing priority calculation on the first priority and the second priority, and sorting all the events according to the third priority to generate a sending queue; According to the sending queue, all the events are sliced and sent.
2. The data transmission method according to claim 1, characterized in that: The obtaining of the sending data packet includes transmitting through the SOME / IP protocol and obtaining the sending data packet from a message configuration file of the SOME / IP.
3. The data transmission method according to claim 1, characterized in that: The performing priority calculation on the first priority and the second priority to obtain a third priority includes: Add one to the second priority to obtain first data; Obtain second data by multiplying the first priority by the first data; The target sending queue number is obtained from the sending data packet, and the second data is divided by the target sending queue number to obtain the third priority.
4. The data transmission method according to claim 1, characterized in that: The step of sorting all the events according to the third priority level to generate a sending queue comprises: A queue buffer is set, the events are combined into a plurality of the sending queues according to the third priority, and the sending queues are arranged according to the third priority.
5. The data transmission method according to claim 1, characterized in that: The slicing and sending of all the events according to the sending queue comprises: The sending information packet also includes each event cycle; Obtain each of the event cycles in the sending queue, and obtain a network cycle sent by a single queue; Dividing the network cycle into a plurality of cycle segments, and dividing the sum of the event cycles of the same queue into a plurality of event cycle segments; The event cycle segments are sent sequentially in the cycle segments.
6. The data transmission method according to claim 5, characterized in that: The acquiring of each event cycle in the sending queue and the acquiring of a network cycle sent by a single queue; include The event period is obtained, and the lowest common multiple of all the event periods is calculated and set as the network period.
7. The data transmission method according to claim 5, characterized in that: The step of dividing the network cycle into a plurality of cycle segments and dividing the sum of the event cycles in the same queue into a plurality of event cycle segments comprises: Taking the smallest cycle of all the events as a unit time, dividing the network cycle into a plurality of cycle segments according to the unit time, and setting sequence numbers in sequence; The total event cycle length of the event cycles of the same queue is obtained, and the total event cycle length is divided by the unit time to obtain the number of event cycle fragments required to send all the event cycles of the queue, as well as multiple event cycle fragments.
8. The data transmission method according to claim 7, characterized in that: The sending of the event cycle segments in sequence in the cycle segments comprises: Selecting the sequence number in a discrete manner according to the required number of event cycle segments; The event cycle fragments are sent in the order of the cycle fragments corresponding to the sequence numbers.
9. A vehicle-mounted device, characterized in that: include: An information acquisition module, used for acquiring a sending information packet, wherein the sending information packet has multiple services, and the service has multiple events; A priority acquisition module, used for determining the first priorities of the plurality of services and the second priorities of the plurality of events according to the sent information packet; A priority arrangement module, configured to obtain a third priority by performing priority calculation on the first priority and the second priority, and to sort all the events according to the third priority to generate a sending queue; An event sending module is used to slice and send all the events according to the sending queue.
10. A vehicle computer system, characterized in that: It includes a processor, a memory, a communication interface, a communication bus and a collection device, wherein the processor and the memory are integrated in a system chip, and the system chip and the communication interface communicate with each other through the communication bus; The memory is used to store at least one executable instruction, and the executable instruction enables the processor to execute the data sending method according to any one of claims 1-8.