Communication method, apparatus, storage medium, and system

Abstract

The application provides a communication method, device, storage medium and system, and relates to the technical field of communication. The method acquires a first parameter set, each first parameter combination in the first parameter set comprising a set of parameter values of DRX configuration parameters; based on a first closed-form solution of a first performance index and a second closed-form solution of a second performance index, a target parameter combination is selected from the first parameter set, the target parameter combination being a non-dominated solution aiming to minimize the first performance index and maximize the second performance index; and the target parameter combination is sent to a terminal device. The first performance index is used to represent the freshness of state update information successfully received by the terminal device, and the second performance index is used to represent the energy saving level of the terminal device in one update period. In this way, in the scenario of receiving state update information from a network device by using a DRX mechanism, the freshness of the state update information and the reception energy consumption of the terminal device can be considered.

Description

Technical Field

[0001] This application relates to the field of communication technology, and in particular to a communication method, apparatus, storage medium and system. Background Technology

[0002] With the development of Industrial Internet of Things (IIoT) technology, an increasing number of terminal devices (such as IIoT devices) need to receive status updates from network devices to support industrial monitoring, status awareness, and control decisions. In this scenario, terminal devices not only need to obtain the latest status updates in a timely manner, but also need to minimize their own energy consumption to meet practical requirements such as long-term online operation and low maintenance costs.

[0003] In current cellular communication systems, discontinuous reception (DRX) is typically used to reduce the power consumption of terminal devices. However, while DRX reduces power consumption, it also causes the status update information received by the terminal device to age prematurely.

[0004] Therefore, in the context of the Industrial Internet of Things (IIoT) and in scenarios where the DRX mechanism is used to receive status update information from network devices, how to balance the freshness of the status update information with the energy consumption of the receiving terminal devices has become an urgent problem to be solved. Summary of the Invention

[0005] This application provides a communication method, apparatus, storage medium, and system that, in scenarios where the DRX mechanism is used to receive status update information from network devices, can balance the freshness of the status update information with the power consumption of the terminal device.

[0006] In a first aspect, embodiments of this application propose a communication method applied to a network device. The method includes: obtaining a first parameter set, the first parameter set including multiple first parameter combinations, each first parameter combination including parameter values ​​of a set of DRX configuration parameters; selecting a target parameter combination from the first parameter set based on a predetermined first closed-form solution of a first performance index and a second closed-form solution of a second performance index, wherein the first closed-form solution refers to an explicit expression of the first performance index with respect to a set of DRX configuration parameters, the second closed-form solution refers to an explicit expression of the second performance index with respect to a set of DRX configuration parameters, and the target parameter combination is a non-dominated solution aiming to minimize the first performance index and maximize the second performance index; and sending the target parameter combination to a terminal device; wherein the first performance index is used to characterize the freshness of state update information successfully received by the terminal device, the second performance index is used to characterize the energy-saving level of the terminal device within an update cycle, and the update cycle is the time interval between two consecutive successful receptions of state update information by the terminal device.

[0007] Thus, this embodiment of the application, targeting a terminal device employing the DRX mechanism, jointly evaluates the freshness of the received state update information and the receiving power consumption of the terminal device based on a first closed-form solution of a predetermined first performance index and a second closed-form solution of a second performance index. With the objective of minimizing the average peak information age and maximizing the energy-saving factor, a non-dominated solution between the average peak information age and the energy-saving factor is obtained, thereby alleviating the contradiction between enhanced energy saving and accelerated aging of state update information in existing DRX mechanisms. Therefore, in the context of the Industrial Internet of Things (IIoT), when using the DRX mechanism to receive state update information from network devices, it can balance the freshness of the state update information and the receiving power consumption of the terminal device.

[0008] In one possible implementation, obtaining the first parameter set includes: obtaining a second parameter set, which includes an enumeration set of parameter values ​​for multiple DRX configuration parameters in a set of DRX configuration parameters; determining a third parameter set based on the Cartesian product of the enumeration sets of parameter values ​​for multiple DRX configuration parameters, which includes multiple combinations of second parameters, each combination of second parameters including a set of parameter values ​​for DRX configuration parameters; and removing second parameter combinations in the third parameter set that do not meet the constraints to obtain the first parameter set.

[0009] Thus, in this embodiment of the application, each combination of the first parameters in the final set of the first parameters can meet the protocol consistency constraints.

[0010] In one possible implementation, the selection of a target parameter combination from a first parameter set based on a first closed-form solution of a first performance index and a second closed-form solution of a second performance index includes: selecting a non-dominated solution set from the first parameter set using a multi-objective optimization algorithm based on the first and second closed-form solutions; and selecting a target parameter combination from the non-dominated solution set. The multi-objective optimization algorithm includes a non-dominated sorting genetic algorithm. The target parameter combination includes at least one of the following: in the non-dominated solution set, the non-dominated solution corresponding to the knee point, the non-dominated solution corresponding to the minimum value of the first performance index, and the non-dominated solution corresponding to the maximum value of the second performance index.

[0011] Thus, this embodiment extracts a set of compromise configurations (i.e., the non-dominated solutions corresponding to the knee points) from the non-dominated solution set, which are easy to deploy directly in engineering. This configuration achieves a high level of energy saving without significantly sacrificing state update information and can serve as the preferred recommended parameters in conventional scenarios. Furthermore, this embodiment can also provide representative alternative configurations that prioritize both freshness and energy saving, adapting to different industrial IoT scenarios.

[0012] In one possible implementation, a set of DRX configuration parameters includes at least one of the following: duration of inactive timers, duration of listener windows, duration of short DRX cycle sleep periods, duration of long DRX cycle sleep periods, and number of short DRX cycle durations.

[0013] In one possible implementation, the method further includes: constructing a state space, which includes a first state, a second state, and a third state, wherein the first state represents a non-burst state where the network device has not cached state update information, the second state represents a non-burst state where the network device has cached state update information, and the third state represents a burst state; constructing a sleep time slot advancement matrix based on the state space and the state transition probabilities between the states under the sleep time slot; constructing a listening time slot advancement matrix based on the state space and the state transition probabilities between the states under the listening time slot; and determining a first closed-form solution and a second closed-form solution based on the sleep time slot advancement matrix, the listening time slot advancement matrix, and a set of DRX configuration parameters.

[0014] Thus, by constructing a state space and deriving a first closed-form solution for the first performance index and a second closed-form solution for the second performance index, this embodiment of the application enables network devices to directly evaluate the timeliness and energy consumption performance under different sets of DRX configuration parameters. This more accurately reflects the real needs in new industrial scenarios, thereby transforming the timeliness and energy consumption evaluation problem into an analytical and computable problem. For any set of DRX configuration parameters, the corresponding first performance index can be directly obtained based on the first closed-form solution, and the corresponding second performance index can be obtained based on the second closed-form solution. This eliminates the need for repeated parameter testing through large-scale system-level simulations. By directly performing comparable and computable performance evaluations on the parameter values ​​of different sets of DRX configuration parameters, the efficiency of parameter design is significantly improved.

[0015] In one possible implementation, in the sleep time slot advancement matrix, the state transition probability between some states is related to the first arrival probability of the state update information in the non-burst state; in the listening time slot advancement matrix, the state transition probability between some states is related to the single time slot successful transmission probability, and the state transition probability between other states is related to the first arrival probability and the single time slot successful transmission probability, where the single time slot successful transmission probability represents the probability that the terminal device successfully decodes the state update information within a time slot.

[0016] Thus, this application's embodiments introduce an ON / OFF hybrid service arrival model, a block fading channel model, a P-LGFS caching strategy, and a listening indication process, and use a three-state joint state space, a sleep slot advancement matrix, and a listening slot advancement matrix for unified description. This not only reflects the waiting effect caused by the terminal device being in a sleep state, but also reflects the combined influence of service burst arrival, cache up-to-dateness, and the single-slot successful transmission probability of successful link transmission on the freshness of state update information.

[0017] In one possible implementation, a first closed-form solution and a second closed-form solution are determined based on the sleep time slot advancement matrix, the listening time slot advancement matrix, and a set of DRX configuration parameters. This includes: determining the expected update cycle duration based on the initial distribution vector corresponding to the state space, the sleep time slot advancement matrix, the listening time slot advancement matrix, and a set of DRX configuration parameters; determining the expected system time based on the initial distribution vector, the sleep time slot advancement matrix, the listening time slot advancement matrix, the first arrival probability of state update information under non-burst conditions, the single time slot successful transmission probability, and a set of DRX configuration parameters; and determining the first closed-form solution based on the expected update cycle duration and the expected system time.

[0018] Thus, embodiments of this application can construct a first closed-form solution for the first performance index in order to accurately measure the freshness of the status update information successfully received by the terminal device when using any set of DRX configuration parameters.

[0019] In one possible implementation, the first closed-form solution and the second closed-form solution are determined based on the sleep time slot advancement matrix, the listening time slot advancement matrix, and a set of DRX configuration parameters, respectively. This includes: determining the expected update cycle duration based on the initial distribution vector corresponding to the state space, the sleep time slot advancement matrix, the listening time slot advancement matrix, and a set of DRX configuration parameters; determining the expected sleep duration within an update cycle based on the initial distribution vector, the sleep time slot advancement matrix, the listening time slot advancement matrix, and a set of DRX configuration parameters; and determining the second closed-form solution based on the expected sleep duration and the expected update cycle duration.

[0020] Thus, embodiments of this application can construct a second closed-form solution for the second performance index in order to accurately measure the energy-saving level of the terminal device when using any set of DRX configuration parameters.

[0021] In one possible implementation, the expected update cycle duration is determined based on the initial distribution vector corresponding to the state space, the sleep slot advancement matrix, the listener slot advancement matrix, and a set of DRX configuration parameters. This includes: determining the expected time consumption vector based on the sleep slot advancement matrix, the listener slot advancement matrix, the listener window duration, the sleep duration of the short DRX cycle, the sleep duration of the long DRX cycle, and the number of short DRX cycles; determining the first sub-cycle transition matrix corresponding to the inactive timer based on the listener slot advancement matrix and the duration of the inactive timer; determining the first sub-cycle time consumption reward vector corresponding to the inactive timer based on the listener slot advancement matrix, the slot length, and the duration of the inactive timer; and determining the expected update cycle duration based on the initial distribution vector, the expected time consumption vector, the first sub-cycle transition matrix, and the first sub-cycle time consumption reward vector.

[0022] Thus, embodiments of this application can determine the expected update cycle duration based on the initial distribution vector, the sleep time slot advancement matrix, the listening time slot advancement matrix, and a set of DRX configuration parameters, so as to construct a first closed-form solution for the first performance index and a second closed-form solution for the second performance index.

[0023] In one possible implementation, the desired time consumption vector is determined based on the sleep time slot advancement matrix, the listening time slot advancement matrix, the listening window duration, the short DRX cycle sleep duration, the long DRX cycle sleep duration, and the number of short DRX cycles. This includes: determining the second sub-cycle transition matrix corresponding to the short DRX cycle based on the sleep time slot advancement matrix, the listening time slot advancement matrix, the short DRX cycle sleep duration, and the listening window duration; and determining the second sub-cycle time consumption vector corresponding to the short DRX cycle based on the sleep time slot advancement matrix, the listening time slot advancement matrix, the time slot length, the short DRX cycle sleep duration, and the listening window duration. The time consumption reward vector is determined as follows: Based on the sleep slot advancement matrix, the listening slot advancement matrix, the sleep duration of the long DRX cycle, and the listening window duration, the transition matrix of the third sub-cycle corresponding to the long DRX cycle is determined; Based on the sleep slot advancement matrix, the listening slot advancement matrix, the slot length, the sleep duration of the long DRX cycle, and the listening window duration, the time consumption reward vector of the third sub-cycle corresponding to the long DRX cycle is determined; Based on the second sub-cycle transition matrix, the second sub-cycle time consumption reward vector, the third sub-cycle transition matrix, the third sub-cycle time consumption reward vector, and the duration of the short DRX cycle, the expected time consumption vector is determined.

[0024] In one possible implementation, the system time expectation is determined based on the initial distribution vector, the sleep slot advancement matrix, the listening slot advancement matrix, the first arrival probability of state update information under non-burst conditions, the single-slot successful transmission probability, and a set of DRX configuration parameters. This includes: determining the expected system time reward vector based on the sleep slot advancement matrix, the listening slot advancement matrix, the first arrival probability, the single-slot successful transmission probability, the listening window duration, the short DRX cycle sleep period duration, the long DRX cycle sleep period duration, and the number of short DRX cycle durations; determining the first sub-cycle transition matrix corresponding to the inactive timer based on the listening slot advancement matrix and the duration of the inactive timer; and determining the system time expectation based on the initial distribution vector, the expected system time reward vector, and the first sub-cycle transition matrix.

[0025] Thus, embodiments of this application can determine the system time expectation based on the initial distribution vector, the sleep time slot advancement matrix, the listening time slot advancement matrix, the first arrival probability of state update information under non-burst conditions, the single time slot successful transmission probability, and a set of DRX configuration parameters, so as to construct the first closed-form solution of the first performance index.

[0026] In one possible implementation, the expected system time reward vector is determined based on the sleep time slot advancement matrix, the listening time slot advancement matrix, the first arrival probability, the single-time slot successful transmission probability, the listening window duration, the short DRX cycle sleep period duration, the long DRX cycle sleep period duration, and the number of short DRX cycles. This includes: determining the second sub-cycle transition matrix corresponding to the short DRX cycle based on the sleep time slot advancement matrix, the listening time slot advancement matrix, the short DRX cycle sleep period duration, and the listening window duration; and determining the second sub-cycle transition matrix corresponding to the long DRX cycle based on the sleep time slot advancement matrix, the listening time slot advancement matrix, the long DRX cycle sleep period duration, and the listening window duration. The third sub-cycle transition matrix; based on the sleep slot advancement matrix, the first arrival probability, the single-slot successful transmission probability, and the short DRX cycle sleep duration, the first system time expected contribution reward vector corresponding to the short DRX cycle is determined; based on the sleep slot advancement matrix, the first arrival probability, the single-slot successful transmission probability, and the long DRX cycle sleep duration, the second system time expected contribution reward vector corresponding to the long DRX cycle is determined; based on the second sub-cycle transition matrix, the first system time expected contribution reward vector, the third sub-cycle transition matrix, the second system time expected contribution reward vector, and the short DRX cycle duration, the expected system time reward vector is determined.

[0027] In one possible implementation, the expected contribution vector of the first system time for a short DRX cycle is determined based on the sleep slot advancement matrix, the first arrival probability, the single-slot successful transmission probability, and the short DRX cycle sleep duration. This includes: determining the expected first dwell time for the short DRX cycle based on the first arrival probability, the slot length, and the short DRX cycle sleep duration; determining the first system time contribution vector corresponding to the first listening slot in the short DRX cycle based on the first arrival probability and the first dwell time expectation; determining the success probability weight vector corresponding to the first listening slot based on the first arrival probability and the single-slot successful transmission probability; and determining the expected contribution vector of the first system time for a short DRX cycle based on the sleep slot advancement matrix, the short DRX cycle sleep duration, the first system time contribution vector, and the success probability weight vector.

[0028] In one possible implementation, the second system time expected contribution reward vector corresponding to the long DRX cycle is determined based on the sleep slot advancement matrix, the first arrival probability, the single-slot successful transmission probability, and the long DRX cycle sleep duration. This includes: determining the second dwell time expectation corresponding to the long DRX cycle based on the first arrival probability, the slot length, and the long DRX cycle sleep duration; determining the second system time contribution vector corresponding to the first listening slot in the long DRX cycle based on the first arrival probability and the second dwell time expectation; determining the success probability weight vector corresponding to the first listening slot based on the first arrival probability and the single-slot successful transmission probability; and determining the second system time expected contribution reward vector based on the sleep slot advancement matrix, the long DRX cycle sleep duration, the second system time contribution vector, and the success probability weight vector.

[0029] In one possible implementation, the expected sleep duration within an update cycle is determined based on the initial distribution vector, the sleep slot advancement matrix, the listening slot advancement matrix, and a set of DRX configuration parameters. This includes: determining the expected cumulative sleep reward vector based on the sleep slot advancement matrix, the listening slot advancement matrix, the slot length, the listening window duration, the sleep duration of the short DRX cycle, the sleep duration of the long DRX cycle, and the number of short DRX cycles; determining the first sub-cycle transition matrix corresponding to the inactive timer based on the listening slot advancement matrix and the duration of the inactive timer; and determining the expected sleep duration based on the initial distribution vector, the first sub-cycle transition matrix, and the expected cumulative sleep reward vector.

