Fog computing optimization method and system based on backbone network assisted non-orthogonal multiple access mechanism
By adopting a non-orthogonal multi-access mechanism assisted by backbone network in the fog computing system, combining time slots and power control, optimizing the resource allocation of sensor nodes, the problems of delay and energy consumption in the existing technology are solved, and low latency is achieved low energy consumption effect.
Patent Information
- Application Number
- CN202411007233.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-25
- Publication Date
- 2024-12-03
AI Technical Summary
The prior art fails to effectively combine power control and resource allocation in the fog computing system, resulting in the delay and total energy consumption cost that cannot meet the user's low-latency and low-energy consumption requirements, and does not consider the impact of signal interference on the access point decoding capabilities. , resulting in waste of computing resources and increased transmission delay.
Using a non-orthogonal multi-access mechanism based on backbone network assistance, by constructing time slot constraints, transmission power constraints, signal-to-noise ratio constraints and computing resource constraints, combined with heuristic algorithms, iteratively solves them to optimize the scheduling and resource allocation of sensor nodes. To minimize system delay and total energy consumption cost.
By jointly optimizing transmission power, signal decoding sequence and resource allocation, the system delay and energy consumption are significantly reduced, signal decoding capabilities are improved, resource utilization is optimized, and the requirements of low latency and low energy consumption are met.
Smart Images

