Communication method, apparatus, system and computer readable storage medium
Patent Information
- Application Number
- CN202110895978.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2021-08-05
- Publication Date
- 2026-10-13
- Estimated Expiration
- 2041-08-05
AI Technical Summary
[0021]本公开实施例中,第一节点接收第二节点发送的时间消息中包括第一函数、多个第一值、执行第一待执行事件的第一时段以及在第一时段内第一次执行第一待执行事件的第一起始时刻,第一节点可以根据时间信息中的多个第一值、第一函数以及第一起始时刻确定在第一时段内的多个第一执行时刻,从而在第一起始时刻和每个第一执行时刻执行第一待执行事件。在这种方式下,第一节点接收一次第二节点发送的时间消息,便能根据该时间消息包含的第一起始时刻、第一函数以及多个第一值自动计算在第一时段内执行第一待执行事件的各个第一执行时刻,从而减少了第一节点和第二节点之间的信令开销。
Smart Images

Figure CN115706631B_ABST
Abstract
Description
Technical Field
[0001] This disclosure relates to the field of communication technology, and in particular to a communication method, apparatus, system and computer-readable storage medium. Background Technology
[0002] In a communication system, one node can instruct another node when to execute an event, so that the other node executes the event at the instruction time.
[0003] In related technologies, when a node needs to instruct another node to execute a certain event at varying intervals, it usually enumerates the various times when the event should be executed in the time message sent to the other node, so that the other node can execute the event at each of those times. Summary of the Invention
[0004] The inventors noted that when the number of moments for executing a certain event is large, according to the methods in related technologies, a node needs to send multiple time messages to transmit all the enumerated moments for executing the event to another node, resulting in high signaling overhead between the two nodes.
[0005] To address the aforementioned problems, the present disclosure proposes the following solutions.
[0006] According to one aspect of the present disclosure, a communication method is provided, comprising: a first node receiving a time message sent by a second node, the time message including a first function, a plurality of first values, a first time period for executing a first event to be executed, and a first start time for the first execution of the first event to be executed within the first time period; the first node inputting each of the plurality of first values as an argument to the first function to obtain a plurality of first time intervals; the first node determining a plurality of first execution times within the first time period based on the first start time and the plurality of first time intervals, the plurality of first execution times including a plurality of sets of execution times, each set of execution times including two adjacent first execution times, and at least two sets of execution times having different time intervals between two first execution times; the first node executing the first event to be executed at the first start time and at each first execution time.
[0007] In some embodiments, the number of the plurality of first values, the plurality of first time intervals, and the plurality of first execution moments is M, the (i-1)th first time interval is the difference between the time of the i-th execution of the first event to be executed and the time of the j-th execution of the first event to be executed, j = 1 or i-1, 2 ≤ i ≤ M, and i and M are both positive integers.
[0008] In some embodiments, the time information further includes a second function and a plurality of second values, and the method further includes: the first node inputting each of the plurality of second values as an independent variable of the second function to obtain a plurality of second time intervals; the first node determining a plurality of second time periods corresponding one-to-one with the plurality of second time intervals based on the first time period and the plurality of second time intervals, wherein each second time interval is the difference between one of the start time and the end time of the first time period and the start time of a corresponding second time period; and the first node executing a second event to be executed within each second time period.
[0009] In some embodiments, the time message further includes a first time value representing the duration of each second time period; the first node determines the plurality of second time periods corresponding to the plurality of second time periods based on the first time period and the plurality of second time periods by: the first node determining the start time of the second time period corresponding to the second time period based on one of the start time and end time of the first time period and each second time period; the first node determining the end time of the second time period based on the start time of each second time period and the first time value; and the first node determining the second time period based on the start time and the end time of each second time period.
[0010] In some embodiments, the time information further includes a third function and a plurality of third values, and the method further includes: the first node determining a second start time for the first execution of the second event to be executed within each second time period; the first node inputting each of the plurality of third values as an argument of the third function to obtain a plurality of third time intervals; the first node determining a plurality of second execution times within the second time period based on the second start time and the plurality of third time intervals; the first node executing the second event to be executed within each second time period includes: the first node executing the second event to be executed at the second start time and at each second execution time within each second time period.
[0011] In some embodiments, the first event to be executed and the second event to be executed are different, and the first function and the third function are different.
[0012] In some embodiments, the time message further includes a second time value representing the difference between one of the start and end times of each second time period and the second start time within the second time period; the first node determining the second start time for the first execution of the second event to be executed within the second time period includes: the first node determining the second start time for the first execution of the second event to be executed within the second time period based on one of the start and end times of each second time period and the second time value.
[0013] In some embodiments, at least one of the plurality of first execution times and at least one of the plurality of second execution times are the same.
[0014] In some embodiments, the time interval between the two first execution moments in any two sets of execution moments is different.
[0015] In some embodiments, the time message carries the first event to be executed.
[0016] In some embodiments, the method further includes: the first node sending the execution result of the first event to be executed to the second node.
[0017] According to another aspect of the present disclosure, a communication device is provided, located in a first node, comprising: a receiving module configured to receive a time message sent by a second node, the time message including a first function, a plurality of first values, a first time period for executing a first event to be executed, and a first start time for the first execution of the first event to be executed within the first time period; a obtaining module configured to input each of the plurality of first values as an argument to the first function to obtain a plurality of first time intervals; a determining module configured to determine a plurality of first execution times within the first time period based on the first start time and the plurality of first time intervals, the plurality of first execution times including multiple sets of execution times, each set of execution times including two adjacent first execution times, and at least two sets of execution times having different time intervals between two first execution times; and an execution module configured to execute the first event to be executed at the first start time and at each first execution time.
[0018] According to another aspect of the present disclosure, a communication device is provided, located in a first node, including: a memory; and a processor coupled to the memory, the processor being configured to execute the method described in any of the above embodiments based on instructions stored in the memory.
[0019] According to another aspect of the present disclosure, a communication system is provided, comprising: a first node including the communication device described in any of the above embodiments; and a second node configured to send the time message to the first node.
[0020] According to another aspect of the present disclosure, a computer-readable storage medium is provided, including computer program instructions, wherein the computer program instructions, when executed by a processor, implement the method described in any of the above embodiments.
[0021] In this embodiment, the time message received by the first node from the second node includes a first function, multiple first values, a first time period for executing the first event to be executed, and a first start time for the first execution of the first event to be executed within the first time period. The first node can determine multiple first execution times within the first time period based on the multiple first values, the first function, and the first start time in the time information, thereby executing the first event to be executed at the first start time and at each first execution time. In this way, the first node only needs to receive a time message from the second node once to automatically calculate each first execution time for executing the first event to be executed within the first time period based on the first start time, the first function, and the multiple first values contained in the time message, thereby reducing the signaling overhead between the first node and the second node.
[0022] The technical solutions of this disclosure will be further described in detail below with reference to the accompanying drawings and embodiments. Attached Figure Description
[0023] To more clearly illustrate the technical solutions in the embodiments of this disclosure or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this disclosure. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.
[0024] Figure 1 This is a flowchart illustrating a communication method according to some embodiments of the present disclosure;
[0025] Figure 2 This is a schematic diagram illustrating the determination of a first execution moment according to some embodiments of this disclosure;
[0026] Figure 3 This is a schematic diagram illustrating the determination of a first execution moment according to other embodiments of this disclosure;
[0027] Figure 4 This is a flowchart illustrating a communication method according to other embodiments of this disclosure;
[0028] Figure 5This is a schematic diagram illustrating the determination of a second time period according to some embodiments of this disclosure;
[0029] Figure 6 This is a schematic diagram illustrating the determination of two time periods according to other embodiments of this disclosure;
[0030] Figure 7 This is a flowchart illustrating a communication method according to some embodiments of the present disclosure;
[0031] Figure 8 This is a schematic diagram illustrating the determination of a second start time according to some embodiments of the present disclosure;
[0032] Figure 9 This is a schematic diagram of the structure of a communication device according to some embodiments of the present disclosure;
[0033] Figure 10 This is a schematic diagram of the structure of a communication device according to other embodiments of the present disclosure;
[0034] Figure 11 This is a schematic diagram of the architecture of a communication system according to some embodiments of the present disclosure. Detailed Implementation
[0035] The technical solutions of the embodiments of this disclosure will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this disclosure, and not all embodiments. Based on the embodiments of this disclosure, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this disclosure.
[0036] Unless otherwise specifically stated, the relative arrangement, numerical expressions, and values of the components and steps set forth in these embodiments do not limit the scope of this disclosure.
[0037] At the same time, it should be understood that, for ease of description, the dimensions of the various parts shown in the accompanying drawings are not drawn according to actual scale.
[0038] Techniques, methods, and equipment known to those skilled in the art may not be discussed in detail, but where appropriate, such techniques, methods, and equipment should be considered part of the specification.
[0039] In all examples shown and discussed herein, any specific values should be interpreted as merely exemplary and not as limitations. Therefore, other examples of exemplary embodiments may have different values.
[0040] It should be noted that similar labels and letters in the following figures indicate similar items; therefore, once an item is defined in one figure, it does not need to be discussed further in subsequent figures.
[0041] Figure 1 This is a flowchart illustrating a communication method according to some embodiments of the present disclosure.
[0042] In step 102, the first node receives the time message sent by the second node.
[0043] Here, the time message includes a first function, multiple first values, a first time period for executing the first pending event, and a first start time for the first execution of the first pending event within the first time period.
[0044] In some embodiments, the first time period can be a relative time period, and the first node can determine the specific time period for executing the first event to be executed based on the current time of receiving the time message and the relative time period. For example, the first time period can be one hour, and the first node can determine the specific time period for executing the first event to be executed as 8:00am-9:00am based on the current time of 8:00am and the relative time period.
[0045] In other embodiments, the first time period can be an absolute time period with a defined endpoint time, during which the first node can execute the first event to be executed. For example, the first time period can be 10:00am-12:00pm, and the first node executes the first event to be executed between 10:00am and 12:00pm.
[0046] In some embodiments, the time message may also carry a first event to be executed. Thus, the first node can determine the first event to be executed based on the time information.
[0047] In some embodiments, after receiving a time message from the second node, the first node will return a message to the second node indicating whether the negotiation was successful, based on the content of the time message. If the negotiation is successful, the first node will continue to execute subsequent steps 104 to 108; if the negotiation fails, the second node will adjust the content of the time message and re-enter the negotiation process. When the negotiation fails a certain number of times, the second node will abandon the negotiation.
[0048] In step 104, the first node inputs each of the multiple first values as the independent variable of the first function to obtain multiple first time intervals.
[0049] In some embodiments, the first function may be a polynomial function, an exponential function, a logarithmic function, or a combination thereof. The dependent variable of the first function may represent the time interval between two moments.
[0050] In some embodiments, multiple first values can serve as independent variables of a first function and represent the number of times the first event to be executed is performed. For example, the first function can be a polynomial function f(k) = ∑m C 1m *k m (m∈Z), exponential function f(k)=c 21 *(c 22 ) k Or logarithmic function Where k is the independent variable of the function, and m and C are... 1m C 21 c 22 C 31 c 32 These are the corresponding function parameters. It should be understood that there is at least one c. 1m Non-zero, c 21 ≠0, c 22 >0 and ≠1, C 31 ≠0, c 32 >0 and ≠1, k is a positive integer.
[0051] In some embodiments, the unit of the first time interval can be a preset time unit in the first node, such as seconds, minutes, etc.
[0052] In step 106, the first node determines multiple first execution times within a first time period based on the first start time and multiple first time intervals.
[0053] Here, multiple first execution moments include multiple sets of execution moments, each set of execution moments includes two adjacent first execution moments, and the time interval between the two first execution moments in at least two sets of execution moments is different.
[0054] In some embodiments, the time interval between the two first execution moments in any two sets of execution moments is different.
[0055] In some embodiments, the number of multiple first values, multiple first time intervals, and multiple first execution moments is M, the (i-1)th first time interval is the difference between the time of the i-th execution of the first event to be executed and the time of the j-th execution of the first event to be executed, j = 1 or i - 1, 2 ≤ i ≤ M, and i and M are both positive integers.
[0056] For example, the first function could be f(i) = 5 * 2 i The multiple first values can be i = 2, 3, 4, and the preset time unit is minutes. Inputting each of these first values as the independent variable into the first function f(i) yields multiple first time intervals: the first time interval T... 11 For f(2) = 20 minutes, the second first time interval T 12 For f(3) = 40 minutes, the third first time interval T 13 f(4) = 80 minutes.
[0057] Assuming the first time period w1 is 8:00am-11:00am, and the first starting time t... 11 = 8:10am.
[0058] Figure 2 This is a schematic diagram illustrating the determination of a first execution moment according to some embodiments of the present disclosure.
[0059] like Figure 2 As shown, when j=1, T 11 T 12 T 13 These are the differences between the times when the first event to be executed is performed for the i=2nd, i=3rd, and i=4th times, and the times when the first event to be executed is performed for the j=1st time (i.e., the first start time).
[0060] At this point, the determined first execution times are t. 12 =8:30am, t 13 =8:50am, t 14 = 9:30am.
[0061] Figure 3 This is a schematic diagram illustrating the determination of a first execution moment according to other embodiments of this disclosure.
[0062] like Figure 3 As shown, when j = i-1, T 11 T is the difference between the time of the i=2th execution of the first pending event and the time of the j=1st execution of the first pending event (i.e., the first start time); 12 T is the difference between the time of the i=3rd execution of the first pending event and the time of the j=2nd execution of the first pending event; 13 It is the difference between the time of the execution of the first pending event in the i=4th instance and the time of the execution of the first pending event in the j=3rd instance.
[0063] At this point, the determined first execution times are t. 12 =8:30am, t 13 =9:10am, t 14 =10:30am.
[0064] In step 108, the first node executes the first event to be executed at the first start time and at each first execution time.
[0065] In some embodiments, the first node may send the execution result of the first event to be executed to the second node.
[0066] In the above embodiment, the time message received by the first node from the second node includes a first function, multiple first values, a first time period for executing the first event to be executed, and a first start time for the first execution of the first event to be executed within the first time period. The first node can determine multiple first execution times within the first time period based on the multiple first values, the first function, and the first start time in the time information, thereby executing the first event to be executed at the first start time and at each first execution time. In this way, the first node only needs to receive a time message from the second node once to automatically calculate each first execution time for executing the first event to be executed within the first time period based on the first start time, the first function, and the multiple first values contained in the time message, thereby reducing the signaling overhead between the first node and the second node.
[0067] Figure 4 This is a flowchart illustrating a communication method according to other embodiments of the present disclosure.
[0068] In step 402, the first node receives the time message sent by the second node.
[0069] Here, with Figure 1 Compared to the illustrated embodiment, the time message also includes a second function and multiple second values.
[0070] The first node can determine multiple first execution times within the first time period according to the specific implementation methods of steps 102 to 106, and execute the first event to be executed at the first start time and at each first execution time according to the specific implementation method of step 108. For detailed explanations, please refer to the relevant embodiments of steps 102 to 108, which will not be repeated here.
[0071] In some embodiments, the time message may carry a first event to be executed and a second event to be executed.
[0072] and Figure 1 Compared to the embodiments shown, Figure 4 The illustrated embodiment also includes steps 404 to 408.
[0073] In step 404, the first node inputs each of the multiple second values as an independent variable of the second function to obtain multiple second time intervals.
[0074] In some embodiments, the second function may be a polynomial function, an exponential function, a logarithmic function, or a combination thereof. The dependent variable of the second function may represent the time interval between two time periods.
[0075] In some embodiments, multiple second values can serve as independent variables of the second function and represent the number of time periods. For example, the second function can be a polynomial function f(k) = ∑ m c1m *k m (m∈Z), exponential function f(k)=c 21 *(c 22 ) k Or logarithmic function Where k is the independent variable of the function, and m and C are... 1m c 21 c 22 c 31 c 32 These are all corresponding function parameters. It should be understood that at least one c... 1m Non-zero, c 21 ≠0, C 22 >0 and ≠1, C 31 ≠0, c 32 >0 and ≠1, k is a positive integer.
[0076] In some embodiments, the unit of the second time interval can be a time unit preset in the first node, such as seconds, minutes, etc.
[0077] In step 406, the first node determines multiple second time periods corresponding to the multiple second time periods based on the first time period and the multiple second time periods.
[0078] Here, each second time interval is the difference between one of the start and end times of the first time interval and the start time of the corresponding second time interval.
[0079] It should be understood that the first node can determine the start time of the second period corresponding to each second time interval based on one of the start and end times of the first period and each second time interval.
[0080] In some embodiments, the number of multiple second values, multiple second time intervals, and multiple second periods is N. When n = 1, the n = 1st second time interval is the difference between the start time of the n = 1st second period and one of the start and end times of the first period; when n ≥ 2, the nth second time interval is the difference between the start time of the nth second period and one of the start and end times of the (n-1)th second period, 1 ≤ n ≤ N, where n and N are both positive integers.
[0081] In some embodiments, the duration of each second time period is the same as the duration of the first time period. In this case, the first node can determine the end time of each second time period based on the start time of the second time period and the duration of the first time period, thereby determining the second time period based on the start time and end time of the second time period.
[0082] In some embodiments, the time message may further include a first time value. In this case, the first node can determine the end time of the second time period based on the start time of each second time period and the first time value, thereby determining the second time period based on the start time and end time of the second time period.
[0083] It should be understood that the first time value can be used to represent the duration of each second time period.
[0084] For example, the second function could be f(n) = 5 * 2 n Multiple second values can be n = 1, 2, 3, with the preset time unit being minutes. The first second time interval T 21 For f(1) = 10 minutes, the second time interval T 22 For f(2) = 20 minutes, the third second time interval T 23 f(3) = 40 minutes.
[0085] Assume the first time period w1 is from 8:00 am to 8:30 am. The duration of each second time period is the same as that of the first time period.
[0086] Figure 5 This is a schematic diagram illustrating the determination of a second time period according to some embodiments of the present disclosure.
[0087] like Figure 5 As shown, T 21 It can be the difference between the start time of the n=1th second time period and the end time of the first time period w1; T 22 This can be the difference between the start time of the n=2nd second time period and the end time of the n=1st second time period; T 23 It is the difference between the start time of the n=3rd second time period and the end time of the n=2nd second time period.
[0088] At this point, the identified second time slots include w2-w4, with w2 being 8:40am-9:10am, w3 being 9:30am-10:00am, and w4 being 10:40am-11:10am.
[0089] Figure 6 This is a schematic diagram illustrating the determination of two time periods according to other embodiments of this disclosure.
[0090] like Figure 6 As shown, T 21 It can be the difference between the start time of the n=1th second time period and the start time of the first time period w1; T 22 This can be the difference between the start time of the n=2nd second time period and the start time of the n=1st second time period; T 23It is the difference between the start time of the n=3rd second time period and the start time of the n=2nd second time period.
[0091] At this point, the identified second time slots include w2-w4, with w2 being 8:10am-8:40am, w3 being 8:30am-9:00am, and w4 being 9:10am-9:40am.
[0092] In step 408, the first node executes the second pending event within each second time period.
[0093] In some embodiments, the first node may send the execution result of the first event to be executed and the execution result of the second event to be executed to the second node.
[0094] In the above embodiments, the first node can also automatically calculate multiple second time periods for executing the second event to be executed based on the second function, multiple second values, and the first time period contained in the time message. In this way, the first node can determine multiple first execution times for executing the first event to be executed and multiple second time periods for executing the second event to be executed by receiving a time message sent by the second node once, further reducing the signaling overhead between the first node and the second node.
[0095] In some embodiments, the first event to be executed may be different from the second event to be executed.
[0096] It should be noted that the first time period and the second time period can overlap, and the first and second pending events can be executed simultaneously within the overlapping time periods.
[0097] In the above embodiments, the first node can determine the execution time of multiple different events to be executed by receiving a time message sent by the second node, which further reduces the signaling overhead between the first node and the second node.
[0098] Figure 7 This is a flowchart illustrating a communication method according to some embodiments of the present disclosure.
[0099] In step 702, the first node receives the time message sent by the second node.
[0100] Here, with Figure 1 Compared to the illustrated embodiment, the time message also includes a second function, multiple second values, a third function, and multiple third values.
[0101] The first node can determine multiple first execution times within the first time period according to the specific implementation methods of steps 102 to 106, and execute the first event to be executed at the first start time and at each first execution time according to the specific implementation method of step 108. For detailed explanations, please refer to the relevant embodiments of steps 102 to 108, which will not be repeated here.
[0102] and Figure 1 Compared to the embodiments shown, Figure 7 The illustrated embodiment also includes steps 704 to 714.
[0103] In step 704, the first node inputs each of the multiple second values as an independent variable of the second function to obtain multiple second time intervals.
[0104] In step 706, the first node determines multiple second time periods corresponding to the multiple second time periods based on the first time period and the multiple second time periods.
[0105] The specific implementation of steps 704 to 706 is similar to that of steps 404 to 406 described above. For detailed description, please refer to the relevant embodiments in steps 404 to 406 described above, which will not be repeated here.
[0106] In step 708, the first node determines the second start time for the first execution of the second event to be executed within each second time period.
[0107] The following describes different implementation methods of step 708 with reference to different embodiments.
[0108] In some embodiments, the time message further includes a second time value, and the first node can determine the second start time of the first execution of the second event to be executed within the second time period based on one of the start time and end time of each second time period and the second time value.
[0109] It should be understood that the second time value can be used to represent the difference between one of the start and end times of each second time period and the second start time within that second time period.
[0110] In other embodiments, the first node determines the second start time for the first execution of the second event to be executed in the second time period based on at least one of the first start time, the start time and the end time of the first time period, and at least one of the start time and the end time of each second time period.
[0111] For example, the first node can determine the second start time of the first execution of the second event to be executed in the second time period based on the difference between the first start time and the start time of the first time period and the start time of each second time period; or, for another example, the first node can determine the second start time of the first execution of the second event to be executed in the second time period based on the difference between the first start time and the end time of the first time period and the end time of each second time period.
[0112] Figure 8 This is a schematic diagram illustrating the determination of a second start time according to some embodiments of the present disclosure.
[0113] like Figure 8 As shown, the first time period w1 is 8:00am-8:30am, and the first start time is t. 11 = 8:10am, the second time period w2 is 8:50am-9:20am. The difference between the first start time and the start time of the first time period is 10 minutes. Therefore, based on this difference and the start time of the second time period, the second start time t of the second event to be executed for the first time in the second time period can be determined. 21 = 9:00am.
[0114] In step 710, the first node inputs each of the multiple third values as an independent variable of the third function to obtain multiple third time intervals.
[0115] In some embodiments, the third function may be a polynomial function, an exponential function, a logarithmic function, or a combination thereof. The dependent variable of the third function may represent the time interval between two moments.
[0116] In some embodiments, multiple third values can serve as independent variables of a third function and represent the number of times a certain event to be executed is performed. For example, the third function can be a polynomial function f(k) = ∑ m C 1m *k m (m∈Z), exponential function f(k)=c 21 *(c 22 ) k Or logarithmic function Where k is the independent variable of the function, and m and c 1m C 21 C 22 C 31 C 32 These are all corresponding function parameters. It should be understood that at least one c... 1m Non-zero, c 21 ≠0, C 22 >0 and ≠1, c 31 ≠0, c 32>0 and ≠1, k is a positive integer.
[0117] In some embodiments, the unit of the third time interval can be a time unit preset in the first node, such as seconds, minutes, etc.
[0118] In step 712, the first node determines multiple second execution times within the second time period based on the second start time within each second time period and multiple third time intervals.
[0119] In some embodiments, the number of multiple third values, multiple third time intervals, and multiple third execution times is Q, the (p-1)th third time interval is the difference between the time of the p-th execution of the second event to be executed and the time of the q-th execution of the second event to be executed, q = 1 or p - 1, 2 ≤ p ≤ M, and p and M are both positive integers.
[0120] It should be understood that multiple second execution moments may include multiple sets of execution moments, each set of execution moments including two adjacent second execution moments, and the time interval between the two second execution moments in at least two sets of execution moments is different.
[0121] In some embodiments, the time interval between the two second execution times in any two sets of execution times is different.
[0122] In some embodiments, the first function and the third function may be different. In this case, the first time interval and the third time interval are different.
[0123] The specific implementation method for determining the second execution time in step 712 is similar to the specific implementation method for determining the first execution time in step 106 above. For details, please refer to the relevant embodiments in step 106 above, which will not be repeated here.
[0124] In step 714, the first node executes the second event to be executed at the second start time and at each second execution time within each second time period.
[0125] In some embodiments, at least one of the plurality of first execution moments can be the same as at least one of the plurality of second execution moments. The first and second events to be executed can be executed simultaneously at the same time.
[0126] In some embodiments, the first node sends the execution result of the first event to be executed and the execution result of the second event to be executed to the second node.
[0127] In the above embodiments, the first node can also automatically calculate the second start time of the first execution of the second event to be executed within each second time period based on the second function, multiple second values, the first time period, and the first start time contained in the time message. Furthermore, it can automatically calculate each second execution time within the second time period by combining the third function and multiple third values contained in the time message. In this way, the first node can determine multiple first execution times for executing the first event to be executed, as well as multiple second time periods for executing the second event to be executed, and the second start time and multiple second execution times within each second time period, by receiving a time message sent by the second node once, further reducing the signaling overhead between the first and second nodes.
[0128] Next, the communication method provided in the embodiments of this disclosure will be further described in conjunction with several specific application scenarios.
[0129] In one possible scenario, the terminal can act as the first node, and the base station can act as the second node. When the base station instructs the terminal to add cell A but fails, or when the cell A accessed by the terminal is not the target cell, the base station needs to instruct the terminal to measure cell A or certain target cells at varying time intervals and return the measurement results (e.g., the identifier, port, and reporting conditions of cell A or certain target cells). To avoid the need for frequent signaling interactions between the base station and the terminal to determine the various times for measurement, the communication method provided in this disclosure embodiment can be used to achieve the above-mentioned requirement.
[0130] For example, a base station can send an RRC Reconfiguration message as a time message to a terminal, and the terminal performs corresponding configuration based on this time message. When the configuration is successful, the terminal will send an RRC Reconfiguration Complete message to the base station. Subsequently, the terminal will measure cell A or certain target cells at the corresponding time according to this time message and send the measurement results to the base station.
[0131] In another possible scenario, the IoT terminal can act as the first node and the base station can act as the second node. In order to avoid network congestion caused by the IoT terminals accessing the network and performing a large amount of data interaction in a certain period of time, the base station can communicate with the IoT terminals through signaling to instruct the IoT terminals to access the network at different times to stagger the data interaction time. In this case, the communication method provided in the embodiments of this disclosure can be used to achieve the above requirements.
[0132] For example, a base station can send a time message to an IoT terminal to indicate the access period. The IoT terminal then performs corresponding configuration based on this time message. When the configuration is successful, the IoT terminal sends a configuration success message to the base station. Subsequently, the IoT terminal will access the network and perform data interaction within the corresponding time period according to this time message, and send the results of the data interaction to the base station.
[0133] In another possible scenario, the network element that reports data can act as the first node, and the network element that collects data can act as the second node. The network element that collects data can interact with the network element that reports data through signaling to instruct the network element that reports data to report data at different intervals in different time periods. In this case, the communication method provided in the embodiments of this disclosure can be used to achieve the above requirements.
[0134] For example, a network element collecting data can send a time message to a network element reporting data to instruct the reporting network element to report data at the appropriate time. The reporting network element then performs corresponding configuration based on this time message. When the configuration is successful, the reporting network element will send a configuration success message to the data collecting network element. Subsequently, network elements reporting data will report data to the data collecting network element at the corresponding time based on this time message.
[0135] The various embodiments in this specification are described in a progressive manner, with each embodiment focusing on its differences from other embodiments. Similar or identical parts between embodiments can be referred to interchangeably. For the apparatus embodiments, since they largely correspond to the method embodiments, the descriptions are relatively simple; relevant parts can be referred to the descriptions of the method embodiments.
[0136] Figure 9 This is a schematic diagram of the structure of a communication device according to some embodiments of the present disclosure.
[0137] like Figure 9 As shown, the communication device 900 includes a receiving module 901, configured to receive a time message sent by a second node. The time message includes a first function, multiple first values, a first time period for executing a first event to be executed, and a first start time for the first execution of the first event to be executed within the first time period. A obtaining module 902 is configured to input each of the multiple first values as an independent variable of the first function to obtain multiple first time intervals. A determining module 903 is configured to determine multiple first execution times within the first time period based on the first start time and the multiple first time intervals. The multiple first execution times include multiple sets of execution times, each set of execution times includes two adjacent first execution times, and the time interval between two of the two first execution times in at least two sets of execution times is different. An execution module 904 is configured to execute the first event to be executed at the first start time and at each first execution time.
[0138] Figure 10 This is a schematic diagram of the structure of a communication device according to other embodiments of the present disclosure.
[0139] like Figure 10 As shown, the communication device 1000 includes a memory 1001 and a processor 1002 coupled to the memory 1001. The processor 1002 is configured to execute the method of any of the foregoing embodiments based on instructions stored in the memory 1001.
[0140] The memory 1001 may include, for example, system memory, fixed non-volatile storage media, etc. The system memory may store, for example, an operating system, application programs, a boot loader, and other programs.
[0141] The communication device 1000 may also include an input / output interface 1003, a network interface 1004, and a storage interface 1005. These interfaces 1003, 1004, and 1005, as well as the memory 1001 and processor 1002, can be connected, for example, via a bus 1006. The input / output interface 1003 provides a connection interface for input / output devices such as a monitor, mouse, keyboard, and touchscreen. The network interface 1004 provides a connection interface for various networked devices. The storage interface 1005 provides a connection interface for external storage devices such as SD cards and USB flash drives.
[0142] Figure 11 This is a schematic diagram of the architecture of a communication system according to some embodiments of the present disclosure.
[0143] like Figure 11 As shown, the communication system 1100 includes a first node 1101 and a second node 1102. The first node 1101 includes the communication device 900 / 1000 of any of the above embodiments, and the second node 1102 is configured to send a time message to the first node 1101.
[0144] In some embodiments, the second node 1102 may also be configured to receive a time message sent by the first node 1101. The time message includes a first function, multiple first values, a first time period for executing a first event to be executed, and a first start time for the first execution of the first event to be executed within the first time period. The second node 1102 may also be configured to input each of the multiple first values as an argument to the first function to obtain multiple first time intervals. The second node 1102 may also be configured to determine multiple first execution times within the first time period based on the first start time and the multiple first time intervals. The multiple first execution times include multiple sets of execution times, each set of execution times includes two adjacent first execution times, and the time interval between two first execution times in at least two sets of execution times is different. The second node 1102 may also be configured to execute the first event to be executed at the first start time and at each first execution time. The first node 1101 may also be configured to send a time message to the second node 1102.
[0145] This disclosure also provides a computer-readable storage medium including computer program instructions that, when executed by a processor, implement the method of any of the above embodiments.
[0146] The embodiments of this disclosure have now been described in detail. To avoid obscuring the concept of this disclosure, some details known in the art have not been described. Those skilled in the art can fully understand how to implement the technical solutions disclosed herein based on the above description.
[0147] Those skilled in the art will understand that embodiments of this disclosure can be provided as methods, systems, or computer program products. Therefore, this disclosure can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this disclosure can take the form of a computer program product embodied on one or more computer-usable non-transitory storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.
[0148] This disclosure is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this disclosure. It should be understood that the functions specified in one or more flowchart illustrations and / or one or more blocks in a block diagram can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate functions for implementing the functions in the flowchart illustrations. Figure 1 One or more processes and / or boxes Figure 1A device that provides the functions specified in one or more boxes.
[0149] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.
[0150] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.
[0151] While specific embodiments of this disclosure have been described in detail by way of examples, those skilled in the art should understand that the examples are for illustrative purposes only and not intended to limit the scope of this disclosure. Those skilled in the art should understand that modifications can be made to the above embodiments or equivalent substitutions can be made to some technical features without departing from the scope and spirit of this disclosure. The scope of this disclosure is defined by the appended claims.
Claims
1. A communication method, comprising: The first node receives a time message sent by the second node. The time message includes a first function, multiple first values, a first time period for executing the first event to be executed, and a first start time for the first execution of the first event to be executed within the first time period. The first node inputs each of the plurality of first values as an argument to the first function to obtain a plurality of first time intervals; The first node determines multiple first execution times within the first time period based on the first start time and the multiple first time intervals. The multiple first execution times include multiple sets of execution times, each set of execution times includes two adjacent first execution times, and the time interval between the two first execution times in at least two sets of execution times is different. The first node executes the first event to be executed at the first start time and at each first execution time. The time message further includes a second function and multiple second values, and the method further includes: The first node inputs each of the plurality of second values as an argument to the second function to obtain a plurality of second time intervals; The first node determines a plurality of second time periods corresponding to the plurality of second time periods based on the first time period and the plurality of second time periods; The first node executes a second pending event within each second time period. The second pending event is different from the first pending event. The number of the plurality of second values, the plurality of second time intervals, and the plurality of second time periods are as follows: When n=1, the first second time interval is the difference between the start time of the first second period and one of the start and end times of the first period; when n≥2, the nth second time interval is the difference between the start time of the nth second period and one of the start and end times of the (n-1)th second period, 1≤n≤N, where n and N are both positive integers.
2. The method according to claim 1, wherein, The number of the plurality of first values, the plurality of first time intervals, and the plurality of first execution times is: , No. The first time interval is the first The time of the execution of the first pending event and the time of the first execution The difference between the times when the first event to be executed is performed. or , , .
3. The method according to claim 1, wherein, The time message also includes a first time value representing the duration of each second time period; The first node determines, based on the first time period and the plurality of second time intervals, the plurality of second time periods corresponding to each of the plurality of second time intervals, including: The first node determines the end time of each second time period based on the start time of each second time period and the first time value; The first node determines the second time period based on the start time and end time of each second time period.
4. The method according to claim 1, wherein, The time message also includes a third function and multiple third values, and the method further includes: The first node determines the second start time of the first execution of the second event to be executed within each second time period; The first node inputs each of the plurality of third values as an independent variable into the third function to obtain a plurality of third time intervals; The first node determines multiple second execution times within each second time period based on the second start time within each second time period and the multiple third time intervals; The first node executes the second pending event in each second time period, including: The first node executes the second event to be executed at the second start time and at each second execution time within each second time period.
5. The method according to claim 4, wherein, The time message also includes a second time value representing the difference between one of the start and end times of each second time period and the second start time within that second time period; The first node determines the second start time for the first execution of the second event to be executed within the second time period, including: The first node determines the second start time for the first execution of the second event to be executed within the second time period based on one of the start and end times of each second time period and the second time value.
6. The method according to claim 4, wherein, The first event to be executed is different from the second event to be executed, and the first function is different from the third function.
7. The method according to claim 4, wherein, At least one of the plurality of first execution times and at least one of the plurality of second execution times are the same.
8. The method according to claim 1, wherein, The time interval between the two first execution moments in any two sets of execution moments is different.
9. The method according to any one of claims 1-8, wherein, The time message carries the first event to be executed.
10. The method according to any one of claims 1-8, further comprising: The first node sends the execution result of the first event to be executed to the second node.
11. A communication device, located in a first node, comprising: The receiving module is configured to receive a time message sent by the second node. The time message includes a first function, multiple first values, a first time period for executing a first event to be executed, and a first start time for the first execution of the first event to be executed within the first time period. The module is configured to input each of the plurality of first values as an argument to the first function to obtain a plurality of first time intervals; The determining module is configured to determine multiple first execution times within the first time period based on the first start time and the multiple first time intervals, wherein the multiple first execution times include multiple sets of execution times, each set of execution times includes two adjacent first execution times, and the time interval between the two first execution times in at least two sets of execution times is different; The execution module is configured to execute the first event to be executed at the first start time and at each first execution time. The time message further includes a second function and multiple second values, and the communication device is configured to: Each of the plurality of second values is input into the second function as an independent variable to obtain a plurality of second time intervals; Based on the first time period and the plurality of second time periods, a plurality of second time periods corresponding to the plurality of second time periods are determined; Within each second time period, a second event to be executed is performed. This second event to be executed is different from the first event to be executed. The number of the plurality of second values, the plurality of second time intervals, and the plurality of second time periods are as follows: When n=1, the first second time interval is the difference between the start time of the first second period and one of the start and end times of the first period; when n≥2, the nth second time interval is the difference between the start time of the nth second period and one of the start and end times of the (n-1)th second period, 1≤n≤N, where n and N are both positive integers.
12. A communication device, located in a first node, comprising: Memory; as well as A processor coupled to the memory is configured to execute the method of any one of claims 1-10 based on instructions stored in the memory.
13. A communication system, comprising: The first node includes the communication device as described in claim 11 or 12; as well as The second node is configured to send the time message to the first node.
14. A computer-readable storage medium comprising computer program instructions, wherein, When the computer program instructions are executed by the processor, they implement the method described in any one of claims 1-10.
Citation Information
Patent Citations
Task determination method and related equipment
CN110990144A