[0030] Thus, embodiments of this application can determine the expected sleep duration within an update cycle based on the initial distribution vector, the sleep time slot advancement matrix, the listening time slot advancement matrix, and a set of DRX configuration parameters, so as to construct a second closed-form solution for the second performance index.

[0031] In one possible implementation, the expected cumulative sleep reward vector is determined based on the sleep time slot advancement matrix, the listening time slot advancement matrix, the time slot length, the listening window duration, the short DRX cycle sleep duration, the long DRX cycle sleep duration, and the number of short DRX cycle durations. This includes: determining the second sub-cycle transition matrix corresponding to the short DRX cycle based on the sleep time slot advancement matrix, the listening time slot advancement matrix, the short DRX cycle sleep duration, and the listening window duration; determining the third sub-cycle transition matrix corresponding to the long DRX cycle based on the sleep time slot advancement matrix, the listening time slot advancement matrix, the long DRX cycle sleep duration, and the listening window duration; and determining the expected cumulative sleep reward vector based on the second sub-cycle transition matrix, the third sub-cycle transition matrix, the time slot length, the short DRX cycle sleep duration, the long DRX cycle sleep duration, and the number of short DRX cycle durations.

[0032] In one possible implementation, the terminal device is an industrial IoT device.

[0033] Secondly, embodiments of this application propose a communication device comprising a processing unit and a communication unit, which cooperate to enable the communication device to perform the functions of the network device described in the first aspect of the design. These functions can be implemented in hardware or by hardware executing corresponding software. The hardware or software includes one or more units corresponding to the aforementioned functions.

[0034] Thirdly, embodiments of this application propose a communication device including at least one processor coupled to a memory storing a program or instructions. The processor executes the program or instructions to cause the communication device to perform the communication method in any of the possible implementations of the first aspect described above. Optionally, the communication device further includes a communication interface, with the processor coupled to the communication interface.

[0035] In one implementation, the communication interface can be a transceiver or an input / output interface.

[0036] In another implementation, the communication device is a chip configured in a network device. When the communication device is a chip configured in a network device, the communication interface can be an input / output interface.

[0037] Fourthly, embodiments of this application propose a processor, including: an input circuit, an output circuit, and a processing circuit. The processing circuit is used to receive signals through the input circuit and transmit signals through the output circuit, causing the processor to execute the communication method in any possible implementation of the first aspect described above.

[0038] In specific implementation, the processor can be one or more chips, the input circuit can be input pins, the output circuit can be output pins, and the processing circuit can be transistors, gate circuits, flip-flops, and various logic circuits. The input signal received by the input circuit can be received and input by, for example, but not limited to, a receiver, and the signal output by the output circuit can be, for example, but not limited to, output to and transmitted by a transmitter. Furthermore, the input circuit and the output circuit can be the same circuit, which is used as both the input circuit and the output circuit at different times. This application does not limit the specific implementation of the processor and various circuits.

[0039] Fifthly, embodiments of this application propose a computer-readable storage medium storing a computer program or instructions that, when executed, implement the communication method in any possible implementation of the first aspect described above.

[0040] In a sixth aspect, embodiments of this application provide a computer program product comprising a computer program that, when run, causes a computer to perform the communication method in any of the possible implementations of the first aspect described above.

[0041] In a seventh aspect, embodiments of this application propose a chip system including one or more processors. These processors are configured to retrieve and execute instructions stored in a memory, causing the communication method described in any possible implementation of the first aspect to be executed. The chip system may be composed of chips or may include chips and other discrete devices.

[0042] The chip system may include input circuits or interfaces for transmitting information or data, and output circuits or interfaces for receiving information or data.

[0043] Eighthly, embodiments of this application propose a communication system including a terminal device and a network device. The network device is used to execute the communication method in any possible implementation of the first aspect described above, and the terminal device is used to receive a combination of target parameters from the network device. Optionally, the communication system may also include other devices that communicate with the terminal device and / or the network device.

[0044] The possible implementations of aspects two through eight have effects similar to those of aspect one and the possible designs of aspect one, and will not be elaborated upon here. Attached Figure Description

[0045] Figure 1 This is a schematic diagram of the structure of a communication system provided in an embodiment of this application; Figure 2This is a schematic diagram of DRX state transitions provided in an embodiment of this application; Figure 3 This is a schematic diagram of DRX state transition when state update information arrives under the DRX mechanism, provided in an embodiment of this application. Figure 4 This is a schematic diagram illustrating the evolution of the information age of a terminal device when state update information arrives under the DRX mechanism, provided in an embodiment of this application. Figure 5 This is a flowchart illustrating a communication method provided in an embodiment of this application; Figure 6 This is a schematic diagram of the block fading channel model provided in an embodiment of this application; Figure 7 This is a simulation diagram of the first and second performance indicators corresponding to the non-dominated solution set selected by the non-dominated sorting genetic algorithm provided in the embodiments of this application; Figure 8 This is a schematic block diagram of a communication device provided in an embodiment of this application; Figure 9 This is a schematic diagram of another communication device provided in an embodiment of this application. Detailed Implementation

[0046] In the embodiments of this application, the terms "first," "second," etc., are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of indicated technical features. Therefore, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of this embodiment, unless otherwise stated, "multiple" means two or more.

[0047] It should be noted that, in the description of the embodiments of this application, unless otherwise stated, " / " means "or," for example, A / B can mean A or B; the "and / or" in this document is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, and B existing alone. Furthermore, in the description of the embodiments of this application, "multiple" refers to two or more than two.

[0048] It should also be noted that in the embodiments of this application, "preset", "fixed value", etc. can be implemented by pre-saving the corresponding code, table or other means that can be used to indicate relevant information in the electronic device. This application does not limit the specific implementation method.

[0049] It should be understood that the methods, situations, categories, and classifications of embodiments in this application are for the convenience of description only and should not constitute a special limitation. Various methods, categories, situations, and features in embodiments can be combined with each other without contradiction.

[0050] It should also be understood that, in the description of this embodiment, unless otherwise stated, "multiple" means two or more. In the various embodiments of this application, the sequence number of each process does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application.

[0051] The technical solutions provided in this application can be applied to various communication systems, such as: Global System for Mobile Communications (GSM), General Packet Radio Service (GPRS), Wireless Local Area Network (WLAN), Long Term Evolution (LTE), LTE Frequency Division Duplex (FDD), LTE Time Division Duplex (TDD), sidelink communication systems, Universal Mobile Telecommunication System (UMTS), Worldwide Interoperability for Microwave Access (WiMAX), non-terrestrial network (NTN), 5th generation (5G) mobile communication systems, or new radio access technologies. Among these, 5G mobile communication systems may include non-standalone (NSA) and / or standalone (SA) networking. The technical solutions provided in this application can also be applied to future communication systems, such as 6th generation mobile communication systems. This application does not limit these applications.

[0052] Figure 1 This is a schematic diagram of the structure of a communication system provided in an embodiment of this application. For example... Figure 1 As shown, the communication system may include network devices, such as... Figure 1 The network device 100 shown. The communication system may also include terminal devices, such as... Figure 1The terminal device 200 is shown. The network device 100 and the terminal device 200 can communicate via a wireless link.

[0053] Figure 1 An exemplary network device 100 and a terminal device 200 are shown. Optionally, the communication system may also include multiple network devices and / or multiple terminal devices.

[0054] The network device in this application embodiment can be a network-side device such as an access network or core network device. Access network devices are sometimes also called access nodes. Access network devices have wireless transceiver capabilities for communicating with terminal devices. Access network equipment includes, but is not limited to, base stations, evolved NodeBs (eNodeBs), radio network controllers (RNCs), node Bs (NBs), base station controllers (BSCs), base transceiver stations (BTSs), home base stations (e.g., home evolved node Bs or home node Bs (HNBs)), access points (APs), wireless relay nodes, wireless backhaul nodes, transmission points (TPs), or transmission and reception points (TRPs / TPs) in wireless fidelity (Wi-Fi) systems, next-generation NodeBs (gNBs) in 5G mobile communication systems, access network equipment or modules of access network equipment in open RAN (ORAN) systems, satellites in NTN communication systems, base stations in future mobile communication systems, or access nodes in Wi-Fi systems. Access network equipment can also be modules or units capable of implementing some of the functions of a base station. Access network equipment can be macro base stations, micro base stations, indoor stations, relay nodes, donor nodes, or wireless controllers in cloud radio access network (CRAN) scenarios. Optionally, access network equipment can also be servers, wearable devices, or vehicle-mounted devices. Multiple access network devices in a communication system can be base stations of the same type or different types. Base stations can communicate with terminal devices or through relay stations. Terminal devices can communicate with multiple base stations using different access technologies. The embodiments of this application do not limit the specific technologies or device forms used in the access network equipment. In the embodiments of this application, access network equipment is referred to as network equipment.

[0055] In this application embodiment, the device for implementing the function of the network device can be the network device itself, or it can be any device capable of supporting the network device in implementing that function, such as a processor, circuit, chip, or chip system. This device can be installed in the network device or connected to and used with the network device. In the technical solution provided in this application, the example of a network device being used to implement the function of the network device is used to describe the technical solution provided in this application.

[0056] The terminal device in this application embodiment can be a wireless terminal device capable of receiving network device scheduling and instruction information. The wireless terminal device can be a device providing voice and / or data connectivity to a user, a handheld device with wireless connectivity, or other processing devices connected to a wireless modem. For example, the terminal device can communicate with one or more core networks or the Internet via a radio access network (RAN). The terminal device can also be referred to as a terminal, user equipment (UE), mobile station (MS), mobile terminal (MT), etc. Terminal devices can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), Internet of Things (IoT), ultra-reliable low-latency communication (URLLC), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, smart transportation, smart cities, or satellite communication, etc. The terminal can be a mobile phone, tablet computer, laptop computer, PDA, mobile internet device (MID), wearable device, virtual reality (VR) device, augmented reality (AR) device, wireless terminal in industrial control, wireless terminal in self-driving, wireless terminal in remote medical surgery, wireless terminal in smart grid, wireless terminal in transportation safety, wireless terminal in smart city, or wireless terminal in smart home, etc. This application does not limit the specific technology or device form used in the terminal device.

[0057] In the embodiments of this application, the device for implementing the functions of the terminal device can be the terminal device itself, or any device capable of supporting the terminal device in implementing the functions, such as a processor, circuit, chip, or chip system. This device can be installed in the terminal device or connected to and used with the terminal device. In the technical solutions provided in this application, the terminal device is used as an example to illustrate the technical solutions provided in this application.

[0058] Access network equipment and / or terminal equipment can be fixed or mobile. They can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; on water; or in the air on aircraft, balloons, and satellites. This application does not limit the application scenarios of the access network equipment and terminal equipment. They can be deployed in the same or different scenarios; for example, both can be deployed on land simultaneously; or the access network equipment can be deployed on land while the terminal equipment is deployed on water, etc., and so on.

[0059] In practical applications, multiple network devices can collaborate to assist terminal devices in achieving wireless access, with different network devices each implementing a portion of the base station's functions. For example, network devices can be central units (CUs), distributed units (DUs), CU-control plane (CP) nodes, CU-user plane (UP) nodes, or radio units (RUs), etc. CUs and DUs can be set up separately or included in the same network element, such as a baseband unit (BBU). RUs can be included in radio frequency equipment or radio frequency units, such as remote radio units (RRUs), active antenna units (AAUs), or remote radio heads (RRHs).

[0060] In different systems, CU (or CU-CP and CU-UP), DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an ORAN system, CU can also be called O-CU (Open CU), DU can also be called O-DU, CU-CP can also be called O-CU-CP, CU-UP can also be called O-CU-UP, and RU can also be called O-RU. Any of the units among CU (or CU-CP, CU-UP), DU, and RU in the embodiments of this application can be implemented through software modules, hardware modules, or a combination of software modules and hardware modules. CU (or CU-CP and CU-UP), DU, and RU can implement different protocol layer functions.

[0061] To facilitate understanding of the technical solutions in the embodiments of this application, some terms involved in the embodiments of this application are briefly explained below. Optionally, the explanation of some terms can also refer to the explanation in the 3rd Generation Partnership Project (3GPP) standard protocol. It should be understood that the technical terms in this application are only examples and not limitations. For example, as technology evolves, technical terms may also change; where the technical meaning is the same, other technical terms should also apply to this application.

[0062] 1. Industrial Internet of Things The Industrial Internet of Things (IIoT) integrates various data acquisition and control sensors or controllers with sensing and monitoring capabilities, as well as technologies such as mobile communication and intelligent analysis, into all aspects of the industrial production process. This significantly improves manufacturing efficiency, enhances product quality, reduces product costs and resource consumption, and ultimately elevates traditional industries to a new stage of intelligent manufacturing.

[0063] For example, the terminal device described above can be an industrial IoT device. For instance, industrial IoT devices include, but are not limited to, actuators such as sensors and robotic arms, or other devices installed on factory equipment.

[0064] 2. DRX Mechanism To reduce the power consumption of receiving devices, the 3GPP standard protocol introduced the DRX mechanism. Terminal devices configured with DRX are divided into "wake-up state" and "sleep state." In the "wake-up state," the terminal device continuously monitors the physical downlink control channel (PDCCH) to detect downlink service scheduling or status updates. After remaining in the "wake-up state" for a period, the terminal device enters the "sleep state," during which it no longer monitors the PDCCH, thus saving power. The "wake-up state" can also be referred to as the "active phase" or "active period," while the "sleep state" can be referred to as the "inactive period," "inactive time period," or "sleep phase."

[0065] For example, a DRX cycle is as follows Figure 2 As shown: When a terminal device is in the active phase, if it is receiving status update information, the terminal device remains in the active phase. If the terminal device completes receiving the status update information, it starts an inactivity timer. After starting the inactivity timer, if the terminal device successfully receives new status update information within the inactivity timer's duration, the terminal device returns to the active phase. If the terminal device does not successfully receive new status update information within the inactivity timer's duration, the terminal device enters the short DRX cycle phase when the inactivity timer expires.

[0066] The short DRX cycle phase consists of alternating short DRX cycle listening windows and short DRX cycle sleep periods. While the terminal device is in a short DRX cycle listening window, it can listen for status updates. If a new status update is successfully received within the listening window's duration, the terminal device returns to the active phase. If no new status update is successfully received within the listening window's duration, the terminal device enters the short DRX cycle sleep period when the listening window expires. Upon the expiration of the short DRX cycle sleep period, the terminal device enters the next short DRX cycle listening window. Thus, if the terminal device accumulates the number of short DRX cycle periods without successfully receiving a new status update, it enters the long DRX cycle phase.

[0067] The long DRX cycle phase consists of alternating long DRX cycle listening windows and long DRX cycle sleep periods. While the terminal device is in a long DRX cycle listening window, it can listen for status updates. If a new status update is successfully received within the listening window's duration, the terminal device returns to the active phase. If no new status update is successfully received within the listening window's duration, the terminal device enters the long DRX cycle sleep period when the listening window expires. Upon the expiration of the long DRX cycle sleep period, the terminal device enters the next long DRX cycle listening window.

[0068] Therefore, this application adopts the DRX mechanism, enabling the terminal device to switch between multiple phases, including the active period, inactive timer, short DRX period phase, and long DRX period phase. Specifically, the terminal device can activate the receiving link within the short and long DRX period listening windows, and then hibernate during the short and long DRX period sleep phases to reduce power consumption. However, hibernation also introduces additional waiting time, thus affecting the timeliness of the status update information received by the terminal device.

[0069] The duration of the inactive timer is... This indicates the duration of the inactive timer. Each time slot. The duration of the inactive timer indicates the length of time the terminal device remains in a receptive state after a service session ends.

[0070] The duration of the listening window for short and long DRX cycles is... This indicates the duration of the listening window. The listening window duration represents the length of time slot during which the terminal device activates the receive link, listens for and attempts to receive state update information during both the short and long DRX cycle phases. A longer listening window duration increases the probability of the terminal device successfully receiving state update information; however, it also increases the terminal device's receiving power consumption.

[0071] Short DRX cycle sleep duration is It indicates that the duration of a short DRX cycle sleep period is Each time slot. Short DRX cycle sleep duration represents the sleep duration between two adjacent listening windows during a short DRX cycle phase.

[0072] The duration of long DRX cycle sleep is This indicates that the duration of the long DRX cycle sleep period is Each time slot. The duration of a long DRX cycle sleep period represents the sleep duration between two adjacent listening windows during a long DRX cycle. Typically, the duration of a long DRX cycle sleep period... Greater than or equal to the duration of short DRX sleep cycles .