Figure CN119071254A_ABST
Abstract
Description
Technical Field
[0001] The present invention belongs to the field of fog computing network optimization, and in particular relates to a fog computing optimization method and system based on a backbone network-assisted non-orthogonal multiple access mechanism. Background Art
[0002] Fog computing, also known as fog networking, is a distributed computing architecture that aims to extend computing, storage, and network services to the edge of the network to meet application scenarios that require low latency, high bandwidth, and real-time processing. Based on cloud computing, fog computing further sinks data processing capabilities to network edge devices, forming a cloud-fog-end collaborative computing model. Fog computing allows a large number of computing-intensive tasks to be transferred from mobile devices to nearby server nodes. Since the computing power of server nodes far exceeds that of mobile devices, they can process these tasks quickly, significantly improving latency performance.
[0003] Non-orthogonal multiple access (NOMA) is an advanced multiple access technology designed to improve the spectrum efficiency of wireless communication systems. Unlike traditional orthogonal multiple access technologies (such as OFDMA, TDMA, and CDMA), NOMA allows multiple users to transmit data on the same time and frequency resources, but distinguishes users through different power levels. BA-NOMA is a backbone network-assisted mechanism based on NOMA technology to further optimize and improve the performance of NOMA systems. BA-NOMA uses the additional resources and paths provided by the backbone network to enhance the reliability and efficiency of signal transmission. The backbone network can provide additional transmission paths and relay functions, and improve signal coverage and transmission quality through cooperative transmission and multi-hop transmission. Through the backbone network, interference between users can be effectively managed and reduced. For example, the backbone network can improve the signal-to-noise ratio of the received signal through cooperative interference cancellation and signal enhancement technology.
[0004] Existing research works focus on both resource allocation and power control. However, the research combining power control and resource allocation does not consider the total cost of latency and energy consumption of fog computing systems. Only considering latency or energy consumption does not meet the current user requirements of low latency and low energy consumption. In addition, research involving fog computing systems has not considered the impact of signal interference on the decoding capability of access points. The decline in decoding capability directly determines the accuracy of data retransmission and the size of transmission delay. In addition, due to the idle waiting time of fog nodes receiving data, the increase in transmission delay will lead to a waste of computing resources. Therefore, effectively improving the signal decoding capability within the NOMA mechanism is a key factor in optimizing system latency. A backbone-assisted NOMA mechanism is proposed to optimize the latency and energy consumption of multiple APs and multiple sensors in actual scenarios. Summary of the invention
[0005] The purpose of the present invention is to provide a fog computing optimization method and system based on a backbone network-assisted non-orthogonal multiple access mechanism to solve the problems of excessive energy consumption caused by unreasonable power allocation, increased transmission delay caused by signal interference generated when multiple sensors transmit tasks at the same time, and increased computing delay caused by unreasonable allocation of fog node computing resources.
[0006] To achieve the above object, the present invention adopts the following technical solutions:
[0007] In a first aspect, the present invention provides a fog computing optimization method based on a backbone network-assisted non-orthogonal multiple access mechanism, comprising:
[0008] Collect sensor node task data as data sets and transmit them on access points and fog nodes;
[0009] During the task data transmission process, construct the front and back time slot constraints, transmission power and time slot state constraints, sensor signal-to-noise ratio (SINR) constraints, data transmission constraints, computing resource constraints, and completion time constraints;
[0010] Based on the objective function, under the constraints, the scheduling of sensor nodes under given power and resource allocation conditions is calculated;
[0011] Given a node schedule, determine the power, computing and time resource allocation, and calculate the minimum delay and total energy cost required for task execution.
[0012] Furthermore, the sensor node task data is collected as a data set and transmitted on the access point and fog node, including:
[0013] The set of industrial sensor nodes, access points and fog nodes are represented as The task S generated by the sensor n By tuple (d n ,f n )express.
[0014] Furthermore, the constraints of the front and back time slots are constructed, including:
[0015] The total transmission time is divided into N unequal time slots, which are composed of Indicates; X i To indicate whether the i-th time slot is active, Y in Indicates whether the sensor is active in the i-th time slot when transmitting data; if the i-th time slot is active, then X i is equal to 1; otherwise it is equal to 0; that is, when X i =0,X i+1 =0; then the constraints are as follows:
[0016] Xi t i ≥X i+1 t i+1 .
[0017] Furthermore, the transmission power and time slot state constraints include:
[0018] The transmission power of each sensor does not exceed the maximum power value in the active time slot. The transmission power constraint is as follows:
[0019]
[0020] Where P n Represents the transmission power of the sensor, P max represents the maximum transmission power of the sensor, Y in Indicates whether the sensor is active in the i-th time slot when transmitting data;
[0021] It is also necessary to meet the condition that sensors are allowed to transmit information only in active time slots. The time slot state constraints are as follows:
[0022]
[0023] Furthermore, the signal-to-noise ratio (SINR) constraints of the sensor include:
[0024]
[0025]
[0026] Where γ represents the decoding threshold of AP, de in represents the decoding order of the sensor signal in the i-th time slot, g inm is the channel power gain from the sensor to the AP;
[0027] The data transmission conditions are as follows:
[0028]
[0029]
[0030] where r in represents the data transmission rate of the sensor, d n Represents the data volume of the sensor task; the computing resources allocated to the task by the fog node do not exceed its own resource capacity and meet the following computing resource constraints:
[0031]
[0032] where μ mn represents the proportion of computing resources allocated to sensor n by fog node m;
[0033] The completion delay of all tasks is determined by the completion delay of the largest task, so the completion time constraint is as follows:
[0034]
[0035] Furthermore, the objective function is:
[0036]
[0037] Where λ is the weight of delay and energy consumption, E_n is the energy consumption of the sensor task, and this function is the problem of minimizing the weighted sum of delay and energy consumption.
[0038] Furthermore, under the constraints, the sensor node scheduling under the given power and resource allocation conditions is calculated, the power, computing and time resource allocation is determined given the node scheduling, and the minimum delay and total energy consumption cost required for task execution are calculated, including:
[0039] A load threshold γ1 is introduced. When d n / f n When ≥γ1, S n The task is defined as a communication-intensive task; otherwise, it is defined as a computation-intensive task; when all sensors are not assigned to time slots, the loop continues; in each iteration, the sensors are first divided into communication-intensive sensors and computation-intensive sensors, and the sensors of the communication-intensive node set that meet the SINR constraint are selected in turn, and the selected sensors are added to the active node set κ i and from candidate set C and communication intensive set D z ; when further addition is impossible, sensors that meet the SINR constraint are selected from the computationally intensive node set in turn; when all sensors in the candidate set C cannot meet the SINR constraint, the active node set S of the current i-th time slot is returned n |y in =1; the process starts to determine the active sensor for the next i+1 time slot;
[0040] In the known {x i},{y in},{de in} and {t i ,μ mn ,T o}, according to the lemma, we can get {P n}. In the given {x i},{y in},{de in}, use Algorithm 1 to obtain the variable value {t i ,μ mn ,To} and then proceed to the next iteration.
[0041] In a second aspect, the present invention provides a fog computing optimization system based on a backbone network-assisted non-orthogonal multiple access mechanism, comprising:
[0042] The data acquisition module is used to collect the sensor node task data as a data set and transmit it on the access point and fog node;
[0043] The constraint building module is used to build the front and back time slot constraints, transmission power and time slot state constraints, sensor signal-to-noise ratio (SINR) constraints, data transmission constraints, computing resource constraints and completion time constraints during the task data transmission process;
[0044] The scheduling calculation module is used to calculate the sensor node scheduling under given power and resource allocation conditions based on the objective function and under constraints;
[0045] The output module is used to determine the power, computing and time resource allocation given the node scheduling, and calculate the minimum delay and total energy cost required for task execution.
[0046] In a third aspect, the present invention provides a computer device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, the processor implements the steps of a fog computing optimization method based on a backbone network-assisted non-orthogonal multiple access mechanism.
[0047] In a fourth aspect, the present invention provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of a fog computing optimization method based on a backbone network-assisted non-orthogonal multiple access mechanism are implemented.
[0048] Compared with the prior art, the present invention has the following technical effects:
[0049] Aiming at the problem of excessive total system cost caused by unreasonable resource allocation of fog computing network based on backbone network assisted non-orthogonal multiple access mechanism, the present invention proposes a NOMA mechanism assisted by backbone network to enhance signal decoding capability. By combining time slot state adjustment and power control to jointly optimize sensor node scheduling, an iterative solution method based on heuristic algorithm is proposed, which decomposes the original problem into two sub-problems, determines the node scheduling scheme under given transmission power and resource allocation conditions, and then uses the node scheduling scheme to determine the transmission power and resource allocation. The two sub-problems are iterated to optimize the transmission power, signal decoding order, time slot state and resource allocation to minimize the system delay and total energy consumption cost. BRIEF DESCRIPTION OF THE DRAWINGS
[0050] Figure 1 It is a flow chart of the present invention.
[0051] Figure 2 This is the overall architecture diagram of the fog computing network.
[0052] Figure 3 This is a structural comparison diagram of NOMA and BA-NOMA. DETAILED DESCRIPTION
[0053] The specific implementation of the present invention will be described in more detail below in conjunction with the schematic diagram. The advantages and features of the present invention will become clearer from the following description and claims. It should be noted that the drawings are all in a very simplified form and are not in exact proportions, and are only used to facilitate and clearly assist in explaining the purpose of the embodiments of the present invention.
[0054] Example 1, please refer to Figure 1 , a fog computing optimization method based on backbone network assisted non-orthogonal multiple access mechanism, including:
[0055] Collect sensor node task data as data sets and transmit them on access points and fog nodes;
[0056] During the task data transmission process, construct the front and back time slot constraints, transmission power and time slot state constraints, sensor signal-to-noise ratio (SINR) constraints, data transmission constraints, computing resource constraints, and completion time constraints;
[0057] Based on the objective function, under the constraints, the scheduling of sensor nodes under given power and resource allocation conditions is calculated;
[0058] Given a node schedule, determine the power, computing and time resource allocation, and calculate the minimum delay and total energy cost required for task execution.
[0059] Embodiment 2, as Figure 2 As shown, the overall architecture of the fog computing network of this patent is composed of sensor nodes, access points and fog nodes. First, each sensor node generates an independent task, and each task is represented by communication volume and computing volume. Then, these task data are transmitted to the relevant access points, and then the access points forward the task data to the fog nodes for processing. Then, given the transmission power and computing and time resource allocation, the sensor node scheduling scheme is obtained through the proposed heuristic algorithm. Given the node scheduling, the transmission power, computing and time resource allocation scheme is determined. Combined with the heuristic algorithm, the two sub-problems are continuously iterated, and finally a suboptimal solution to the problem of minimizing the total system cost is obtained.
[0060] The total cost optimization method for minimizing the system in the fog computing network implemented by the present invention comprises the following steps:
[0061] Step 1: The set of industrial sensor nodes, access points and fog nodes are represented as The task S generated by the sensor n By tuple (d n ,f n ) In order to ensure the reliability of data transmission, the total transmission time is divided into N unequal time slots, which are represented by the set Indicates. i To indicate whether the i-th time slot is active, Y in Indicates whether the sensor is active in the i-th time slot when transmitting data. in Indicates S in the i-th time slot n Signal decoding order, μ mn Indicates that fog node m is assigned to S n The ratio of computing resources, T o Indicates the total latency of all tasks.
[0062] The second step is to satisfy the requirement that the slot state can only change from active mode to sleep mode, that is, if the i-th slot is active, then X i is equal to 1; otherwise it is equal to 0. That is, when X i =0,X i+1 =0. Then the constraints are as follows:
[0063] X i t i ≥X i+1 t i+1
[0064] In the third step, the transmission power of each sensor does not exceed the maximum power value in the active time slot to prevent the total energy consumption of the system from being too large. The transmission power constraint is as follows:
[0065]
[0066] To meet the requirement that sensors can only transmit information in active time slots, the time slot state constraints are as follows:
[0067]
[0068]
[0069] In the fourth step, the task is interfered by other signals during transmission, so the sensor's signal-to-noise ratio (SINR) constraints are as follows:
[0070]
[0071]
[0072] Step 5: During data transmission, the channel capacity should not be less than the task data volume to ensure the integrity of task transmission. The constraints of data transmission are as follows:
[0073]
[0074]
[0075] Step 6: The fog node itself has limited resources. The computing resources it allocates to the task should not exceed its own resource capacity to ensure the reasonable operation of the task. The computing resource constraints are as follows:
[0076]
[0077] In the seventh step, the completion delay of all tasks is determined by the completion delay of the largest task, so the completion time constraint is as follows:
[0078]
[0079] Step 8: Construct an optimization model to minimize the total system cost of the fog computing network:
[0080]
[0081] Because this problem is a complex mixed integer nonlinear programming problem, which is an NP-hard problem, there are forms of variable multiplication and fractional expressions containing many variables, which makes it very difficult to solve.
[0082] Step 9: Separate the parameter subsets, that is, {t i ,μ mn ,T o} and {X i ,Y in ,P in ,de in Given the transmission power and computational and time resource allocation, solve the P1-A problem:
[0083]
[0084] Where E n represents the energy consumption of the sensor. Subproblem P1-A is a convex optimization problem. By solving it, we can get the optimal computational allocation and time resource allocation and
[0085] Step 10: Given the node schedule, determine the transmission power, computation and time resource allocation scheme. P1-B solves two problems: determining in which time slot the sensor node sends data and the decoding order after the AP receives the data and determining the transmission power of each transmitting node in the active time slot.
[0086] Considering the first aspect, this problem is a typical combinatorial optimization problem. Solving it with a brute force algorithm will produce exponential time complexity. Therefore, an improved heuristic algorithm is used to solve this problem, introducing a load threshold γ1. When d n / f n When ≥γ1, S n The task is defined as a communication-intensive task. Otherwise, it is defined as a computation-intensive task. When all sensors are not assigned to a time slot, the loop continues (lines 1-23). In each iteration, the sensors are first divided into communication-intensive sensors and computation-intensive sensors (lines 2-5). The sensors of the communication-intensive node set that meet the SINR constraint are selected in turn, and the selected sensors are added to the active node set κ i and from candidate set C and communication intensive set D z When further addition is not possible, sensors that meet the SINR constraint are selected from the computationally intensive node set in turn. When all sensors in the candidate set C cannot meet the SINR constraint, the active node set S of the current i-th time slot is returned. n |y in =1. The process starts to determine the active sensor for the next i+1 time slot. Then Algorithm 1 is as follows:
[0087]
[0088]
[0089] Considering the second aspect, an iterative solution method based on heuristic algorithm is proposed. The core idea is to first use the given {t i ,μ mn ,T o} to solve the problem P1-B in {x i},{y in},{de in}. Then, given {x i},{y in},{de in} and {t i ,μ mn ,T o}, according to the lemma, we can get {P n}. In the given {x i},{y in},{de in}, use Algorithm 1 to obtain the variable value {t i ,μ mn ,T o}, and then proceed to the next iteration. Algorithm 2 is as follows:
[0090]
[0091] In yet another embodiment of the present invention, a cost optimization method for a fog computing network based on a backbone network assisted non-orthogonal multiple access mechanism and a related device system are provided, which can be used to implement the cost optimization method for a fog computing network based on a backbone network assisted non-orthogonal multiple access mechanism. Specifically, the system includes:
[0092] The data acquisition module is used to collect the sensor node task data as a data set and transmit it on the access point and fog node;
[0093] The constraint building module is used to build the front and back time slot constraints, transmission power and time slot state constraints, sensor signal-to-noise ratio (SINR) constraints, data transmission constraints, computing resource constraints and completion time constraints during the task data transmission process;
[0094] The scheduling calculation module is used to calculate the sensor node scheduling under given power and resource allocation conditions based on the objective function and under constraints;
[0095] The output module is used to determine the power, computing and time resource allocation given the node scheduling, and calculate the minimum delay and total energy cost required for task execution.
[0096] The module division in the embodiments of the present invention is only for illustration and is used for logical function division. In actual implementation, different division methods may be adopted. In addition, in various embodiments of the present invention, each functional module may be integrated into a processor, or may exist as an independent physical entity, or two or more modules may be integrated into a processor. The integrated module may be implemented in the form of hardware or in the form of software functional modules.
[0097] In an embodiment of the present invention, a computer device is described. The computer device includes a processor and a memory. The memory is used to store computer programs, including a set of instructions to be executed in a specific order. The processor is used to execute program instructions in the memory. The processor can be a central processing unit (CPU), or a graphics processing unit (GPU), a digital signal processor (DSP), a field programmable gate array (FPGA), or other programmable logic devices. The processor serves as a computing and control core, loading and executing instructions to implement a method flow or function; the processor described in the embodiment of the present invention can be used for the operation of a total cost optimization method for minimizing a system in a fog computing network.
[0098] In an embodiment of the present invention, a computer-readable storage medium (Memory) is also provided, and the storage medium is a device for storing programs and data in a computer device. It can be explained that the computer-readable storage medium here may include both built-in storage media and extended storage media. The storage medium provides a storage space, which contains an operating system of the device and a set of instructions executed in a specific order. These instructions can be one or more computer programs (including program codes). It should be noted that the storage medium here can be a high-speed random access memory (RAM) or an auxiliary memory, such as a disk storage or an optical disk. The processor loads and executes the instructions stored in the computer-readable storage medium to implement the corresponding steps of the total cost optimization method for minimizing the system in the fog computing network in the above embodiment.
[0099] It will be appreciated by those skilled in the art that embodiments of the present invention may be provided as methods, systems, or computer program products. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present invention may be implemented in the form of a computer program product on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical disk, etc.) containing available program code.
[0100] The present invention is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the processes and / or boxes in the flowchart and / or block diagram, can be implemented through computer program instructions. These computer program instructions can be provided to a processor on a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to form a machine, so that the instructions executed by these processors can implement the device specified by one or more processes in the flowchart and / or one or more boxes in the block diagram.
[0101] These computer program instructions may also be stored in a computer-readable storage medium to direct a computer or other programmable data processing device to operate in a specific manner. When the instructions stored in the computer-readable storage medium are executed, a device including the instructions will be generated. The instruction device can implement the functions specified by one or more processes in the flowchart and / or one or more blocks in the block diagram.
[0102] These computer program instructions can also be loaded into a computer or other programmable processing device to enable the implementation of a series of operating steps on the computer or other programmable device, so that the instructions executed on the computer or other programmable device provide for implementing the steps in the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.
[0103] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the above embodiments, ordinary technicians in the relevant field should understand that the specific implementation methods of the present invention can still be modified or replaced by equivalents. Any modification or equivalent replacement that does not depart from the spirit and scope of the present invention should be covered within the scope of protection of the claims of the present invention.
Claims
1. A fog computing optimization method based on backbone network-assisted non-orthogonal multiple access mechanism, characterized in that: include: Collect sensor node task data as data sets and transmit them on access points and fog nodes; During the task data transmission process, construct the front and back time slot constraints, transmission power and time slot state constraints, sensor signal-to-noise ratio (SINR) constraints, data transmission constraints, computing resource constraints, and completion time constraints; Based on the objective function, under the constraints, the scheduling of sensor nodes under given power and resource allocation conditions is calculated; Given a node schedule, power, computation, and time resource allocation is determined, and the minimum latency and total energy cost required for task execution are calculated.
2. The fog computing optimization method based on backbone network assisted non-orthogonal multiple access mechanism according to claim 1 is characterized in that: Collect sensor node task data as a data set and transmit it on access points and fog nodes, including: The set of industrial sensor nodes, access points and fog nodes are represented as The task S generated by the sensor n By tuple (d n ,f n )express.
3. The fog computing optimization method based on backbone network assisted non-orthogonal multiple access mechanism according to claim 1 is characterized in that: Construct the front and back time slot constraints, including: The total transmission time is divided into N unequal time slots, which are composed of Indicates; X i To indicate whether the i-th time slot is active, Y in Indicates whether the sensor is active in the i-th time slot when transmitting data; if the i-th time slot is active, then X i is equal to 1; otherwise it is equal to 0; that is, when X i =0,X i+1 =0; then the constraints are as follows: X i t i ≥X i+1 t i+1 。 4. The fog computing optimization method based on backbone network assisted non-orthogonal multiple access mechanism according to claim 3 is characterized in that: Transmit power and time slot state constraints, including: The transmission power of each sensor does not exceed the maximum power value in the active time slot. The transmission power constraint is as follows: Where P n Represents the transmission power of the sensor, P max represents the maximum transmission power of the sensor, Y in Indicates whether the sensor is active in the i-th time slot when transmitting data; It is also necessary to meet the condition that sensors are allowed to transmit information only in active time slots. The time slot state constraints are as follows:
5. The fog computing optimization method based on backbone network assisted non-orthogonal multiple access mechanism according to claim 4 is characterized in that: The signal-to-noise ratio (SINR) constraints of the sensor include: Where γ represents the decoding threshold of AP, de in represents the decoding order of the sensor signal in the i-th time slot, g inm is the channel power gain from the sensor to the AP; The data transmission conditions are as follows: where r in represents the data transmission rate of the sensor, d n Represents the data volume of the sensor task; the computing resources allocated to the task by the fog node do not exceed its own resource capacity and meet the following computing resource constraints: where μ mn represents the proportion of computing resources allocated to sensor n by fog node m; The completion delay of all tasks is determined by the completion delay of the largest task, so the completion time constraint is as follows:
6. The fog computing optimization method based on backbone network assisted non-orthogonal multiple access mechanism according to claim 5 is characterized in that: The objective function is: st:X i t i ≥X i+1 t i+1 Where λ is the weight of delay and energy consumption, E_n is the energy consumption of the sensor task, and this function is the problem of minimizing the weighted sum of delay and energy consumption.
7. The fog computing optimization method based on backbone network assisted non-orthogonal multiple access mechanism according to claim 6 is characterized in that: Under the constraints, the sensor node scheduling is determined according to the given power and resource allocation conditions, and then the given node scheduling is used to determine the power, computing and time resource allocation. These two sub-problems are iterated to obtain the optimal solution of the original problem, including: A load threshold γ1 is introduced. When d n / f n When ≥γ1, S n The task is defined as a communication-intensive task; otherwise, it is defined as a computation-intensive task; when all sensors are not assigned to time slots, the loop continues; in each iteration, the sensors are first divided into communication-intensive sensors and computation-intensive sensors, and the sensors of the communication-intensive node set that meet the SINR constraint are selected in turn, and the selected sensors are added to the active node set κ i and from candidate set C and communication intensive set D z ; when further addition is impossible, sensors that meet the SINR constraint are selected from the computationally intensive node set in turn; when all sensors in the candidate set C cannot meet the SINR constraint, the active node set S of the current i-th time slot is returned n |y in =1; the process starts to determine the active sensor for the next i+1 time slot; In the known {x i },{y in },{de in } and {t i ,μ mn ,T o }, according to the lemma, we can get {P n }, in the given {x i },{y in },{de in }, use Algorithm 1 to obtain the variable value {t i ,μ mn ,T o } and then proceed to the next iteration.
8. A fog computing optimization system based on backbone network-assisted non-orthogonal multiple access mechanism, characterized in that: include: The data acquisition module is used to collect the sensor node task data as a data set and transmit it on the access point and fog node; The constraint condition building module is used to build the front and back time slot constraints, transmission power and time slot state constraints, sensor signal-to-noise ratio (SINR) constraints, data transmission constraints, computing resource constraints and completion time constraints during the task data transmission process; The scheduling calculation module is used to calculate the sensor node scheduling under given power and resource allocation conditions based on the objective function and under constraints; The output module is used to determine the power, computing and time resource allocation given the node scheduling, and calculate the minimum delay and total energy cost required for task execution.
9. A computer device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the steps of the fog computing optimization method based on the backbone network assisted non-orthogonal multiple access mechanism as described in any one of claims 1 to 7 are implemented.
10. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the steps of the fog computing optimization method based on a backbone network-assisted non-orthogonal multiple access mechanism are implemented as described in any one of claims 1 to 7.
Citation Information
Cited By
Data transmission method and device of distributed system, equipment and storage medium
CN119967619A
Data transmission method, device and equipment of distributed system and storage medium
CN119967619B