[0073] The number of short DRX cycles is This indicates the maximum number of short DRX cycles a terminal device experiences before entering a long DRX cycle phase. It is used to adjust the speed at which the terminal device transitions from more aggressive listening to more energy-efficient sleep mode.

[0074] 3. Age of information (AoI) Information age refers to the time elapsed since the latest status update information received by the terminal device was generated, and is used to measure the freshness of the status update information. The smaller the information age, the fresher the status update information received by the terminal device.

[0075] 4. Average peak age of information (APAoI) Average peak information age refers to the average of the peak AoI values ​​between two consecutive successful receptions of status update information by the terminal device, used to characterize the worst-case timeliness level of the system within the update interval.

[0076] 5. Energy-saving factor The energy saving factor is an indicator used to measure the energy saving effect of terminal equipment due to the DRX sleep mechanism within a replacement cycle.

[0077] 6. Non-dominated sorting genetic algorithm (NSGA) Non-dominated sorting genetic algorithms are multi-objective optimization algorithms used to solve problems with multiple conflicting objectives. Among them, non-dominated sorting genetic algorithms can include the second-generation non-dominated sorting genetic algorithm (NSGA-II), which guides the population towards the Pareto optimal front through fast non-dominated sorting, crowding calculation, and elite policy preservation, thereby obtaining a set of non-dominated solutions with good distribution and convergence.

[0078] 7. Non-dominated solutions In multi-objective optimization problems, a solution is considered dominant if it is better than another solution on one objective and at least as good as the other solution on other objectives. If no other feasible solution dominates the other solution, then the solution is called a non-dominated solution.

[0079] Therefore, in a multi-objective optimization problem, a solution that is not dominated by other feasible solutions can be called a non-dominated solution, and the set of multiple non-dominated solutions can be called the non-dominated solution set. The mapping of all non-dominated solutions in the objective space constitutes the Pareto front. For a bi-objective optimization problem, the Pareto front is usually a curve. If any solution on the Pareto front is to continue to improve one objective, it usually comes at the expense of the other objective, and thus can serve as a set of candidate configurations for engineering selection.

[0080] 8. Markov Chain A Markov chain is a stochastic process in a state space that moves from one state to another, where the probability distribution of the next state depends only on the current state and is independent of past states.

[0081] With the development of Industrial Internet of Things (IIoT) technology, an increasing number of terminal devices (such as IIoT devices) need to receive status updates from network devices to support industrial monitoring, status awareness, and control decision-making. In this scenario, terminal devices not only need to obtain the latest status updates in a timely manner but also need to minimize their own energy consumption to meet practical requirements such as long-term online operation and low maintenance costs. Therefore, the timeliness of status updates and the energy efficiency of terminal devices have become two important aspects that need to be considered simultaneously in IIoT systems.

[0082] In current cellular communication systems, the DRX mechanism is commonly used to reduce the power consumption of terminal devices. The basic idea of ​​the DRX mechanism is that the terminal device does not always remain in a receiving state, but rather opens the receiving link within a predetermined listening window and enters a sleep state at other times. This can effectively reduce the power consumption caused by the terminal device continuously listening for status update information.

[0083] In 3GPP standard protocols, the DRX mechanism typically uses the duration of an inactive timer. Listening window duration Short DRX cycle sleep duration Long DRX cycle sleep duration and the number of short DRX cycles These parameters control the switching between the wake-up state and the sleep state of the terminal device. These parameters directly determine the set of time slots in which the terminal device can receive status update information.

[0084] For example, in practical applications, such as Figure 3 As shown, state update information is generated and cached by the network device, and the terminal device can receive state update information from the network device via the downlink within an inactive timer and listening window. For example, in At any given time, if the terminal device is in the active phase and a status update message arrives from the network device, the network device can send the status update message to the terminal device. After the terminal device receives the status update message, it starts an inactivity timer. The duration of the inactivity timer is... If no new status update is successfully received, the inactive timer will continue for the specified duration. Upon expiration, the terminal device enters a short DRX cycle phase. This short DRX cycle phase includes periodically occurring short DRX cycle listening windows and short DRX cycle sleep periods between adjacent listening windows. The duration of the listening window during the short DRX cycle listening window for the terminal device is specified. If no new status update is successfully received within the listening window, then the listening window will remain open for the specified duration. When the expiration date arrives, the terminal device enters a short DRX cycle sleep period.

[0085] exist At any given time, if the terminal device is in a short DRX cycle sleep period and a new status update arrives from the network device, the network device will not send the status update to the terminal device but will cache it. Furthermore, when the short DRX cycle sleep period expires, the terminal device enters the next short DRX cycle listening window. At this time, the network device can... The cached state update information is sent to the terminal device in real time. When the terminal device successfully receives new status update information, it returns to the activation period.

[0086] exist At any given time, if the terminal device is in the active phase and a new status update arrives from the network device, the network device can send the status update to the terminal device. However, if the channel transmission of this status update fails, the inactivity timer will pause for the duration of the inactivity timer. Upon expiration, the terminal device re-enters the short DRX cycle phase. The duration of the listening window during the short DRX cycle listening window for the terminal device is... If no new status update is successfully received within the listening window, then the listening window will remain open for the specified duration. When the short DRX cycle expires, the terminal device enters a short DRX cycle sleep period. Upon the expiration of the short DRX cycle sleep period, the terminal device enters the next short DRX cycle listening window. If the terminal device accumulates the number of short DRX cycle periods without successfully receiving a new status update, it enters a long DRX cycle phase.

[0087] The long DRX cycle phase includes periodically occurring long DRX cycle listening windows and long DRX cycle sleep periods between adjacent long DRX cycle listening windows. The duration of the terminal device's listening window within the long DRX cycle listening window is also specified. If no new status update is successfully received within the listening window, then the listening window will remain open for the specified duration. Upon expiration, the terminal device enters a long DRX cycle sleep period. At any given time, if the terminal device is in a long DRX cycle sleep period and a new status update arrives from the network device, the network device will not send the status update to the terminal device but will cache it. Furthermore, when the long DRX cycle sleep period expires, the terminal device enters the next long DRX cycle listening window. At this time, the network device can... The cached state update information is sent to the terminal device in real time. When the terminal device successfully receives new status update information, it returns to the activation period.

[0088] DRX state transitions upon arrival of status update information, such as... Figure 3 In the case shown, analysis yields the following results: Figure 4 The diagram shows the evolution of the information age of the terminal device when the status update information arrives.

[0089] like Figure 4 As shown, the horizontal axis represents time t in milliseconds (ms), and the vertical axis represents the Information Age (AoI) in milliseconds. If a terminal device successfully receives a new status update at a certain listening time, the information age after successful reception should be reset to the system time / latency from the generation of the status update to its reception. There are generally two scenarios for the state update from generation to reception: one is a time delay difference, in which case the reset result corresponds to the system time / latency; the other is no time delay difference, in which case the reset result is 0. The information age of the terminal device between two consecutive successful receptions of status updates will continuously increase over time, forming a sawtooth evolution trajectory.

[0090] in, express The age of the information in the status update information received by the terminal device at any time. express The age of the information in the status update information received by the terminal device at any time. express The age of the information in the status update information received by the terminal device at any time. express The system time from the generation to the receipt of the status update information received by the terminal device. express The system time from the generation to the receipt of the status update information received by the terminal device. express The update cycle between the status update information received by the terminal device and the last status update information received by the terminal device. express The status update information received by the terminal device at any time and The update cycle duration between status update messages received by the terminal device at any given time. express The status update information received by the terminal device at any time and The update cycle duration between status update information received by the terminal device at any given time.

[0091] Therefore, under the DRX mechanism, the arrival time of state update information from the network device and the receiving time of the terminal device usually do not coincide. This results in a waiting period for receiving state update information while reducing reception power consumption using the DRX mechanism. When the network device generates new state update information, if the terminal device is in sleep mode, this update information usually cannot be received immediately and must wait for the next listening window. While this saves reception power, it causes the received state update information to become outdated, thus affecting monitoring and control effectiveness in industrial scenarios. Therefore, a conflict arises between the freshness of the received state update information and the energy saving of the terminal device.

[0092] Currently, when analyzing DRX performance, the focus is typically on metrics such as latency, sleep rate, or average power consumption. However, for status update information in the Industrial Internet of Things (IIoT), relying solely on traditional latency metrics is insufficient to accurately reflect the freshness of the status update information currently received by the terminal device. In recent years, information age has been used to measure the time elapsed since the current status update information was generated, providing a more direct description of the timeliness of status update information and making it more suitable for analyzing status update-related services.

[0093] While DRX mechanisms can currently achieve energy savings for terminal devices, there is still a lack of effective analysis and optimization methods for business scenarios in the Industrial Internet of Things (IIoT), where network devices periodically or event-triggeredly send status updates to terminal devices. These scenarios require consideration of both the freshness of the received status updates and the energy consumption of the receiving devices when combining DRX configuration parameters. Therefore, further research is necessary for such scenarios.

[0094] In related technologies, it involves configuring DRX parameters (such as the duration of inactive timers). Listening window duration Short DRX cycle sleep duration Long DRX cycle sleep duration and the number of short DRX cycles Using (etc.) as the optimization object, under the given average delay constraint, the solution is to maximize energy saving, and the optimal DRX configuration parameters are found by exhaustive search or genetic algorithm.

[0095] However, the aforementioned technologies focus on the trade-off between average latency and power consumption, with evaluation metrics primarily based on average latency and energy efficiency. This fails to capture the freshness of status update information received by terminal devices in status update services. For industrial IoT scenarios where network devices send status update information to terminal devices, using only average latency as a constraint is insufficient to accurately reflect the timeliness of the status update information received by the terminal device. Therefore, this approach also struggles to balance the freshness of the status update information received by the terminal device with the energy consumption of the receiving device.

[0096] Based on this, embodiments of this application provide a communication method, which involves obtaining a first parameter set, the first parameter set including multiple first parameter combinations, each first parameter combination including a set of DRX configuration parameter values; based on a predetermined first closed-form solution of a first performance index and a second closed-form solution of a second performance index, selecting a target parameter combination from the first parameter set, the target parameter combination being a non-dominated solution with the objective of minimizing the first performance index and maximizing the second performance index; and sending the target parameter combination to a terminal device; wherein, the first performance index is used to characterize the freshness of the state update information successfully received by the terminal device, the second performance index is used to characterize the energy saving level of the terminal device within an update cycle, and the update cycle is the time interval between two consecutive successful receptions of state update information by the terminal device.

[0097] Therefore, for terminal devices employing the DRX mechanism, based on a first closed-form solution of a first performance index and a second closed-form solution of a second performance index, a joint evaluation is performed on the freshness of the received state update information and the receiving power consumption of the terminal device. The goal is to minimize the average peak information age and maximize the energy-saving factor, resulting in a non-dominated solution between the average peak information age and the energy-saving factor. This alleviates the contradiction between enhanced energy saving and accelerated aging of state update information in existing DRX mechanisms. Thus, in the Industrial Internet of Things (IIoT) scenario where the DRX mechanism is used to receive state update information from network devices, it can balance the freshness of the state update information and the receiving power consumption of the terminal device.

[0098] In some embodiments, under the Industrial Internet of Things (IIoT), the aforementioned terminal device is an IIoT device.

[0099] The following detailed description of the solution provided in the embodiments of this application, in conjunction with the corresponding flowcharts, is provided. It is understood that the illustrative flowcharts provided in the embodiments of this application primarily use different devices (e.g., terminal devices, network devices) as examples of the execution subjects of the interaction to illustrate the method, but this application does not limit the execution subjects of the interaction. For example, the devices (e.g., terminal devices, network devices) in the illustrative flowcharts can also be chips, chip systems, or processors that support the implementation of the method on the device, or logic modules or software capable of implementing all or part of the functions of the device.

[0100] For example, Figure 5 This is a flowchart illustrating a communication method provided in an embodiment of this application. It can be understood that... Figure 5 The term "terminal device" can refer to any terminal device or a device within a terminal device (such as a processor, chip, or chip system). Figure 5 The network device mentioned can be any access network device, or it can refer to a component within an access network device (such as a processor, chip, or chip system). Figure 5 As shown, the communication method may specifically include the following steps: S501, the network device constructs a state space.

[0101] In this application embodiment, a listening indication process is introduced to describe whether the terminal device has receiving capability in each time slot. When the nth time slot is within an inactive timer or listening window, let... When the nth time slot is in a sleep state (i.e., a short DRX cycle sleep period or a long DRX cycle sleep period), let Thus, the actual process of the DRX mechanism is converted into a gated receive sequence over discrete time slots. Network devices only... Within a specific time slot, the system attempts to send status update information to the terminal device, and the terminal device only opens the receiving link and performs decoding within that time slot.

[0102] Among them, the listening indication process Duration of inactive timer Listening window duration Short DRX cycle sleep duration Long DRX cycle sleep duration and the number of short DRX cycles Once the DRX configuration parameters are determined, the actual process of the DRX mechanism can be converted into a gated reception sequence of 0 / 1 on discrete time slots, so as to facilitate the calculation of the first and second performance indicators.

[0103] In the Industrial Internet of Things (IIoT), industrial sensing status update services exhibit both stable, low-frequency arrival and event-triggered, burst arrival. Therefore, considering model interpretability, an ON / OFF hybrid service arrival model is adopted in the discrete time-slot domain to characterize the generation process of status update information on the network device side. This indicates whether the current business status is in a state of emergency, where... In this case, it indicates that the current business state is in a sudden state (i.e., the event triggers a sudden arrival). In this case, it indicates that the current business status is in a non-sudden state (also known as a low-frequency update state).

[0104] Furthermore, define arrival variables. This indicates whether a state update message arrives at least once within the nth time slot. In the non-burst state (i.e., OFF state), the equivalent Bernoulli expression for Poisson arrival in discrete time slots is used; that is, the first arrival probability of the state update message in a single time slot in the non-burst state is... , Poisson's strength Let be the time slot length. In the burst state (i.e., ON state), it is used to characterize dense arrivals during a burst period. The second arrival probability of the state update information for a single time slot in the burst state is . When the second arrival probability When the value approaches 1, it indicates that new state update information arrives approximately every time slot during the burst period.

[0105] When caching state update information, network devices employ a preemptive last-generated-first-served (P-LGFS) caching strategy. Specifically, when new state update information arrives in a time slot, if the cache already contains older, pending state update information, the newly arrived state update information overwrites the older one. This ensures that the cache always retains the most recently generated state update information, thereby guaranteeing that the state update information successfully received by the terminal device corresponds to the most recent state update information as much as possible, reducing the staleness of the state update information received by the terminal device.

[0106] like Figure 6 As shown, network devices use a fixed modulation and coding scheme to send status update information, and terminal devices only listen for indications during the process. Listening is performed within the listening time slot (i.e., within the listening window or an inactive timer). If the instantaneous signal-to-noise ratio of the current time slot... Greater than or equal to the preset decoding threshold If the instantaneous signal-to-noise ratio of the current time slot is [value missing], then the transmission is considered successful; if the instantaneous signal-to-noise ratio of the current time slot is [value missing], then the transmission is considered successful. Less than the preset decoding threshold If the transmission fails, the transmission is considered to have failed.

[0107] The wireless channel between network devices and terminal devices adopts an independent and identically distributed block fading channel model. The block fading channel model refers to a wireless channel model where the channel gain remains constant within a single time slot but varies independently between different time slots. Specifically, it can be modeled using a Nakagami-m distribution (a statistical distribution mainly used for fading channel modeling in wireless communication), with instantaneous signal-to-noise ratio... Following a Gamma distribution, the probability of successful transmission in a single time slot is... It can be represented as:

[0108] in, As a fading factor, and to obtain finite and closed expression, the embodiments of this application take... It is a positive integer; This represents the average signal-to-noise ratio.

[0109] In some embodiments, in order to simultaneously characterize the service state and the network device's cache occupancy state in the discrete time slot domain, burst states (i.e., ON state) / non-burst states (i.e., OFF state) are jointly modeled with the presence or absence of state update information to be sent in the network device's cache, constructing a state space of a three-state Markov chain. This yields a finite-state random process, which describes the relationship between DRX gated reception, buffer uptime, and the arrival of state update information.

[0110] The state space includes a first state, a second state, and a third state. The first state indicates that the service state is non-burst and the network device has no cached state update information. The second state indicates that the service state is non-burst and the network device has cached state update information. The third state indicates that the service state is burst.

[0111] That is, state space As shown in Table 1 below:

[0112] Table 1 Among them, E state (i.e., the first state) indicates that the current business state is in a non-emergency state (i.e., And the network device's cache is empty (i.e., there is no state update information to send); F state (i.e., the second state) indicates that the current service state is in a non-burst state (i.e., And the network device's cache is not empty (i.e., the cache retains the latest state update information to be sent); state O (i.e., the third state) indicates that the current service state is in a burst state (i.e., To obtain a conservative estimate, the second arrival probability is taken. In burst mode, new state update information arrives in every time slot. Therefore, in state O, the distinction between empty and non-empty buffers is no longer made; by default, network devices have state update information to be sent in state O. State Space Used to represent the system state of the nth time slot.

[0113] Therefore, this application embodiment retains the business state as either a burst state or a non-burst state, while also reflecting whether there is any pending state update information in the cache, in order to construct a state space. Compared to a two-dimensional state that only uses wake-up / sleep states or a simplified model that ignores cache dynamics, this approach can more accurately depict the relationship between the arrival, caching, listening, and successful reception of state update information.

[0114] The DRX gating mechanism ensures that the terminal device cannot successfully receive state update information during the sleep time slot, and can only successfully receive state update information during the listening time slot. Based on this, the sleep time slot advancement matrix is ​​constructed using the steps in S502 below. And construct the listening slot advance matrix using the steps in S503 below. .

[0115] S502, the network device constructs a sleep time slot advancement matrix based on the state transition probabilities between various states in the state space and sleep time slots.

[0116] After constructing the state space, the network device bases its operation on the state space and sleep time slots (i.e., the listening indication process). The state transition probabilities between each state in each time slot are used to construct the sleep time slot advancement matrix. .

[0117] Among them, the sleep time slot advancement matrix Using state sequences And the sleep time slot advancement matrix The state transition probability of the i-th row and j-th column is .

[0118] Since the network device does not send state update information when the terminal device is in sleep time slot, the state transition is driven only by the service state and arrival events in this case.

[0119] Specifically, when When the service state in the nth time slot is OFF and the network device's cache is empty, the arrival of state update information while the service state is OFF will make the network device's cache non-empty. Therefore, if the service state in the (n+1)th time slot remains OFF and no new state update information arrives, then... If the service status in the (n+1)th time slot remains OFF and new status update information arrives, then If the service status of the (n+1)th time slot changes to the ON state, then .

[0120] when When the time slot n is in the OFF state, it indicates that the network device's cache is not empty. Since the P-LGFS caching strategy guarantees that the cache is always not empty, if the service state in the (n+1)th time slot remains OFF, then... If the service status of the (n+1)th time slot changes to the ON state, then .

[0121] when When, it indicates that the service state of the nth time slot is ON, since the second arrival probability is Furthermore, since network devices do not send state update information during sleep slots, their buffers remain non-empty. Therefore, when the service state transitions to the OFF state in the (n+1)th time slot, then... If the service status in the (n+1)th time slot remains ON, then .

[0122] Therefore, it can be determined that the sleep time slot advancement matrix The formula is as follows:

[0123] in, This represents the state transition probability when the service state in the nth time slot is OFF and the service state in the (n+1)th time slot is also OFF. The first arrival probability of the state update information in the OFF state; This represents the state transition probability when the service state of the nth time slot is OFF and the service state of the (n+1)th time slot changes to ON. This represents the state transition probability when the service state of the nth time slot is ON and the service state of the (n+1)th time slot changes to OFF. This represents the state transition probability when the service state of the nth time slot is ON and the service state of the (n+1)th time slot is still ON.

[0124] Therefore, in the sleep time slot advancement matrix In the diagram, the state transition probability in the i-th row and j-th column represents the state transition probability from the i-th state to the j-th state during the sleep time slot. The i-th state and the j-th state are one of the first state (i.e., E-state), the second state (i.e., F-state), and the third state (i.e., O-state), respectively. i and j are integers greater than or equal to 1 and less than or equal to 3.

[0125] Specifically, in the sleep time slot advancement matrix In the diagram, the state transition probability in row 1, column 1 represents the state transition probability from state 1 (E state) to state 2 (F state) during a sleep time slot; the state transition probability in row 1, column 2 represents the state transition probability from state 1 (E state) to state 2 (F state) during a sleep time slot; the state transition probability in row 1, column 3 represents the state transition probability from state 1 (E state) to state 3 (O state) during a sleep time slot. Similarly, the state transition probability in row 2, column 1 represents the state transition probability from state 2 (F state) to state 1 (E state) during a sleep time slot; the state transition probability in row 2, column 2 represents the state transition probability from state 2 (F state) to state 3 (O state) during a sleep time slot; and the state transition probability in row 2, column 3 represents the state transition probability from state 2 (F state) to state 3 (O state) during a sleep time slot. The state transition probability in row 3, column 1 represents the state transition probability from the third state (i.e., state O) to the first state (i.e., state E) during a sleep time slot; the state transition probability in row 3, column 2 represents the state transition probability from the third state (i.e., state O) to the second state (i.e., state F) during a sleep time slot; and the state transition probability in row 3, column 3 represents the state transition probability from the third state (i.e., state O) to the third state (i.e., state O) during a sleep time slot.

[0126] Furthermore, the matrix is ​​advanced during sleep time slots. In the context of the equation, the state transition probabilities between some states are compared with the first arrival probability of state update information in non-burst states (i.e., OFF states). Related. For example, the state transition probability in row 1, column 1 (i.e., the state transition probability from state 1 to state 2) and the state transition probability in row 1, column 2 (i.e., the state transition probability from state 1 to state 2) are related to the first arrival probability. Related.

[0127] S503, the network device constructs a listening slot advancement matrix based on the state transition probabilities between states in the state space and listening slots.

[0128] After constructing the state space, the network device bases its operation on the state space and the listening time slots (i.e., the listening indication process). The state transition probabilities between each state in each time slot are used to construct the listening time slot advancement matrix. .

[0129] Among them, the monitoring time slot advancement matrix Using state sequences And the monitoring time slot advancement matrix The state transition probability of the i-th row and j-th column is .

[0130] Since the terminal device is listening in the time slot and its buffer is not empty, the network device attempts to send status update information to the terminal device. The terminal device also opens the receiving link and performs decoding. The decoding success probability is the single-time slot successful transmission probability given by the above formula (1). Successfully receiving status update information in this time slot is considered a period termination event. If the time slot fails to receive the update, the monitoring time slot advance matrix is ​​used. Describes the state transition probability from this time slot to the next time slot. If the terminal device fails to decode (i.e., the terminal device does not successfully receive the state update information), the state update information is discarded and the network device can clear the corresponding buffer, which will only be refilled by the newly arrived state update information.

[0131] Specifically, when "When" indicates that the service status of the nth time slot is OFF and the network device's buffer is empty. The system only attempts to send a state update message when a state update message arrives in the current time slot. The probability of the terminal device successfully receiving the state update message and successfully terminating the process is: In other cases, the corresponding factor for advancement is: .

[0132] when When the nth time slot's service status is OFF and the network device's buffer is not empty, there is an attempt to send status update information in this time slot. The probability of the terminal device successfully receiving the status update information and successfully terminating the attempt is: The failure probability factor for the terminal device not successfully receiving the status update information is: If the terminal device fails to decode, the state update information is discarded and the network device can clear the corresponding cache. The (n+1)th time slot can only enter the E state or the O state as the service state transitions.

[0133] when When the nth time slot is in the ON state, it indicates that there is an attempt to send state update information in this time slot. The probability of the terminal device successfully terminating the attempt after successfully receiving the state update information is: The failure probability factor for the terminal device not successfully receiving the status update information is: If the terminal device fails to decode, the state update information is discarded and the network device can clear the corresponding cache. The (n+1)th time slot can only enter the E state or the O state as the service state transitions.

[0134] Furthermore, in the nth time slot, if , as well as In any state within the time slot, if an attempt is made to send state update information in the current time slot, and the terminal device fails to decode it, the state update information is discarded, and the network device can clear the corresponding buffer. In this case, the (n+1)th time slot will not transition to or remain in the F state. The F state is generated by the arrival and retention of state update information in the sleep time slot, while the state advancement in the listening time slot does not generate the F state.

[0135] Therefore, it can be determined that the monitoring time slot advancement matrix... The formula is as follows:

[0136] in, This represents the state transition probability when the service state in the nth time slot is OFF and the service state in the (n+1)th time slot is also OFF. Let be the first arrival probability of the state update information in the OFF state. This represents the probability of successful transmission in a single time slot. This represents the state transition probability when the service state of the nth time slot is OFF and the service state of the (n+1)th time slot changes to ON. This represents the state transition probability when the service state of the nth time slot is ON and the service state of the (n+1)th time slot changes to OFF. This represents the state transition probability when the service state of the nth time slot is ON and the service state of the (n+1)th time slot is still ON.

[0137] Therefore, in the monitoring time slot advance matrix In the diagram, the state transition probability in the i-th row and j-th column represents the state transition probability from the i-th state to the j-th state under the listening time slot. The i-th state and the j-th state are one of the first state (i.e., E-state), the second state (i.e., F-state), and the third state (i.e., O-state), respectively. i and j are integers greater than or equal to 1 and less than or equal to 3.

[0138] Specifically, in the monitoring time slot advance matrix In the diagram, the state transition probability in row 1, column 1 represents the state transition probability from state 1 (E state) to state 2 (F state) under the listening time slot; the state transition probability in row 1, column 2 represents the state transition probability from state 1 (E state) to state 2 (F state) under the listening time slot; the state transition probability in row 1, column 3 represents the state transition probability from state 1 (E state) to state 3 (O state) under the listening time slot. Similarly, the state transition probability in row 2, column 1 represents the state transition probability from state 2 (F state) to state 1 (E state) under the listening time slot; the state transition probability in row 2, column 2 represents the state transition probability from state 2 (F state) to state 3 (O state) under the listening time slot; and the state transition probability in row 2, column 3 represents the state transition probability from state 2 (F state) to state 3 (O state) under the listening time slot. The state transition probability in row 3, column 1 represents the state transition probability from the third state (i.e., state O) to the first state (i.e., state E) under the listening time slot; the state transition probability in row 3, column 2 represents the state transition probability from the third state (i.e., state O) to the second state (i.e., state F) under the listening time slot; the state transition probability in row 3, column 3 represents the state transition probability from the third state (i.e., state O) to the third state (i.e., state O) under the listening time slot.

[0139] Furthermore, the matrix is ​​advanced during the listening time slot. In the middle, the state transition probability between some states and the single-slot successful transmission probability are... Related. For example, the state transition probabilities in row 2, column 1 (i.e., the state transition probability from the second state to the first state), row 2, column 3 (i.e., the state transition probability from the second state to the third state), row 3, column 1 (i.e., the state transition probability from the third state to the first state), and row 3, column 3 (i.e., the state transition probability from the third state to the third state) are related to the single-slot successful transmission probability. Related.

[0140] Advance the matrix in the listening time slot In the other part, the state transition probabilities between states and the first arrival probability and single-slot successful transmission probability Related. For example, the state transition probability in row 1, column 1 (i.e., the state transition probability from state 1 to state 2) and the state transition probability in row 1, column 3 (i.e., the state transition probability from state 1 to state 3) are related to the first arrival probability. and single-slot successful transmission probability Related.

[0141] Among them, the probability of successful transmission in a single time slot This represents the probability that the terminal device successfully decodes the status update information within a time slot.

[0142] In a Markov chain, after a sufficient number of state transitions, the probability distribution of the system's state tends to stabilize and no longer changes over time; this distribution is called the steady-state distribution.

[0143] Therefore, in this embodiment, the start point of the update cycle after a successful reception is taken as the reference time, and the steady-state distribution is denoted as... ,vector This is called the steady-state distribution. Since the network device can clear the corresponding buffer after the terminal device successfully receives the state update information, the probability that the update cycle starts in state F is 0. Therefore, the initial distribution vector corresponding to the state space... .

[0144] in, .

[0145] In related technologies, studies often use two-dimensional states (wake-up state / sleep state) or ignore buffer dynamics, which cannot reflect the relationship between arrival, buffering, listening, and successful reception under gating. However, in the embodiments of this application, a three-state partition (i.e., E state, F state, and O state) is adopted, and a dual-matrix construction of a sleep time slot advancement matrix and a listening time slot advancement matrix is ​​performed. This characterizes bursty traffic, buffer up-to-dateness, and gating effects on a discrete time slot scale, which can more accurately characterize the relationship between the arrival, buffering, listening, and successful reception of state update information.

[0146] S504, the network device determines the first closed-form solution of the first performance index and the second closed-form solution of the second performance index based on the sleep time slot advancement matrix, the listening time slot advancement matrix and a set of DRX configuration parameters.

[0147] The first performance metric characterizes the freshness of the status update information successfully received by the terminal device, while the second performance metric characterizes the energy-saving level of the terminal device within an update cycle. The update cycle is the time interval between two consecutive successful receptions of status update information by the terminal device. Specifically, the first performance metric is the Average Peak Information Age (APAoI), and the second performance metric is the energy-saving factor.

[0148] A closed-form solution, also known as an analytical solution, refers to an explicit expression that can be directly obtained through a finite number of algebraic operations in a mathematical or optimization problem. For a mathematical equation, if an expression can be explicitly written that depends only on known parameters or variables, such a solution is a closed-form solution.

[0149] Here, the first closed-form solution refers to the explicit expression of the first performance metric with respect to a set of DRX configuration parameters, and the second closed-form solution refers to the explicit expression of the second performance metric with respect to a set of DRX configuration parameters.

[0150] Therefore, after constructing the sleep time slot advancement matrix and the listening time slot advancement matrix, the network device determines the first closed-form solution of the first performance index based on the sleep time slot advancement matrix, the listening time slot advancement matrix and a set of DRX configuration parameters; and the network device also determines the second closed-form solution of the second performance index based on the sleep time slot advancement matrix, the listening time slot advancement matrix and a set of DRX configuration parameters.

[0151] It should be noted that during the process of determining the first closed-form solution of the first performance metric and the second closed-form solution of the second performance metric, the parameter values ​​of one set of DRX configuration parameters are unknown. In the subsequent S508 steps, the network device needs to substitute the parameter values ​​of the multiple sets of DRX configuration parameters included in the first parameter set into the first closed-form solution of the first performance metric to obtain the corresponding first performance metric, and substitute the parameter values ​​of the multiple sets of DRX configuration parameters included in the first parameter set into the second closed-form solution of the second performance metric to obtain the corresponding second performance metric.

[0152] One set of DRX configuration parameters includes at least one of the following: duration of inactive timers. Listening window duration Short DRX cycle sleep duration Long DRX cycle sleep duration and the number of short DRX cycles Duration of inactive timer Short DRX cycle sleep duration and the duration of long DRX cycle sleep All are non-negative integers counted in time slots; listening window duration It is a positive integer.

[0153] In one implementation, a set of DRX configuration parameters includes: the duration of inactive timers. Listening window duration Short DRX cycle sleep duration Long DRX cycle sleep duration and the number of short DRX cycles These are the five DRX configuration parameters.

[0154] In this embodiment, the time interval between two consecutive successful receptions of status update information by the terminal device is defined as an update cycle, denoted by Y; the system time elapsed from the generation to the reception of the status update information successfully received by the terminal device is denoted by D. Therefore, taking the average peak information age (APAoI) as the first performance metric, APAoI can be expressed as a function of the update cycle length Y and the system time D. The first closed-form solution of the first performance metric (i.e., APAoI) can then be expressed as:

[0155] in, The primary performance indicator (i.e., APAoI) is used for performance evaluation. For decision variables, i.e. a set of DRX configuration parameters ( ), For the expected duration of the update cycle, This represents the expected system time.

[0156] Because network device caching uses the P-LGFS mechanism, state updates successfully received by the terminal device are more valuable when they are the most recently generated state updates from the network device. If the state update successfully received by the terminal device comes from a newly arrived state update in the current time slot, the system time D is approximately equal to 0; if the state update successfully received by the terminal device comes from a state update waiting in the cache, the system time D is equal to the residence time of that state update in the system.

[0157] In some embodiments, the expected update cycle duration and system time expectation The derivation process is as follows: The first step is for the network device to construct the first sub-cycle transition matrix corresponding to the inactive timer. The second sub-period transition matrix corresponding to the short DRX period The third sub-period transition matrix corresponding to the long DRX period The first sub-cycle time consumption reward vector corresponding to the inactive timer The time consumption reward vector of the second sub-cycle corresponding to the short DRX cycle. and the time consumption reward vector of the third sub-cycle corresponding to the long DRX cycle. .

[0158] To avoid splitting the sleep and listening phases into time slots, a short DRX cycle (a sub-cycle) is defined as the first experience. Each sleep interval is then passed A combination of listening time slots defines a long DRX period (which is a sub-period) as the first experienced time slot. Each sleep interval is then passed A combination of listening time slots. An inactive timer can be considered a special case where the sleep time slot is equal to 0.

[0159] It should be noted that, Figure 3 The protocol state cycle is illustrated by starting from the listening window. However, in the derivation of the first closed-form solution of the first performance metric (i.e., APAoI) and the second closed-form solution of the second performance metric (i.e., energy saving factor), the sub-cycle begins with the sleep phase after a failed reception of state update information, i.e., the aforementioned "defining a short DRX cycle as the first experience". Each sleep interval is then passed "a combination of listening time slots" "Sleep slots" are located in short DRX cycle sleep periods, and " The "listening slot" is located in the listening window of the next short DRX cycle after the sleep period of the short DRX cycle, which is the above "defining a short DRX cycle as the first experienced Each sleep interval is then passed The "combination of listening time slots" refers to the short DRX cycle sleep period and the next short DRX cycle listening window; correspondingly, the above "defining a long DRX cycle as the first experienced" Each sleep interval is then passed "a combination of listening time slots" "Sleep slots" are located in long DRX cycle sleep periods, and " The "listening slot" is located in the listening window of the next long DRX cycle after the sleep period of the long DRX cycle, which is the above "defining a long DRX cycle as the first experienced Each sleep interval is then passed "A combination of listening slots" refers to the long DRX cycle sleep period and the next long DRX cycle listening window. Therefore, the only difference between the two is the starting calculation point, but both describe the DRX process between adjacent listening windows.

[0160] Therefore, network devices advance based on sleep time slot matrix Listening slot advance matrix Short DRX cycle sleep duration and listening window duration Determine the second sub-period transition matrix corresponding to the short DRX period. Specifically, the transition matrix for the second sub-period corresponding to the short DRX period. It can be represented as:

[0161] in, Represents the sleep time slot advancement matrix of Power of 1 Represents the monitoring time slot advancement matrix of Therefore, it is the matrix that advances the sleep time slots. of Power and Listening Slot Advancement Matrix of The product of these powers determines the second sub-period transition matrix corresponding to the short DRX period. .

[0162] Among them, the second sub-period transition matrix corresponding to the short DRX period The element in the i-th row and j-th column represents: at the beginning of a short DRX cycle, the system is in the i-th state, and after a period of length... Each sleep slot and the following After a listening time slot, if no state update information is successfully received within the short DRX period, then the probability that the system is in the j-th state when reaching the start of the next sub-cycle is given. Therefore, the transition matrix for the second sub-cycle corresponding to the short DRX period is... This represents the transition probability of the system surviving into the next sub-cycle after the short DRX cycle ends.

[0163] Network devices based on sleep time slot advance matrix Listening slot advance matrix Long DRX cycle sleep duration and listening window duration Determine the third sub-period transition matrix corresponding to the long DRX period. Specifically, the transition matrix of the third sub-period corresponding to the long DRX period. It can be represented as:

[0164] in, Represents the sleep time slot advancement matrix of Power of 1 Represents the monitoring time slot advancement matrix of Therefore, it is the matrix that advances the sleep time slots. of Power and Listening Slot Advancement Matrix of The product of these powers determines the third sub-period transition matrix corresponding to the long DRX period. .

[0165] Among them, the third sub-period transition matrix corresponding to the long DRX period The element in the i-th row and j-th column represents: at the beginning of a certain long DRX cycle, the system is in the i-th state, and after a period of length... Each sleep slot and the following After a listening time slot, if no state update information is successfully received within the long DRX period, then the probability that the system is in the j-th state when reaching the start of the next sub-cycle is given. Therefore, the transition matrix for the third sub-cycle corresponding to the long DRX period is... This represents the transition probability of the system surviving into the next sub-cycle after the end of a long DRX cycle.

[0166] Because the window corresponding to the inactive timer A series of consecutive listening time slots can be considered as special sub-cycles that do not include sleep time slots. Therefore, network devices advance the matrix based on the listening time slots. Duration of inactive timers Determine the first sub-cycle transition matrix corresponding to the inactive timer. Specifically, the first sub-cycle transition matrix corresponding to the inactive timer. It can be represented as:

[0167] in, Represents the monitoring time slot advancement matrix of Therefore, it is the matrix that advances the listening time slots. of The power of this is determined as the first sub-cycle transition matrix corresponding to the inactive timer. .

[0168] For short DRX cycles, the fixed energy expenditure during sleep in short DRX cycles The first time slot, and during the listening phase of the short DRX cycle, the first... +1 listening slots are actually experienced under the condition that the previous None of the listening time slot terminal devices successfully received the status update information. Therefore, the network device advances the sleep time slot based on the sleep time slot matrix. Listening slot advance matrix Time slot length Short DRX cycle sleep duration and listening window duration Determine the time consumption reward vector for the second sub-cycle corresponding to the short DRX cycle. Specifically, the time consumption reward vector for the second sub-cycle corresponding to the short DRX cycle. It can be represented as:

[0169] in, Represents a 3-dimensional column vector of all ones. For a value that is all A 3D column vector Represents the sleep time slot advancement matrix of Power of 1 Represents the monitoring time slot advancement matrix of Power of 1.

[0170] Among them, the time consumption reward vector of the second sub-cycle corresponding to the short DRX cycle. The i-th component in the equation represents the expected time consumption during which the system is in state i at the beginning of a short DRX cycle until the state update information is successfully received or the short DRX cycle ends.

[0171] For long DRX cycles, the fixed energy expenditure during sleep in long DRX cycles The first time slot, and during the listening phase of the long DRX cycle, the first... +1 listening slots are actually experienced under the condition that the previous None of the listening time slot terminal devices successfully received the status update information. Therefore, the network device advances the sleep time slot based on the sleep time slot matrix. Listening slot advance matrix Time slot length Long DRX cycle sleep duration and listening window duration Determine the time consumption reward vector for the third sub-cycle corresponding to the long DRX cycle. Specifically, the time consumption reward vector for the third sub-cycle corresponding to a long DRX cycle. It can be represented as:

[0172] in, Represents a 3-dimensional column vector of all 1s, i.e. For a value that is all A 3D column vector Represents the sleep time slot advancement matrix of Power of 1 Represents the monitoring time slot advancement matrix of Power of 1.

[0173] Among them, the time consumption reward vector of the third sub-cycle corresponding to the long DRX cycle. The i-th component in the equation represents the expected time consumption during which the system is in the i-th state at the beginning of a certain long DRX cycle until the state update information is successfully received or the long DRX cycle ends.

[0174] Because the window corresponding to the inactive timer A series of consecutive listening time slots can be considered as special sub-cycles that do not include sleep time slots. Therefore, network devices advance the matrix based on the listening time slots. Time slot length Duration of inactive timers Determine the time consumption reward vector for the first sub-cycle corresponding to the inactive timer. Specifically, the reward vector for the first sub-cycle time consumption corresponding to the inactive timer. It can be represented as:

[0175] in, Represents the monitoring time slot advancement matrix of Power of 1 This represents a 3-dimensional column vector of all 1s.

[0176] The second step is for the network device to construct the first system time expected contribution reward vector corresponding to the short DRX cycle. The second system time-expected contribution reward vector corresponding to the long DRX cycle .

[0177] Since expired state update information is worthless, this application embodiment adopts an update rule that discards state update information if transmission fails. Thus, under the conditions of discarding failed state update information, a P-LGFS caching strategy, and at most one attempt per listening slot, a non-zero system time D only arises from the following situations: the network device already has a cached state update information during the sleep phase, and the terminal device successfully receives the state update information in the first listening slot after waking up, while no new state update information arrives in that slot to overwrite the cache.

[0178] For short DRX cycles, the sleep duration of a short DRX cycle is... The first arrival probability of network device state update information under non-burst conditions Time slot length and the duration of short DRX cycle sleep Determine the expected first dwell time corresponding to the short DRX cycle. .

[0179] Specifically, the backward residence time of the latest state update information in the cache at the end of the sleep phase can be given by a truncated geometric distribution, and the expected first residence time corresponding to a short DRX cycle is given by the condition that at least one state update information arrives during the sleep phase. It can be represented as:

[0180] in, Represents 1 and the first arrival probability Difference Power of 1 Represents 1 and the first arrival probability Difference Power of 1.

[0181] The network device's first arrival probability of state update information under non-burst conditions Expected first dwell time corresponding to short DRX cycles Determine the first system time contribution vector corresponding to the first listening slot in the short DRX cycle. Specifically, the first system time contribution vector corresponding to the first listening slot in a short DRX cycle. It can be represented as:

[0182] The network device's first arrival probability of state update information under non-burst conditions and single-slot successful transmission probability Determine the success probability weight vector corresponding to the first listening slot. Specifically, the success probability weight vector corresponding to the first listening slot. It can be represented as:

[0183] Among them, the success probability weight vector corresponding to the first listening slot The first component indicates that when the system is in the first state (E state), the terminal device will only successfully receive the state update information if the state update information arrives and is successfully decoded within this time slot. The corresponding success probability is... The success probability weight vector corresponding to the first listening slot. The second component indicates that when the system is currently in the second state (i.e., state F), if state update information is sent directly, the probability of the terminal device successfully receiving the state update information is: The success probability weight vector corresponding to the first listening slot. The third component represents the probability that, when the system is in the third state (i.e., state 0), directly sending state update information will result in the terminal device successfully receiving the state update information. .

[0184] Network devices based on sleep time slot advance matrix Short DRX cycle sleep duration The first system time contribution vector corresponding to the first listening slot in the short DRX cycle. The success probability weight vector corresponding to the first listening slot Determine the expected contribution reward vector of the first system time corresponding to the short DRX period. Specifically, the expected contribution reward vector of the first system time corresponding to a short DRX cycle. It can be represented as:

[0185] in, Represents the sleep time slot advancement matrix of Power of 1 This represents element-wise product.

[0186] In summary, network devices advance the matrix based on sleep time slots. First arrival probability Probability of successful transmission in a single time slot and the duration of short DRX cycle sleep Determine the expected contribution reward vector of the first system time corresponding to the short DRX period. .

[0187] Correspondingly, for long DRX cycles, the sleep duration of a long DRX cycle is... The first arrival probability of network device state update information under non-burst conditions Time slot length and the duration of long DRX cycle sleep Determine the expected second dwell time corresponding to the long DRX cycle. .

[0188] Specifically, the backward residence time of the latest state update information in the cache at the end of the sleep phase can be given by a truncated geometric distribution, and the expected second residence time corresponding to a long DRX period is given by the condition that at least one state update information arrives during the sleep phase. It can be represented as:

[0189] in, Represents 1 and the first arrival probability Difference Power of 1 Represents 1 and the first arrival probability Difference Power of 1.

[0190] The network device's first arrival probability of state update information under non-burst conditions Expected second dwell time corresponding to long DRX cycles Determine the second system time contribution vector corresponding to the first listening slot in the long DRX cycle. Specifically, the second system time contribution vector corresponding to the first listening slot in a long DRX cycle. It can be represented as:

[0191] The network device's first arrival probability of state update information under non-burst conditions and single-slot successful transmission probability Determine the success probability weight vector corresponding to the first listening slot. Success probability weight vector The specific expression can be found in the formula (13) above.

[0192] Network devices based on sleep time slot advance matrix Long DRX cycle sleep duration The second system time contribution vector corresponding to the first listening slot in the long DRX cycle. The success probability weight vector corresponding to the first listening slot Determine the second system time-expected contribution reward vector corresponding to the long DRX period. Specifically, the expected contribution reward vector of the second system over a long DRX period. It can be represented as:

[0193] in, Represents the sleep time slot advancement matrix of Power of 1 This represents element-wise product.

[0194] In summary, network devices advance the matrix based on sleep time slots. First arrival probability Probability of successful transmission in a single time slot and the duration of long DRX cycle sleep Determine the second system time-expected contribution reward vector corresponding to the long DRX period. .

[0195] The third step is for the network device to determine the first closed-form solution for the first performance metric.

[0196] The short DRX cycle phase experiences the most The first sub-cycle can then enter the long DRX cycle phase. Therefore, the network device uses the second sub-cycle transition matrix corresponding to the short DRX cycle. The time consumption reward vector of the second sub-cycle corresponding to the short DRX cycle. The third sub-period transition matrix corresponding to the long DRX period The time consumption reward vector of the third sub-cycle corresponding to the long DRX cycle and the number of short DRX cycles Determine the expected time consumption vector .

[0197] Specifically, due to the third sub-period transition matrix corresponding to the long DRX period Its spectral radius is less than 1, thus making Therefore, the expected time consumption vector exists. It can be represented as:

[0198] in, Represents the second sub-period transition matrix of Power of 1 Represents the second sub-period transition matrix of Power of 1. The identity matrix is ​​a matrix whose main diagonal is all 1s and the rest are all 0s.

[0199] It should be noted that the spectral radius being less than 1 depends on the first arrival probability. and single-slot successful transmission probability Conditions such as these. Therefore, in this embodiment, it is the probability of successful transmission in a single time slot. Greater than 0 and first arrival probability Under non-zero conditions, the spectral radius can be guaranteed to be less than 1.

[0200] In summary, network devices advance the matrix based on sleep time slots. Listening slot advance matrix Listening window duration Short DRX cycle sleep duration Long DRX cycle sleep duration and the number of short DRX cycles Determine the expected time consumption vector .

[0201] Network devices are based on the second sub-cycle transition matrix corresponding to the short DRX cycle. The expected contribution reward vector of the first system time corresponding to the short DRX cycle. The third sub-period transition matrix corresponding to the long DRX period The second system time-expected contribution reward vector corresponding to a long DRX cycle and the number of short DRX cycles Determine the expected system time reward vector .

[0202] Specifically, due to the third sub-period transition matrix corresponding to the long DRX period Its spectral radius is less than 1, thus making Therefore, the expected system time reward vector exists. It can be represented as:

[0203] in, Represents the second sub-period transition matrix of Power of 1 Represents the second sub-period transition matrix of Power of 1 It is an identity matrix.

[0204] In summary, network devices advance the matrix based on sleep time slots. Listening slot advance matrix First arrival probability Probability of successful transmission in a single time slot Listening window duration Short DRX cycle sleep duration Long DRX cycle sleep duration and the number of short DRX cycles Determine the expected system time reward vector .

[0205] Because the start of the update cycle first experiences The system operates through consecutive listening slots, only entering a short DRX cycle phase after a failure. Therefore, the duration of the inactive timer is... It acts as a gating weight during expected aggregation. The network device uses the initial distribution vector corresponding to the state space. Expected time consumption vector The first sub-cycle transition matrix corresponding to the inactive timer The first sub-cycle time consumption reward vector corresponding to the inactive timer Determine the expected update cycle duration Specifically, the expected update cycle duration. It can be represented as:

[0206] In other words, the first sub-period transition matrix With the expected time consumption vector The product of these two factors, and then the product of the reward vector consumed in the first sub-cycle. Add them together to get the result; set the initial distribution vector... Multiplying the result by the sum gives the expected update cycle duration. .

[0207] In summary, network devices are based on the initial distribution vector corresponding to the state space. Sleep time slot advancement matrix Listening slot advance matrix With a set of DRX configuration parameters, determine the expected update cycle duration. .

[0208] Furthermore, the network device is based on the initial distribution vector corresponding to the state space. Expected system time reward vector The first sub-cycle transition matrix corresponding to the inactive timer Determine the system time expectation Specifically, the system time expectation. It can be represented as:

[0209] In other words, the initial distribution vector With the first sub-period transition matrix The product of these factors, and then the product of the expected system time reward vector. By multiplying them, we can obtain the expected system time. .

[0210] In summary, network devices are based on the initial distribution vector corresponding to the state space. Sleep time slot advancement matrix Listening slot advance matrix The first arrival probability of state update information under non-burst conditions Probability of successful transmission in a single time slot With a set of DRX configuration parameters, determine the expected system time. .

[0211] Network devices expect to determine update cycle duration and system time expectation Subsequently, the network device expects based on the update cycle duration. and system time expectation The first closed-form solution of the first performance index (i.e., APAoI) is determined. Specifically, the first closed-form solution of the first performance index (i.e., APAoI) can be expressed as:

[0212] In other words, the expected update cycle duration With system time expectation The sum of these is determined as the first closed-form solution of the first performance index (i.e., APAoI).

[0213] In this embodiment of the application, in order to quantitatively characterize the energy-saving benefits brought by the DRX mechanism, taking the second performance index as the energy-saving factor as an example, the second closed-form solution of the second performance index (i.e., the energy-saving factor) can be expressed as:

[0214] in, The second performance indicator (i.e., energy-saving factor) is used to measure the energy efficiency of terminal devices through the DRX mechanism during the replacement cycle. For decision variables, i.e. a set of DRX configuration parameters ( ), For the expected duration of the update cycle, The expected sleep duration within a single update cycle. The second closed-form solution of the second performance metric and the time slot length. Irrelevant. In some embodiments, the expected sleep duration within an update cycle. The derivation process is as follows: The first step is for the network device to construct an expected cumulative sleep reward vector within an update cycle. .

[0215] According to the DRX mechanism, terminal devices are in the listening phase during both the inactive timer window and the listening window, and only enter the sleep phase during the short DRX cycle sleep period and the long DRX cycle sleep period. Therefore, network devices use the second sub-cycle transition matrix corresponding to the short DRX cycle. The third sub-period transition matrix corresponding to the long DRX period Time slot length Short DRX cycle sleep duration Long DRX cycle sleep duration and the number of short DRX cycles Determine the expected cumulative sleep reward vector within an update cycle. .

[0216] Due to the fixed consumption during sleep in short DRX cycles Each time slot, fixed consumption during long DRX cycle sleep period The number of time slots and whether or not the h-th sub-cycle is entered are determined by the transition matrix of the previous sub-cycles. Therefore, the expected cumulative sleep reward vector within an update cycle is... This can be represented as a geometric series weighted sum of the transition matrices of the sub-cycles. Specifically, the sleep reward vector for short DRX cycle sleep periods is defined. , For a value that is all A 3D column vector, the sleep reward vector for long DRX sleep cycles. , For a value that is all A 3D column vector; since there is no sleep phase within the window of the inactive timer, the sleep reward vector of the inactive timer... Therefore, the expected cumulative sleep reward vector within an update cycle. It can be represented as:

[0217] in, Represents the second sub-period transition matrix of The first term before the plus sign in the above formula (24) refers to the shortest DRX period at most. The cumulative sleep duration of each sub-cycle; Represents the second sub-period transition matrix of Power of 1 For the identity matrix, the second term after the plus sign in the above formula (24) refers to the infinite repetition and accumulation after entering the long DRX cycle.

[0218] In summary, network devices advance the matrix based on sleep time slots. Listening slot advance matrix Time slot length Listening window duration Short DRX cycle sleep duration Long DRX cycle sleep duration and the number of short DRX cycles Determine the expected cumulative reward vector for sleep. .

[0219] The second step is for the network device to construct a sleep duration expectation within an update cycle. .

[0220] Since terminal devices only enter sleep mode during short and long DRX cycle sleep periods, network devices use the initial distribution vector corresponding to the state space. The first sub-cycle transition matrix corresponding to the inactive timer And expected sleep cumulative reward vector Determine the expected sleep duration within an update cycle. Specifically, the expected sleep duration within an update cycle. It can be represented as:

[0221] In other words, the initial distribution vector With the first sub-period transition matrix The product of these is then multiplied by the expected cumulative sleep reward vector within one update cycle. Multiplying them together yields the expected sleep duration within an update cycle. .

[0222] In summary, network devices are based on the initial distribution vector corresponding to the state space. Sleep time slot advancement matrix Listening slot advance matrix With a set of DRX configuration parameters, determine the expected sleep duration within an update cycle. .

[0223] Network devices expect to determine update cycle duration And an expected sleep duration within an update cycle Subsequently, the network device calculates the expected sleep duration within an update cycle. Expected update cycle duration The second closed-form solution of the second performance index (i.e., the energy-saving factor) is determined. Specifically, the second closed-form solution of the second performance index (i.e., the energy-saving factor) can be expressed as:

[0224] In other words, the expected sleep duration within an update cycle. Expected update cycle duration The ratio of is determined as the second closed-form solution of the second performance index (i.e., the energy-saving factor).

[0225] Therefore, this application embodiment addresses the downlink status update process of the terminal device using the DRX mechanism, and sets up a set of DRX configuration parameters ( The parameters are incorporated into the parameter vector. Combined with the ON / OFF hybrid service arrival model, block fading channel model, P-LGFS caching strategy, and monitoring indication process, a unified description is provided of the process by which the terminal device successfully receives status update information, cache up-to-dateness, and information age evolution. Furthermore, the first closed-form solution of the first performance index (i.e., APAoI) and the second closed-form solution of the second performance index (i.e., energy-saving factor) are derived.

[0226] Thus, by introducing an ON / OFF hybrid service arrival model, a block fading channel model, a P-LGFS caching strategy, and a listening indication process, and using a unified description of a three-state joint state space, a sleep slot advancement matrix, and a listening slot advancement matrix, this approach not only reflects the waiting effect caused by the terminal device being in a sleep state, but also the combined impact of burst service arrival, cache up-to-dateness, and the single-slot successful transmission probability of successful link transmission on the freshness of state update information. Compared to schemes that ignore cache dynamics or only use two-dimensional state (wake-up state / sleep state) modeling, the embodiments of this application provide a higher accuracy in characterizing the state update process under DRX gating.

[0227] In related technologies, timeliness and energy consumption assessment problems typically rely on a large number of time-slot simulations. However, the embodiments of this application can transform the timeliness and energy consumption assessment problem into an analytical and computable problem, for any set of DRX configuration parameters ( The corresponding first performance index (APAoI) and second performance index (energy saving factor) can be obtained directly without repeated parameter testing through large-scale system-level simulation.

[0228] S505, the network device obtains the second parameter set, which includes an enumeration set of parameter values ​​for various DRX configuration parameters in a set of DRX configuration parameters.

[0229] To ensure the deployability of the project configuration, network devices pre-read the enumeration set of parameter values ​​related to DRX configuration parameters in the 3GPP standard protocol.

[0230] Among them, a set of DRX configuration parameters includes several DRX configuration parameters, such as the duration of inactive timers. Listening window duration Short DRX cycle sleep duration Long DRX cycle sleep duration and the number of short DRX cycles Therefore, the second parameter set includes the following parameter value enumeration sets: inactive timer candidate set, listener window candidate set, short DRX cycle sleep period candidate set, long DRX cycle sleep period candidate set, and short DRX cycle duration candidate set.

[0231] It should be noted that the candidate set of short DRX cycle sleep periods can be obtained by converting the short DRX cycle enumeration values ​​in the 3GPP standard protocol with the listening window duration, and the candidate set of long DRX cycle sleep periods can be obtained by converting the long DRX cycle enumeration values ​​in the 3GPP standard protocol with the listening window duration. For example, if the short DRX cycle duration in one of the short DRX cycle enumeration values ​​is... The converted short DRX cycle sleep duration If the duration of one of the long DRX period enumeration values ​​is... The converted long DRX cycle sleep duration This yields candidate sets for short DRX cycle sleep periods and candidate sets for long DRX cycle sleep periods.

[0232] Specifically, the candidate set of inactive timers includes the durations of multiple discrete inactive timers. The parameter values, the candidate set of listening windows includes multiple discrete listening window durations. The parameter values, the candidate set of short DRX cycle sleep periods includes multiple discrete short DRX cycle sleep period durations. The parameter values, the candidate set of long DRX cycle sleep periods includes multiple discrete long DRX cycle sleep period durations. The parameter values, the candidate set of short DRX cycle durations includes multiple discrete short DRX cycle durations. The parameter value.

[0233] S506, the network device determines the third parameter set based on the Cartesian product of the parameter value enumeration sets of various DRX configuration parameters. The third parameter set includes multiple second parameter combinations, and each second parameter combination includes a set of DRX configuration parameter values.

[0234] A Cartesian product is a set of all possible ordered combinations of elements from multiple sets, with each combination consisting of one element from each set.

[0235] Therefore, in this embodiment, the network device selects a specific parameter value from each of the inactive timer candidate set, the listening window candidate set, the short DRX cycle sleep period candidate set, the long DRX cycle sleep period candidate set, and the short DRX cycle duration candidate set to obtain a second parameter combination. This process is repeated multiple times to obtain a third parameter set.

[0236] It should be noted that, in any combination of two second parameters included in the third parameter set, the duration of the inactive timer... Parameter values, listening window duration Parameter values, duration of short DRX cycles Parameter values, duration of long DRX cycle sleep Parameter values ​​and the number of short DRX cycles At least one of the parameter values ​​is different.

[0237] S507, the network device removes the second parameter combination from the third parameter set that does not meet the constraints, and obtains the first parameter set.

[0238] Network devices can, based on protocol consistency constraints, eliminate second parameter combinations in the third parameter set that do not meet the constraints, retaining only configuration results that satisfy standard timing logic and physical meaning, forming the final first parameter set. The first parameter set includes multiple first parameter combinations, and each first parameter combination includes a set of DRX configuration parameter values.

[0239] Among them, the constraints include and simultaneously satisfy the following conditions: (1) duration of the listening window The parameter values ​​are all less than or equal to the duration of short DRX cycle sleep. Parameter values ​​and duration of long DRX cycle sleep The parameter value that satisfies (2) Duration of long DRX cycle sleep The parameter value is greater than or equal to the duration of short DRX cycle sleep. The parameter value that satisfies .

[0240] In summary, by using the steps S505 to S507 described above, the network device can obtain the first set of parameters.

[0241] S508, the network device uses a multi-objective optimization algorithm to select a non-dominated solution set from the first parameter set based on the first closed-form solution and the second closed-form solution.

[0242] To balance low information age and terminal energy efficiency under the constraint of protocol deployability, this application embodiment performs joint optimization of DRX configuration parameters, with the decision variable defined as a set of DRX configuration parameters. .

[0243] Furthermore, the embodiments of this application aim to minimize the first performance index (i.e., APAoI) and maximize the second performance index (i.e., energy-saving factor). To unify the problem into a minimization issue, maximizing the energy-saving factor is considered. Equivalent to minimizing Thus, a bi-objective optimization problem is constructed.

[0244] Therefore, network devices can perform performance calculations on the first parameter combination based on the first closed-form solution of the first performance index (i.e., APAoI) and the second closed-form solution of the second performance index (i.e., energy-saving factor) as predetermined above. Specifically, by substituting the parameter values ​​of a set of DRX configuration parameters included in the first parameter combination into the first closed-form solution of the first performance index shown in the above formula (22), the first performance index corresponding to the first parameter combination can be obtained; and by substituting the parameter values ​​of a set of DRX configuration parameters included in the first parameter combination into the second closed-form solution of the second performance index shown in the above formula (26), the second performance index corresponding to the first parameter combination can be obtained.

[0245] The first performance metric reflects the freshness of the status update information successfully received by the terminal device under the current set of DRX configuration parameters. The second performance metric reflects the energy efficiency of the terminal device within an update cycle under the current set of DRX configuration parameters.

[0246] This application embodiment aims to simultaneously minimize a first performance metric (APAoI) and maximize a second performance metric (energy saving factor) by jointly configuring DRX configuration parameters. Since there is a conflict between minimizing APAoI and maximizing the energy saving factor, for example, lowering APAoI requires shortening the sleep period duration in short DRX cycles. and the duration of long DRX cycle sleep Improving the energy-saving factor requires extending the duration of short DRX cycle sleep periods. and the duration of long DRX cycle sleep These two aspects conflict with each other, and configuration cannot be simply completed using a single indicator. Therefore, the embodiments of this application explicitly define the conflict in a standard form during the problem construction phase, which can minimize the conflict. and minimize In this case, searching for non-dominated solutions in the first parameter set allows for selection during engineering deployment, providing a more complete compromise space for subsequent selection. This represents the APAoI corresponding to a set of DRX configuration parameters. This represents the minimization objective after the equivalent transformation of the energy-saving factor.

[0247] Among these, multi-objective optimization algorithms include non-dominated sorting genetic algorithms, such as NSGA-II. The non-dominated solution set is the set of non-dominated solutions selected from the first parameter set, with the objective of minimizing the first performance metric and maximizing the second performance metric.

[0248] The following section uses the non-dominated sorting genetic algorithm NSGA-II as an example to explain in detail the specific implementation process of using NSGA-II to select the non-dominated solution set (also known as the approximate Pareto solution set) from the first parameter set.

[0249] The first step is to configure the network devices with the necessary algorithm parameters, such as population size. Maximum number of iterations Crossover probability and mutation probability For example, population size The maximum number of iterations is 50. The crossover probability is 200. Take 0.9, mutation probability Pick , The dimension of the decision variables is determined by a set of DRX configuration parameters ( There are 5 decision variables, therefore the probability of variation is... Take 0.2.

[0250] The second step involves the network device uniformly and randomly sampling from the first parameter set. The first parameter combination is used as a candidate parameter combination to generate the initial population. Each individual in the initial population is represented by a parameter value encoding method, meaning that each individual itself is a specific parameter value of a set of standard allowed DRX configuration parameters.

[0251] The third step is to treat the initial population. Each individual in The network device calls the first closed-form solution of the first performance index shown in formula (22) and the second closed-form solution of the second performance index shown in formula (26) to calculate each individual in the initial population. objective function value .

[0252] Fourth, the network device performs a fast non-dominated sort on all individuals in the initial population based on the objective function value, dividing the individuals into multiple non-dominated levels. The higher the non-dominated level ranking (or the smaller the non-dominated level number), the less likely that individual is to be simultaneously outperformed by other individuals in both objectives. For individuals belonging to the same non-dominated level, the crowding distance is further calculated to measure the density of solutions around that individual, ensuring that boundary solutions and more evenly distributed solutions are prioritized in the subsequent solution preservation process, rather than being concentrated in local areas.

[0253] It should be noted that, in order to minimize and minimize Taking these two objectives as an example, if individual A is less than or equal to individual B in both objectives, and individual A is also strictly less than individual B in at least one objective (meaning individual A is no worse than individual B in all objectives, and is strictly better than individual B in one objective), then individual A dominates individual B. Therefore, following this method, all solutions not dominated by any individual are found from the initial population; these solutions together constitute the first non-dominated level. The first non-dominated level is removed from the initial population, and the above selection and removal operations are repeated among the remaining individuals to obtain the second non-dominated level, the third non-dominated level, and so on.

[0254] Therefore, the embodiments of this application do not require repeated large-scale discrete event simulations during the iteration process, based on the objective function value. This allows for rapid assessment of population fitness, thereby improving overall optimization efficiency.

[0255] Fifth, the network devices select individuals from the initial population as parents to form the parent population based on multiple non-dominant levels and congestion distances using a binary tournament.

[0256] The binary tournament selection process involves randomly choosing two individuals from the current population to compete in a contest based on non-dominance level and crowding. The winner is selected to join the parent population, ensuring that the parent population contains high-quality genes from all levels while also ensuring that these genes are widely sourced.

[0257] The sixth step involves the network device selecting individuals from the parent population and performing crossover and mutation operations based on the crossover probability to generate the offspring population.

[0258] Specifically, individuals in the parent population are paired up and simulated binary crossover (SBX) is performed according to the crossover probability to generate new individuals; and polynomial mutation is performed on the individuals generated after crossover according to the mutation probability to generate the offspring population.

[0259] To ensure that all individuals satisfy protocol consistency constraints during the evolution process, feasibility repair is further performed on the offspring generated by crossover and mutation. When a parameter in a certain dimension of the offspring generated by crossover and mutation goes out of bounds, takes a non-standard value, or violates a constraint, it is mapped back to the nearest standard allowed value, and the relevant dimensions are adjusted according to the constraint relationship so that the repaired individual returns to the feasible region. Specifically, the repaired individual must simultaneously satisfy the above constraints, and each dimension is taken from the parameter value enumeration set related to DRX configuration parameters in the 3GPP standard protocol.

[0260] Step 7: For each individual in the offspring population, the network device calls the first closed-form solution of the first performance index shown in formula (22) and the second closed-form solution of the second performance index shown in formula (26) to calculate the performance of each individual in the offspring population. objective function value .

[0261] Step 8: Merge the initial population and the offspring population into a temporary population. Then, select and retain individuals from the temporary population based on the principle of prioritizing non-dominant status, followed by crowding distance. Individuals form the first new population. .

[0262] This ensures that the discovered excellent non-dominated solutions are not destroyed during the iteration process, and continuously promotes the overall population to converge toward a better Pareto boundary.

[0263] Step 9: Use the first generation of the new population. Replace the initial population from steps four through eight above, and repeat steps four through eight above to obtain a new population of the second generation. Next, a second-generation new population was used. Continue replacing the initial population from steps four through eight above, and repeat steps four through eight again. Continue in this manner until the maximum number of iterations is reached. Afterwards, the network devices will eventually form a population. The set of individuals at the first non-dominated level is output as the non-dominated solution set. Each solution in the non-dominated solution set corresponds to a set of standard deployable DRX parameter configurations and its corresponding first performance index (i.e., APAoI) and second performance index (i.e., energy saving factor).

[0264] Therefore, this application embodiment explicitly describes the core contradiction in the state update service under the Industrial Internet of Things as a dual-objective configuration problem: objective 1 is to minimize APAoI, and reduce the worst information aging degree between two adjacent state update information as much as possible; objective 2 is to maximize the energy saving factor, and increase the sleep ratio of the terminal device on the receiving side under the DRX mechanism as much as possible.

[0265] Furthermore, when constructing this dual-objective configuration problem, network devices do not pre-set a single fixed weight for the two objectives, but rather retain their parallel objective form. For different business scenarios within the Industrial Internet of Things (IIoT), the priority of the freshness of state update information and energy efficiency is not constant. For example, routine monitoring services aim to balance both, while closed-loop control services emphasize timeliness, and environmental monitoring services prioritize energy efficiency.

[0266] After constructing the bi-objective problem, network devices obtain a set of discrete parameter selection tasks. Within the first parameter set defined by the 3GPP standard protocol, NSGA-II is introduced to perform heuristic or approximate search on the bi-objective configuration problem composed of the first performance index (APAoI) and the second performance index (energy saving factor), outputting a set of uniformly covered non-dominated solutions. Its inputs are the first parameter set, the first closed-form solution of the first performance index, and the second closed-form solution of the second performance index. The output is a set of non-dominated solutions with the objective of minimizing the first performance index and maximizing the second performance index. This transforms the originally dispersed DRX configuration parameters into a comparable and computable discrete bi-objective configuration problem oriented towards engineering deployment.

[0267] In this embodiment, the network device does not simply adjust the duration of the inactive timer separately. Listening window duration Short DRX cycle sleep duration Long DRX cycle sleep duration and the number of short DRX cycles Instead of focusing on a single parameter, it enables joint modeling and unified evaluation of all key parameters within the feasible domain allowed by the standard, avoiding the problem of uncontrollable overall performance caused by local adjustment of a single parameter in the traditional approach.

[0268] S509, the network device selects the target parameter combination from the non-dominated solution set.

[0269] The objective parameter combination is a non-dominated solution that aims to minimize the first performance index and maximize the second performance index. Specifically, the objective parameter combination includes at least one of the following: the non-dominated solution corresponding to the knee point in the non-dominated solution set, the non-dominated solution corresponding to the minimum value of the first performance index, and the non-dominated solution corresponding to the maximum value of the second performance index.

[0270] To obtain a single recommended configuration that is easy to deploy directly in engineering from the non-dominated solution set, the maximum curvature method is used to extract the knee configuration based on the Pareto front (i.e., the mapping of all solutions in the non-dominated solution set in the target space), and the non-dominated solution corresponding to the knee is obtained, thereby achieving a high level of energy saving without significantly sacrificing the freshness of the state update information.

[0271] In multi-objective optimization problems, the knee point refers to the non-dominated solutions on the Pareto front that have the most drastic trade-offs in the objective function and the greatest marginal improvement costs. These solutions are usually regarded as the "cost-effective" compromise points that are most worth choosing for decision-makers when there are no explicit preferences.

[0272] Near the knee point, further improvement of one objective typically leads to a significant deterioration of the other. Therefore, the non-dominated solution corresponding to the knee point refers to a set of DRX configuration parameters located near the Pareto front inflection point, offering a good balance between timeliness and energy efficiency. This set achieves high energy savings without excessively sacrificing the freshness of state update information. For example, the knee point can refer to the point with the greatest curvature in the Pareto front.

[0273] Furthermore, in addition to selecting non-dominated solutions corresponding to the knee point from the non-dominated solution set, two representative boundary solutions can also be selected from the non-dominated solution set to adapt to different industrial IoT business scenarios.

[0274] For example, one representative type of boundary solution refers to a freshness-optimized configuration, which selects the non-dominated solution from the non-dominated solution set when the first performance metric is minimized. This is used in scenarios with stringent time-sensitivity requirements, such as industrial closed-loop control or low-latency alarms. Another representative type of boundary solution refers to an energy-saving-priority configuration, which selects the non-dominated solution from the non-dominated solution set when the second performance metric is maximized. This is used in environmental monitoring scenarios where battery life is prioritized but time sensitivity is more tolerant.

[0275] In summary, by using the steps of S508 and S509 described above, the network device can select a target parameter combination from the first parameter set based on a first closed-form solution of a first performance index and a second closed-form solution of a second performance index that have been predetermined.

[0276] Therefore, embodiments of this application can employ NSGA-II to perform heuristic or approximate search within the discrete combinatorial space to obtain a non-dominated solution set that aims to minimize the first performance metric and maximize the second performance metric. Furthermore, a knee extraction method is used to extract a set of compromise configurations (i.e., the non-dominated solutions corresponding to the knees) from the non-dominated solution set that are easy to deploy directly in engineering. This configuration achieves a high level of energy saving without significantly sacrificing state update information and can serve as a preferred recommended parameter in conventional scenarios. Moreover, embodiments of this application can simultaneously provide representative alternative configurations prioritizing both novelty and energy efficiency, adapting to different industrial IoT scenarios.

[0277] After obtaining the knee configuration and the two types of preference configurations, the network device outputs the parameter values ​​of its corresponding set of DRX configuration parameters and its corresponding first and second performance indicators as the configuration result.

[0278] For example, Figure 7 This is a simulation diagram illustrating the first and second performance metrics corresponding to the non-dominated solution set selected using a non-dominated sorting genetic algorithm, provided in an embodiment of this application. For example... Figure 7 As shown, the horizontal axis represents the first performance index (APAoI) in milliseconds, and the vertical axis represents the second performance index (i.e., energy saving factor). ).

[0279] It can be seen that, Figure 7 The curve shown is steep at first and then gentler. In the low APAoI range, further reducing APAoI will result in a loss of energy-saving factor; as APAoI increases, the energy-saving factor increases rapidly and approaches saturation.

[0280] For example, targeting Figure 7 The simulation diagram shown below illustrates the comparison results of the DRX configuration parameters and performance indicators for the non-dominated solutions corresponding to the knee point, the non-dominated solutions when the first performance index is at its minimum, and the non-dominated solutions when the second performance index is at its maximum.

[0281] Table 2 Among them, in the non-dominated solution corresponding to the knee point, the duration of the inactive timer. Listening window duration Short DRX cycle sleep duration Long DRX cycle sleep duration and the number of short DRX cycles Its corresponding APAoI is approximately 14ms, and its energy-saving factor is approximately 0.84.

[0282] In the non-dominated solution corresponding to the minimum APAoI, the duration of the inactive timer. Listening window duration Short DRX cycle sleep duration Long DRX cycle sleep duration and the number of short DRX cycles Its corresponding APAoI is approximately 5ms, and its energy-saving factor is approximately .

[0283] In the nondominated solution where the energy-saving factor is at its maximum, the duration of the inactive timer... Listening window duration Short DRX cycle sleep duration Long DRX cycle sleep duration and the number of short DRX cycles Its corresponding APAoI is approximately 106ms, and its energy-saving factor is approximately 0.98.

[0284] S510: The network device sends the target parameter combination to the terminal device.

[0285] In some embodiments, the network device may send the non-dominated solution corresponding to the knee point, the non-dominated solution corresponding to the minimum value of the first performance index, and the non-dominated solution corresponding to the maximum value of the second performance index to the terminal device. The terminal device then selects one of these non-dominated solutions to execute based on the actual situation.

[0286] In other embodiments, the network device may also select a non-dominated solution from the non-dominated solution corresponding to the knee point, the non-dominated solution corresponding to the first performance index being at its minimum value, and the non-dominated solution corresponding to the second performance index being at its maximum value, according to the service scenario corresponding to the terminal device; and send the selected non-dominated solution to the target parameter combination.

[0287] For example, the non-dominated solution corresponding to the knee point is more suitable for routine detection scenarios that balance real-time performance and long-term online operation of terminal devices; the non-dominated solution corresponding to the minimum value of the first performance index is suitable for industrial closed-loop control scenarios with high timeliness requirements; and the non-dominated solution corresponding to the maximum value of the second performance index is suitable for environmental monitoring scenarios that prioritize battery life and have a high tolerance for timeliness.

[0288] In practical applications, a non-dominated solution actually refers to a set of DRX configuration parameters ( The parameter value corresponds to the DRX configuration parameter field carried by the radio resource control (RRC) reconfiguration. Therefore, in this embodiment, the process of filtering the target parameter combination from the non-dominated solution set implemented in S501 to S509 can occur before generating / populating the DRX configuration parameter field.

[0289] Among them, the duration of the inactive timer The duration of the listening window is configured by the drx-InactivityTimer field of the RRC signaling. The duration of short DRX cycles is configured by the drx-onDurationTimer field in the RRC signaling. The configuration is determined by the drx-ShortCycleTimer in the RRC signaling. The RRC signaling also includes the drx-ShortCycle and drx-LongCycleStartOffset fields. The drx-ShortCycle field corresponds to the short DRX cycle duration. The sleep period duration of the short DRX cycle can be derived from the short DRX cycle duration corresponding to the drx-ShortCycle field and the listening window duration corresponding to the drx-onDurationTimer field. The duration of short DRX sleep cycles This equals the difference between the short DRX cycle duration and the listener window duration. The `drx-LongCycleStartOffset` field includes the long DRX cycle duration. The long DRX cycle sleep duration can be derived from the long DRX cycle duration included in the `drx-LongCycleStartOffset` field and the listener window duration corresponding to the `drx-onDurationTimer` field. The duration of long DRX sleep cycles It equals the difference between the duration of the long DRX cycle and the duration of the listening window.

[0290] Therefore, in the face of the first set of parameters defined by the 3GPP standard protocol, this application embodiment obtains a set of DRX configuration parameter values ​​that can be directly deployed by the terminal device by modeling, analyzing, and optimizing the state update process using the DRX mechanism, without adding new protocol fields or modifying existing technical specifications. Thus, after the network device obtains the set of DRX configuration parameter values ​​that the terminal device can directly deploy, it can directly issue the configuration according to the existing DRX configuration process, without requiring the terminal device to add any new protocol processing mechanisms. For example, in some embodiments, the signaling involved in issuing the target parameter combination in this application embodiment can use RRC signaling.

[0291] Thus, in this embodiment, for a terminal device employing the DRX mechanism, based on a first closed-form solution of a predetermined first performance index and a second closed-form solution of a second performance index, a joint evaluation is performed on the freshness of the state update information received by the terminal device and the receiving power consumption of the terminal device. The objective is to minimize the average peak information age and maximize the energy-saving factor, thereby obtaining a non-dominated solution between the average peak information age and the energy-saving factor. This alleviates the contradiction between enhanced energy saving and accelerated aging of state update information in existing DRX mechanisms. Therefore, in the context of the Industrial Internet of Things (IIoT), when using the DRX mechanism to receive state update information from network devices, it can balance the freshness of the state update information and the receiving power consumption of the terminal device.

[0292] Compared to existing technologies that mainly focus on average latency and single power saving indicators, the embodiments of this application construct a state space and derive a first closed-form solution for the first performance indicator and a second closed-form solution for the second performance indicator. This enables network devices to directly evaluate the timeliness and energy consumption performance under different sets of DRX configuration parameters, and more accurately reflects the real needs in new industrial scenarios.

[0293] Furthermore, this application embodiment will include a set of DRX configuration parameters ( The DRX configuration parameters are uniformly incorporated into the standard feasible domain, and a dual-objective problem of minimizing the first performance metric and maximizing the second performance metric is explicitly constructed. This eliminates the need for network devices to rely on experience or extensive simulations for repeated parameter testing. Instead, the parameter values ​​of different sets of DRX configuration parameters can be directly compared and calculated for performance evaluation, significantly improving parameter design efficiency.

[0294] Secondly, this embodiment uses NSGA-II to perform heuristic or approximate search in the discrete combinatorial space to obtain a non-dominated solution set that aims to minimize the first performance metric and maximize the second performance metric. Furthermore, a knee extraction method is used to extract a set of compromise configurations (i.e., the non-dominated solutions corresponding to the knees) from the non-dominated solution set that are easy to deploy directly in engineering. This configuration achieves a high level of energy saving without significantly sacrificing state update information and can serve as a preferred recommended parameter in conventional scenarios. Moreover, this embodiment can also simultaneously provide representative alternative configurations that prioritize both novelty and energy efficiency, adapting to different industrial IoT scenarios.

[0295] also, Figures 1 to 7 The flowcharts or scene diagrams shown are for illustrative purposes only and are not intended to limit the embodiments of this application to the examples illustrated. In fact, those skilled in the art can interpret the embodiments based on... Figures 1 to 7 The examples in the document can be transformed into equivalent ways to obtain more implementations.

[0296] The above text combined Figures 1 to 7 This document describes in detail the communication method provided in the embodiments of this application. The following will combine... Figure 8 and Figure 9 The device embodiments of this application are described in detail below. It should be understood that the communication device of this application embodiment can execute the various communication methods of the above-described embodiments of this application, that is, the specific working processes of the various products below can be referred to the corresponding processes in the above method embodiments. In the embodiments described above, the terminal device may execute some or all of the steps in each embodiment; the network device may execute some or all of the steps in each embodiment. These steps or operations are merely examples, and the embodiments of this application may also perform other operations or variations thereof. Furthermore, the steps may be executed in different orders as presented in the embodiments, and it is not necessary to execute all the operations in the embodiments of this application. Moreover, the sequence number of each step does not imply the order of execution; the execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application.

[0297] Figure 8 This is a schematic block diagram of a communication device provided in an embodiment of this application. Figure 8 As shown, the communication device 800 may include a communication unit 802. The communication unit 802 can implement corresponding communication functions, which can be internal communication functions of the communication device 800 or communication functions between the communication device 800 and other devices. Optionally, the communication unit 802 may also be referred to as a communication interface or transceiver unit. Optionally, the communication device 800 may also include a processing unit 801. The processing unit 801 can implement corresponding processing functions.

[0298] Optionally, the communication device 800 further includes a storage unit, which can be used to store instructions and / or data; the processing unit 801 can read the instructions and / or data in the storage unit so that the communication device 800 can implement the above method embodiments.

[0299] In one possible design, the communication device 800 may correspond to the network device in the above method embodiments, or to a component (such as a circuit, chip, or chip system) configured in the network device. The communication device 800 can be used to perform the steps or processes performed by the network device in any of the above method embodiments.

[0300] For example, processing unit 801 is configured to: acquire a first parameter set, the first parameter set including multiple first parameter combinations, each first parameter combination including a set of DRX configuration parameter values; processing unit 801 is further configured to: based on a first closed-form solution of a predetermined first performance index and a second closed-form solution of a second performance index, select a target parameter combination from the first parameter set, the target parameter combination being a non-dominated solution with the objective of minimizing the first performance index and maximizing the second performance index; communication unit 802 is configured to: send the target parameter combination to the terminal device. Wherein, the first performance index is used to characterize the freshness of the state update information successfully received by the terminal device, the second performance index is used to characterize the energy-saving level of the terminal device within an update cycle, and the update cycle is the time interval between two consecutive successful receptions of state update information by the terminal device.

[0301] The above are merely examples; for detailed steps or procedures, please refer to the description of the above embodiments.

[0302] Figure 9 This is a schematic diagram of another communication device provided in an embodiment of this application. The communication device 900 can be a chip, chip system, or processor, etc., used in network devices to implement the above methods. The communication device 900 can be used to implement the methods described in the above method embodiments; please refer to the descriptions in the above method embodiments for details.

[0303] like Figure 9 As shown, the communication device 900 may include one or more processors 901, which may also be referred to as processing units or processing modules, and can implement certain control functions. The processor 901 can be a general-purpose processor or a dedicated processor, such as a baseband processor or a central processing unit. The baseband processor can be used to process communication protocols and communication data, while the central processing unit can be used to control the communication device 900 (e.g., a base station, baseband chip, user, user chip), execute software programs, and process data from the software programs.

[0304] In an alternative design, the processor 901 may also store instructions and / or data that can be executed by the processor 901 to cause the communication device 900 to perform the methods described in the above method embodiments.

[0305] In another alternative design, the communication device 900 may include a communication interface 902 for implementing receiving and transmitting functions. For example, the communication interface 902 may be a transceiver circuit, interface, interface circuit, or transceiver. The transceiver circuit, interface, interface circuit, or transceiver for implementing receiving and transmitting functions may be separate or integrated. The aforementioned transceiver circuit, interface, interface circuit, or transceiver may be used for reading and writing code / data, or it may be used for transmitting or relaying signals.

[0306] Optionally, the communication device 900 may include one or more memories 903, which may store instructions that can be executed on the processor 901, causing the communication device 900 to perform the methods described in the above method embodiments. Optionally, the memories 903 may also store data. Optionally, the processor 901 may also store instructions and / or data. The processor 901 and the memories 903 may be provided separately or integrated together.

[0307] It should be understood that, in one possible design, the steps in the method embodiments provided in this application can be implemented by integrated logic circuits in the processor's hardware or by instructions in software form. The steps of the methods disclosed in the embodiments of this application can be directly implemented by a hardware processor, or implemented by a combination of hardware and software modules in the processor. The software modules can reside in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. This storage medium is located in memory, and the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above method. To avoid repetition, detailed descriptions are not provided here.

[0308] In one implementation, the communication device 900 may correspond to the network device in the above method embodiments and may be used to execute the various steps and / or processes executed by the network device in the above method embodiments. The processor 901 may be used to execute instructions stored in the memory 903, and when the processor 901 executes the instructions stored in the memory, the processor 901 is used to execute the various steps and / or processes of the above method embodiments corresponding to the network device.

[0309] It should be understood that the aforementioned processing device can be one or more chips. For example, the processing device can be a field-programmable gate array (FPGA), an application-specific integrated circuit (ASIC), a system-on-chip (SoC), a central processor unit (CPU), a network processor (NP), a digital signal processor (DSP), a microcontroller unit (MCU), a programmable logic device (PLD), or other integrated chips.

[0310] It is understood that the memory in the embodiments of this application can be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory. The non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. The volatile memory can be random access memory (RAM), which is used as an external cache. By way of example, but not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous linked dynamic random access memory (SLDRAM), and direct rambus RAM (DR RAM). It should be noted that the memory used in the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0311] According to the method provided in the embodiments of this application, this application also provides a chip system, which includes one or more processors for calling and executing instructions stored in memory, thereby causing the method described in the embodiments of this application to be executed. The chip system may be composed of chips or may include chips and other discrete devices.

[0312] The chip system may include input circuits or interfaces for transmitting information or data, and output circuits or interfaces for receiving information or data.

[0313] According to the method provided in the embodiments of this application, this application also provides a communication system, which includes a terminal device and a network device. The network device is used to perform the above-described communication method, and the terminal device is used to receive a target parameter combination from the network device.

[0314] According to the method provided in the embodiments of this application, this application also provides a computer program product, which includes: computer program code, which, when run on a computer, causes the computer to execute the various steps or processes executed by the network device in any of the above method embodiments.

[0315] According to the method provided in the embodiments of this application, this application also provides a computer-readable storage medium storing program code, which, when run on a computer, causes the computer to execute the various steps or processes executed by the network device in any of the above method embodiments.

[0316] The computer-readable storage medium may be the aforementioned volatile memory or non-volatile memory, or it may include both volatile memory and non-volatile memory.

[0317] In the embodiments of this application, the terms and English abbreviations are exemplary examples given for ease of description and should not be construed as limiting the application in any way. This application does not preclude the possibility of defining other terms that can achieve the same or similar functions in existing or future agreements.

[0318] In the above embodiments, implementation can be achieved, in whole or in part, through software, hardware, firmware, or any combination thereof. When implemented in software, it can be implemented, in whole or in part, as a computer program product. This computer program product includes one or more computer instructions. When these computer instructions are loaded and executed on a computer, all or part of the processes or functions shown in the embodiments of this application are generated.

[0319] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

[0320] It should be understood that in the various embodiments of this application, the sequence number of each process does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application.

[0321] In summary, the above description is merely a preferred embodiment of the technical solution of this application and is not intended to limit the scope of protection of this application. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this application should be included within the scope of protection of this application.

Claims

1. A communication method, characterized in that, Applied to network devices, the method includes: Obtain a first parameter set, which includes multiple first parameter combinations, each of which includes a set of DRX configuration parameter values; Based on a first closed-form solution of a first performance index and a second closed-form solution of a second performance index, a target parameter combination is selected from the first parameter set. The first closed-form solution refers to an explicit expression of the first performance index with respect to the set of DRX configuration parameters, and the second closed-form solution refers to an explicit expression of the second performance index with respect to the set of DRX configuration parameters. The target parameter combination is a non-dominated solution that aims to minimize the first performance index and maximize the second performance index. Send the target parameter combination to the terminal device; The first performance index is used to characterize the freshness of the status update information successfully received by the terminal device, and the second performance index is used to characterize the energy saving level of the terminal device within an update cycle, wherein the update cycle is the time interval between two consecutive successful receptions of the status update information by the terminal device.

2. The method according to claim 1, characterized in that, The process of obtaining the first parameter set includes: Obtain the second parameter set, which includes an enumeration set of parameter values ​​for various DRX configuration parameters in the set of DRX configuration parameters; Based on the Cartesian product of the enumerated sets of parameter values ​​of the various DRX configuration parameters, a third parameter set is determined. The third parameter set includes multiple second parameter combinations, and each second parameter combination includes the parameter values ​​of the set of DRX configuration parameters. The first parameter set is obtained by removing the second parameter combinations that do not meet the constraints from the third parameter set.

3. The method according to claim 1, characterized in that, The process of selecting target parameter combinations from the first parameter set based on a first closed-form solution of a predetermined first performance index and a second closed-form solution of a second performance index includes: Based on the first closed-form solution and the second closed-form solution, a multi-objective optimization algorithm is used to select a set of non-dominated solutions from the first parameter set; The target parameter combination is selected from the non-dominated solution set; The multi-objective optimization algorithm includes a non-dominated sorting genetic algorithm; the objective parameter combination includes at least one of the following: the non-dominated solution corresponding to the knee point in the non-dominated solution set, the non-dominated solution corresponding to the minimum value of the first performance index, and the non-dominated solution corresponding to the maximum value of the second performance index.

4. The method according to claim 1, characterized in that, The set of DRX configuration parameters includes at least one of the following: duration of inactive timers, duration of listener windows, duration of short DRX cycle sleep periods, duration of long DRX cycle sleep periods, and number of short DRX cycle durations.

5. The method according to claim 4, characterized in that, The method further includes: A state space is constructed, which includes a first state, a second state, and a third state. The first state indicates that the service state is a non-burst state and the network device does not cache the state update information. The second state indicates that the service state is a non-burst state and the network device caches the state update information. The third state indicates that the service state is a burst state. Based on the state space and the state transition probabilities between each state under the sleep time slot, a sleep time slot advancement matrix is ​​constructed. Based on the state space and the state transition probabilities between each state under the listening time slot, a listening time slot advancement matrix is ​​constructed. Based on the sleep time slot advancement matrix, the listening time slot advancement matrix, and the set of DRX configuration parameters, the first closed-form solution and the second closed-form solution are determined respectively.

6. The method according to claim 5, characterized in that, In the sleep time slot advancement matrix, the state transition probability between some states is related to the first arrival probability of the state update information in the non-burst state; In the listening time slot advance matrix, the state transition probability between some states is related to the single time slot successful transmission probability, while the state transition probability between other states is related to the first arrival probability and the single time slot successful transmission probability. The single time slot successful transmission probability represents the probability that the terminal device successfully decodes the state update information within a time slot.

7. The method according to claim 5, characterized in that, The process of determining the first closed-form solution and the second closed-form solution based on the sleep time slot advancement matrix, the listening time slot advancement matrix, and the set of DRX configuration parameters includes: Based on the initial distribution vector corresponding to the state space, the sleep time slot advancement matrix, the listening time slot advancement matrix, and the set of DRX configuration parameters, the expected update cycle duration is determined; Based on the initial distribution vector, the sleep time slot advancement matrix, the listening time slot advancement matrix, the first arrival probability of the state update information in the non-burst state, the single time slot successful transmission probability, and the set of DRX configuration parameters, the system time expectation is determined. Based on the expected update cycle duration and the expected system time, the first closed-form solution is determined.

8. The method according to claim 5, characterized in that, The process of determining the first closed-form solution and the second closed-form solution based on the sleep time slot advancement matrix, the listening time slot advancement matrix, and the set of DRX configuration parameters includes: Based on the initial distribution vector corresponding to the state space, the sleep time slot advancement matrix, the listening time slot advancement matrix, and the set of DRX configuration parameters, the expected update cycle duration is determined; Based on the initial distribution vector, the sleep time slot advancement matrix, the listening time slot advancement matrix, and the set of DRX configuration parameters, the expected sleep duration within an update cycle is determined; Based on the expected sleep duration and the expected update cycle duration, the second closed-form solution is determined.

9. The method according to claim 7 or 8, characterized in that, The determination of the expected update cycle duration based on the initial distribution vector corresponding to the state space, the sleep time slot advancement matrix, the listening time slot advancement matrix, and the set of DRX configuration parameters includes: Based on the sleep time slot advancement matrix, the listening time slot advancement matrix, the listening window duration, the short DRX cycle sleep duration, the long DRX cycle sleep duration, and the number of short DRX cycles, the expected time consumption vector is determined. Based on the monitoring time slot advance matrix and the duration of the inactive timer, determine the first sub-cycle transition matrix corresponding to the inactive timer; Based on the monitoring time slot advancement matrix, the time slot length, and the duration of the inactive timer, the first sub-cycle time consumption reward vector corresponding to the inactive timer is determined; Based on the initial distribution vector, the expected time consumption vector, the first sub-cycle transition matrix, and the first sub-cycle time consumption reward vector, the expected duration of the update cycle is determined.

10. The method according to claim 9, characterized in that, The determination of the expected time consumption vector based on the sleep time slot advancement matrix, the monitoring time slot advancement matrix, the monitoring window duration, the short DRX cycle sleep duration, the long DRX cycle sleep duration, and the number of short DRX cycles includes: Based on the sleep time slot advancement matrix, the monitoring time slot advancement matrix, the short DRX cycle sleep duration, and the monitoring window duration, the second sub-cycle transition matrix corresponding to the short DRX cycle is determined. Based on the sleep time slot advancement matrix, the listening time slot advancement matrix, the time slot length, the short DRX cycle sleep duration, and the listening window duration, the second sub-cycle time consumption reward vector corresponding to the short DRX cycle is determined. Based on the sleep time slot advancement matrix, the listening time slot advancement matrix, the sleep duration of the long DRX cycle, and the listening window duration, the third sub-cycle transition matrix corresponding to the long DRX cycle is determined. Based on the sleep time slot advancement matrix, the listening time slot advancement matrix, the time slot length, the sleep duration of the long DRX cycle, and the listening window duration, the time consumption reward vector of the third sub-cycle corresponding to the long DRX cycle is determined. The expected time consumption vector is determined based on the second sub-cycle transition matrix, the second sub-cycle time consumption reward vector, the third sub-cycle transition matrix, the third sub-cycle time consumption reward vector, and the number of short DRX cycles.

11. The method according to claim 7, characterized in that, The system time expectation is determined based on the initial distribution vector, the sleep time slot advancement matrix, the listening time slot advancement matrix, the first arrival probability of the state update information in the non-burst state, the single time slot successful transmission probability, and the set of DRX configuration parameters, including: Based on the sleep time slot advancement matrix, the listening time slot advancement matrix, the first arrival probability, the single time slot successful transmission probability, the listening window duration, the short DRX cycle sleep duration, the long DRX cycle sleep duration, and the short DRX cycle duration, the expected system time reward vector is determined. Based on the monitoring time slot advance matrix and the duration of the inactive timer, determine the first sub-cycle transition matrix corresponding to the inactive timer; The expected system time is determined based on the initial distribution vector, the expected system time reward vector, and the first sub-cycle transition matrix.

12. The method according to claim 11, characterized in that, The determination of the expected system time reward vector based on the sleep slot advancement matrix, the listening slot advancement matrix, the first arrival probability, the single-slot successful transmission probability, the listening window duration, the short DRX cycle sleep duration, the long DRX cycle sleep duration, and the short DRX cycle duration includes: Based on the sleep time slot advancement matrix, the monitoring time slot advancement matrix, the short DRX cycle sleep duration, and the monitoring window duration, the second sub-cycle transition matrix corresponding to the short DRX cycle is determined. Based on the sleep time slot advancement matrix, the listening time slot advancement matrix, the sleep duration of the long DRX cycle, and the listening window duration, the third sub-cycle transition matrix corresponding to the long DRX cycle is determined. Based on the sleep time slot advancement matrix, the first arrival probability, the single time slot successful transmission probability, and the short DRX cycle sleep duration, the first system time expected contribution reward vector corresponding to the short DRX cycle is determined. Based on the sleep time slot advancement matrix, the first arrival probability, the single time slot successful transmission probability, and the sleep duration of the long DRX cycle, the second system time expected contribution reward vector corresponding to the long DRX cycle is determined. The expected system time reward vector is determined based on the second sub-cycle transition matrix, the first system time expected contribution reward vector, the third sub-cycle transition matrix, the second system time expected contribution reward vector, and the duration of the short DRX cycle.

13. The method according to claim 12, characterized in that, The step of determining the first system time expected contribution reward vector corresponding to the short DRX cycle based on the sleep time slot advancement matrix, the first arrival probability, the single time slot successful transmission probability, and the short DRX cycle sleep period duration includes: Based on the first arrival probability, the time slot length, and the short DRX cycle sleep duration, the expected first dwell time corresponding to the short DRX cycle is determined; Based on the first arrival probability and the first dwell time expectation, determine the first system time contribution vector corresponding to the first listening slot in the short DRX cycle; Based on the first arrival probability and the single-slot successful transmission probability, determine the success probability weight vector corresponding to the first listening slot; Based on the sleep time slot advancement matrix, the short DRX cycle sleep duration, the first system time contribution vector, and the success probability weight vector, the expected time contribution reward vector of the first system is determined.

14. The method according to claim 12, characterized in that, The step of determining the second system time expected contribution reward vector corresponding to the long DRX cycle based on the sleep time slot advancement matrix, the first arrival probability, the single time slot successful transmission probability, and the long DRX cycle sleep period duration includes: Based on the first arrival probability, the time slot length, and the sleep duration of the long DRX cycle, the second dwell time expectation corresponding to the long DRX cycle is determined; Based on the first arrival probability and the second dwell time expectation, determine the second system time contribution vector corresponding to the first listening slot in the long DRX cycle; Based on the first arrival probability and the single-slot successful transmission probability, determine the success probability weight vector corresponding to the first listening slot; Based on the sleep time slot advancement matrix, the long DRX cycle sleep duration, the second system time contribution vector, and the success probability weight vector, the expected time contribution reward vector of the second system is determined.

15. The method according to claim 8, characterized in that, The step of determining the expected sleep duration within an update cycle based on the initial distribution vector, the sleep time slot advancement matrix, the listening time slot advancement matrix, and the set of DRX configuration parameters includes: Based on the sleep time slot advancement matrix, the listening time slot advancement matrix, the time slot length, the listening window duration, the short DRX cycle sleep duration, the long DRX cycle sleep duration, and the short DRX cycle duration, the expected cumulative sleep reward vector is determined. Based on the monitoring time slot advance matrix and the duration of the inactive timer, determine the first sub-cycle transition matrix corresponding to the inactive timer; The expected sleep duration is determined based on the initial distribution vector, the first sub-cycle transition matrix, and the expected cumulative sleep reward vector.

16. The method according to claim 15, characterized in that, The determination of the expected cumulative sleep reward vector based on the sleep time slot advancement matrix, the monitoring time slot advancement matrix, the time slot length, the monitoring window duration, the short DRX cycle sleep duration, the long DRX cycle sleep duration, and the number of short DRX cycles includes: Based on the sleep time slot advancement matrix, the monitoring time slot advancement matrix, the short DRX cycle sleep duration, and the monitoring window duration, the second sub-cycle transition matrix corresponding to the short DRX cycle is determined. Based on the sleep time slot advancement matrix, the listening time slot advancement matrix, the sleep duration of the long DRX cycle, and the listening window duration, the third sub-cycle transition matrix corresponding to the long DRX cycle is determined. The expected cumulative sleep reward vector is determined based on the second sub-cycle transition matrix, the third sub-cycle transition matrix, the time slot length, the short DRX cycle sleep duration, the long DRX cycle sleep duration, and the number of short DRX cycles.

17. The method according to claim 1, characterized in that, The terminal device is an industrial Internet of Things (IoT) device.

18. A communication device, characterized in that, The device includes at least one processor coupled to a memory storing a program or instructions, the processor executing the program or instructions to cause the communication device to perform the communication method as described in any one of claims 1 to 17.

19. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program or instructions that, when executed, implement the communication method as described in any one of claims 1 to 17.

20. A communication system, characterized in that, The communication system includes a terminal device and a network device, the network device being used to perform the communication method as described in any one of claims 1 to 17, and the terminal device being used to receive a target parameter combination from the network device.

Images