Power and bandwidth joint allocation method and system for multi-user downlink virtual reality service

Abstract

The application discloses a power and bandwidth joint allocation method and system for multi-user downlink virtual reality service, comprising the following steps: obtaining a system model of multi-user downlink virtual reality service; obtaining a virtual reality service data packet model; calculating a moment generating function of a service arrival process based on the virtual reality service data packet model; constructing an arrival rate expression based on the moment generating function, and constructing a service rate expression of each user under a time delay violation probability constraint; traversing a discrete power set, and constructing a candidate power-bandwidth pair set based on the system model, the arrival rate expression and the service rate expression; performing Pareto screening on the candidate power-bandwidth pair set, and initializing resource allocation results of each user; adjusting the resource allocation results of each user based on a discrete marginal utility update rule; proportionally compressing a bandwidth proportion, and outputting final resource allocation results. The application can meet the time delay requirement of users, reduce system power consumption and improve bandwidth resource utilization efficiency.

Description

Technical Field

[0001] This invention belongs to the field of wireless communication and virtual reality service transmission technology, specifically relating to a method and system for joint allocation of power and bandwidth for multi-user downlink virtual reality services. Background Technology

[0002] Virtual Reality (VR) is a crucial immersive service in next-generation wireless communication systems, widely used in scenarios such as remote interaction, industrial control, and immersive entertainment. Compared to traditional mobile data services, VR services not only require higher data transmission rates but also impose stricter requirements on transmission latency and latency stability. To ensure user immersion and interactive experience, VR typically requires data transmission within extremely short latency periods. This invention focuses on resource allocation techniques designed to meet the latency performance requirements of VR users.

[0003] In multi-user downlink transmission scenarios, resource allocation for VR services is highly complex. On the one hand, VR services involve large amounts of data, requiring sufficient bandwidth to ensure continuous transmission. On the other hand, link transmission capacity is closely related to transmit power; power variations affect link quality and spectral efficiency, resulting in a significant coupling between bandwidth allocation and power control. Furthermore, VR services exhibit significant statistical randomness: packet sizes are typically variable, and arrival intervals fluctuate due to service generation mechanisms and system jitter. If resource allocation based on average service rates is still used, it will lead to resource waste when the service load is light, while insufficient resources may fail to meet latency requirements when random fluctuations are large. This invention considers resource allocation based on user service load characteristics under conditions where both total system bandwidth and total transmit power are limited, balancing the latency requirements of multiple users with resource utilization efficiency.

[0004] Existing research on wireless resource allocation for low-latency services mainly focuses on quality of service analysis, bandwidth allocation, power control, or cross-layer design. This invention focuses on the following issues: how to rationally allocate resources under the dual constraints of total bandwidth and total transmit power in multi-user downlink VR scenarios; how to incorporate statistical characteristics such as packet size randomness and arrival interval jitter into the allocation process; how to transform users' latency thresholds and default probability requirements into executable service capability requirements and further map them to bandwidth and power allocation; and how to construct a resource allocation method that takes into account user latency requirements, power efficiency, and bandwidth efficiency under discrete transmit power values. Summary of the Invention

[0005] To address the aforementioned issues, this invention proposes a power and bandwidth joint allocation method and system for multi-user downlink virtual reality services, which reduces system power consumption and improves bandwidth resource utilization efficiency while meeting user latency requirements.

[0006] To achieve the above-mentioned technical objectives and effects, the present invention is implemented through the following technical solution:

[0007] In a first aspect, the present invention provides a method for joint allocation of power and bandwidth for multi-user downlink virtual reality services, comprising:

[0008] Obtain a pre-built system model of a multi-user downlink virtual reality service, the system model including resource variables and link variables;

[0009] Obtain a pre-built virtual reality service data packet model, which includes data packet size, arrival interval, and latency constraints;

[0010] Based on the virtual reality service data packet model, the moment generation function of the service arrival process is calculated;

[0011] Based on the moment generation function, an arrival rate expression for each user is constructed, and a service rate expression for each user is constructed under the time delay default probability constraint.

[0012] Traverse the discrete power set and construct a candidate power-bandwidth pair set based on the system model, arrival rate expression, and service rate expression;

[0013] Perform Pareto filtering on the candidate power-bandwidth pair set and initialize the resource allocation results for each user;

[0014] Adjust the resource allocation results for each user based on the discrete marginal utility update rule;

[0015] The bandwidth percentage in the adjusted resource allocation result is proportionally compressed, and the final resource allocation result is output.

[0016] In conjunction with the first aspect, optionally, a base station is denoted as... A user performs downlink data transmission for virtual reality services. The user index is... ;

[0017] The resource variables include those allocated by the base station to users. Transmission power The maximum total transmit power of a base station is Total bandwidth and users allocated bandwidth The total power constraint is: The total bandwidth constraint is ;

[0018] The link variables include: users The effective channel gain is ,user The effective noise plus interference power is ,user downlink signal-to-interference-plus-noise ratio ,user spectral efficiency and discrete transmit power set ,in, , , Including Candidate power levels.

[0019] In conjunction with the first aspect, optionally, the method for constructing the virtual reality service data packet model includes:

[0020] For users ,by This indicates the first step in the user's service flow. The sequence number of each data packet. , record the The size of each data packet is It follows a truncated Gaussian distribution: ,in, Indicates user Average data packet size , For business data rate, For frame generation rate; Indicates user The variance of the data packet size and Representing users respectively The lower and upper truncation boundaries of the data packet size distribution;

[0021] Let the average arrival interval of data packets be . , , No. The actual arrival interval of each data packet is , ,in, Indicates the jittering item. Indicates the jitter variance. and Let these represent the lower and upper truncation boundaries of the jitter, respectively, and satisfy the following conditions: ;

[0022] Record No. The arrival time of each data packet is , ,user The random variable for the delay of any data packet is ,user The data packet latency threshold is Then the user Delay constraint is In the formula, Represents probability symbols. Indicates user The target delay default probability.

[0023] In conjunction with the first aspect, optionally, the method for calculating the moment generation function of the service arrival process includes:

[0024] For users Record the time interval The cumulative number of bits arriving within the range is ,in, Represents a time variable; records the cutoff time. The number of arriving data packets is ,but The corresponding data packet counting process satisfies , Denotes the least upper bound of a set;

[0025] Based on average packet arrival interval and jitter variance Modeling the average arrival interval and actual arrival interval of data packets yields a counting process for approximate updating. Furthermore, based on the central limit theorem of the updating process, for large-scale time intervals, the number of arriving data packets is... It is approximately a Gaussian random variable with a mean of 1 / 2. The variance is Under the above approximation, for any statistical index Calculate the number of arriving data packets Moment generating function , ;

[0026] Calculate packet size Moment generating function , ,in , , , The cumulative distribution function representing the standard normal distribution;

[0027] Calculate the cumulative number of bits Moment generating function , , bring in Calculated , which serves as the moment generation function for the business arrival process.

[0028] In conjunction with the first aspect, optionally, the step of constructing the arrival rate expression for each user based on the moment generation function, and constructing the service rate expression for each user under the time delay default probability constraint, includes:

[0029] For users Let be represented by the affine moment generating function form in stochastic network calculus. for ,in, Indicates arrival rate, Indicates the degree of suddenness; The index should contain no additional time-independent sudden events, i.e. Therefore, ;

[0030] The probability of time-delay default is represented by an exponential approximation, i.e. ,in, Indicates a constant service rate. Represents a statistical index, for a given... and Let the corresponding service rate expression be: ,satisfy .

[0031] In conjunction with the first aspect, optionally, the step of traversing the discrete power set and constructing a candidate power-bandwidth pair set based on the system model, the arrival rate expression, and the service rate expression includes:

[0032] For users Traverse the discrete transmit power set Each candidate power level For selecting candidate power levels users The power is denoted as Calculate the corresponding signal-to-interference-plus-noise ratio. , Furthermore, the corresponding spectral efficiency is obtained. , ;

[0033] Based on arrival rate Service speed and delay default probability constraints For each candidate power level, the minimum feasible service rate that makes the delay default probability constraint hold is on the boundary, i.e. Solving this equation yields the optimal statistical index. ;

[0034] For each candidate power level Calculate the corresponding minimum service rate , Minimum bandwidth usage , and the corresponding minimum bandwidth percentage , Candidate power levels The corresponding candidate points are denoted as ;

[0035] All satisfied Add candidate points to the candidate set Candidate set Indicates user The set of candidate power-bandwidth pairs, Indicates user The There are 10 candidate points.

[0036] In conjunction with the first aspect, optionally, the Pareto screening of the candidate power-bandwidth pair set and the initialization of resource allocation results for each user include:

[0037] For users candidate set If for candidate points There is another candidate point ,satisfy Then the candidate point is considered As the dominated point;

[0038] Candidate set After removing all dominated points, we obtain the Pareto optimal set, denoted as . ;

[0039] Will All points are sorted in ascending order of power level. For each user... Let its power and bandwidth allocation result be denoted as point. Let the point be in the set. The serial number in is ;

[0040] For users Select the candidate point with the lowest power level as the initial point. The value is assigned to the initial point index, i.e. ;

[0041] After initialization for all users, the current resource allocation set is obtained. .

[0042] In conjunction with the first aspect, optionally, the adjustment of resource allocation results for each user based on the discrete marginal utility update rule includes:

[0043] Repeat the preset steps until the current total bandwidth percentage is no greater than 1, or there are no more users who can continue to update. The preset steps include:

[0044] Calculate the current total bandwidth percentage Determine if the current total bandwidth percentage is less than 1. If it is less than 1, then... The final power and bandwidth allocation results for the user are determined; otherwise, the following steps are performed.

[0045] If the current total bandwidth percentage is greater than 1, then for each condition that satisfies... For users, calculate their distance from the current point. Switch to the next point Marginal utility of time : ,in, Indicates user The change in joint cost caused by reducing the proportion of bandwidth per unit area. They represent the candidate level selection. The power and bandwidth allocation results at that time They represent the candidate level selection. The power and bandwidth allocation results at that time Represents a set The number of candidate points is determined by selecting the user with the lowest marginal utility from all updatable users, denoted as . ;

[0046] If user After updating to the next candidate point, the total transmit power limit is met, i.e. Then execute the update. and update synchronously. If the user If the total transmit power limit is exceeded after updating to the next candidate point, then the current user... No updates.

[0047] In conjunction with the first aspect, optionally, the proportional compression of bandwidth ratio to output the final resource allocation result includes:

[0048] After adjusting the resource allocation results for each user based on the discrete marginal utility update rule, if the following still exist... Then the set of current bandwidth percentages for all users Perform proportional compression so that the sum of the compressed bandwidth proportions meets the following requirements. After proportional compression is completed, the final power and allocation results for all users are as follows: .

[0049] In a second aspect, the present invention provides a power and bandwidth joint allocation system for multi-user downlink virtual reality services, including a storage medium and a processor;

[0050] The storage medium is used to store instructions;

[0051] The processor is configured to operate according to the instructions to perform the method according to any one of the first aspects.

[0052] Compared with the prior art, the beneficial effects of the present invention are as follows:

[0053] 1. Regarding improving resource utilization efficiency, the power and bandwidth joint allocation method for multi-user downlink virtual reality services proposed in this invention can fully utilize channel bandwidth and base station transmit power resources under discrete power levels, total bandwidth constraints, and total power constraints, thereby improving the overall resource utilization efficiency of the system.

[0054] 2. In terms of constraint mapping, this invention transforms the user's latency default probability constraint into a minimum service rate requirement, and then further maps the minimum service rate into a bandwidth requirement, thereby establishing a direct link between service latency requirements and wireless resource allocation.

[0055] 3. In terms of business modeling, this invention takes into account both the randomness of data packet size and the jitter of arrival interval in virtual reality services, and uses the effective arrival rate parameter to uniformly characterize the random characteristics of the services, making the resource allocation process closer to the actual business scenario. Attached Figure Description

[0056] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the embodiments will be briefly described below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort, wherein:

[0057] Figure 1 This is a flowchart of a resource allocation method provided in one embodiment of the present invention;

[0058] Figure 2 This is a system architecture diagram provided in one embodiment of the present invention;

[0059] Figure 3 This is a schematic diagram of a virtual reality service arrival model provided in one embodiment of the present invention;

[0060] Figure 4 This is a user data packet delay default probability curve provided in one embodiment of the present invention;

[0061] Figure 5 This is a schematic diagram of resource consumption obtained by changing the number of users and the total power budget according to an embodiment of the present invention;

[0062] Figure 6 This is a schematic diagram of resource consumption obtained by changing the jitter and delay thresholds according to an embodiment of the present invention;

[0063] Figure 7 This is a schematic diagram comparing user satisfaction and power consumption under different bandwidth budgets for the method and the control method in this invention. Detailed Implementation

[0064] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of the present invention, and not all of them. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of the present invention.

[0065] Furthermore, if the embodiments of this invention involve descriptions such as "first" or "second," these descriptions are for descriptive purposes only and should not be construed as indicating or implying their relative importance or implicitly specifying the number of technical features indicated. Therefore, a feature defined with "first" or "second" may explicitly or implicitly include at least one of those features. Additionally, the technical solutions of the various embodiments can be combined with each other, but this must be based on the ability of those skilled in the art to implement them. If the combination of technical solutions is contradictory or impossible to implement, it should be considered that such a combination of technical solutions does not exist and is not within the scope of protection claimed by this invention.

[0066] Example 1

[0067] This invention provides a method for joint power and bandwidth allocation for multi-user downlink virtual reality services, comprising the following steps:

[0068] (1) Obtain a pre-built system model of a multi-user downlink virtual reality service, wherein the system model includes resource variables and link variables;

[0069] (2) Obtain a pre-built virtual reality service data packet model, wherein the virtual reality service data packet model includes data packet size, arrival interval and delay constraints;

[0070] (3) Based on the virtual reality service data packet model, calculate the moment generation function of the service arrival process;

[0071] (4) Construct the arrival rate expression for each user based on the moment generation function, and construct the service rate expression for each user under the time delay default probability constraint;

[0072] (5) Traverse the discrete power set and construct a candidate power-bandwidth pair set based on the system model, arrival rate expression, and service rate expression;

[0073] (6) Perform Pareto filtering on the candidate power-bandwidth pair set and initialize the resource allocation results for each user;

[0074] (7) Adjust the resource allocation results for each user based on the discrete marginal utility update rule;

[0075] (8) Compress the bandwidth ratio proportionally and output the final resource allocation result.

[0076] In one specific embodiment of the present invention, a base station is denoted as... A user performs downlink data transmission for virtual reality services. The user index is... ;

[0077] The resource variables include those allocated by the base station to users. Transmission power The maximum total transmit power of a base station is Total bandwidth and users allocated bandwidth The total power constraint is: The total bandwidth constraint is ;

[0078] The link variables include: users The effective channel gain is ,user The effective noise plus interference power is ,user downlink signal-to-interference-plus-noise ratio ,user spectral efficiency and discrete transmit power set ,in, , , Including Candidate power levels.

[0079] In one specific embodiment of the present invention, the method for constructing the virtual reality service data packet model includes:

[0080] For users ,by This indicates the first step in the user's service flow. The sequence number of each data packet. , record the The size of each data packet is It follows a truncated Gaussian distribution: ,in, Indicates user Average data packet size , For business data rate, For frame generation rate; Indicates user The variance of the data packet size and Representing users respectively The lower and upper truncation boundaries of the data packet size distribution;

[0081] Let the average arrival interval of data packets be . , , No. The actual arrival interval of each data packet is , ,in, Indicates the jittering item. Indicates the jitter variance. and Let these represent the lower and upper truncation boundaries of the jitter, respectively, and satisfy the following conditions: ;

[0082] Record No. The arrival time of each data packet is , ,user The random variable for the delay of any data packet is ,user The data packet latency threshold is , then the user Delay constraint is In the formula, Represents probability symbols. Indicates user The target delay default probability.

[0083] In one specific embodiment of the present invention, the method for calculating the moment generation function of the service arrival process includes:

[0084] For users Record the time interval The cumulative number of bits arriving within the range is ,in, Represents a time variable; records the cutoff time. The number of arriving data packets is ,but The corresponding data packet counting process satisfies , Denotes the least upper bound of a set;

[0085] Based on average packet arrival interval and jitter variance Modeling the average arrival interval and actual arrival interval of data packets yields a counting process for approximate updating. Furthermore, based on the central limit theorem of the updating process, for large-scale time intervals (such as...),... ), will arrive at the number of data packets It is approximately a Gaussian random variable with a mean of 1 / 2. The variance is Under the above approximation, for any statistical index Calculate the number of arriving data packets Moment generating function , ;

[0086] Calculate packet size Moment generating function , ,in , , , The cumulative distribution function representing the standard normal distribution;

[0087] Calculate the cumulative number of bits Moment generating function , , bring in Calculated , which serves as the moment generation function for the business arrival process.

[0088] In one specific embodiment of the present invention, the step of constructing the arrival rate expression for each user based on the moment generation function, and constructing the service rate expression for each user under the time delay default probability constraint, includes:

[0089] For users Let be represented by the affine moment generating function form in stochastic network calculus. for ,in, Indicates arrival rate, Indicates the degree of suddenness; The index should contain no additional time-independent sudden events, i.e. Therefore, ;

[0090] The probability of time-delay default is represented by an exponential approximation, i.e. ,in, Indicates a constant service rate. Represents a statistical index, for a given... and Let the corresponding service rate expression be: ,satisfy .

[0091] In one specific embodiment of the present invention, the step of traversing the discrete power set and constructing a candidate power-bandwidth pair set based on the system model, arrival rate expression, and service rate expression includes:

[0092] For users Traverse the discrete transmit power set Each candidate power level For selecting candidate power levels users The power is denoted as Calculate the corresponding signal-to-interference-plus-noise ratio. Furthermore, the corresponding spectral efficiency is obtained. ;

[0093] Based on arrival rate Service speed and constraints For each candidate power level, the minimum feasible service rate that makes the delay default probability constraint hold is on the boundary, i.e. Solving this equation yields the optimal statistical index. ;

[0094] For each candidate power level Calculate the corresponding minimum service rate Minimum bandwidth usage and corresponding minimum bandwidth percentage Candidate power levels The corresponding candidate points are denoted as ;

[0095] All satisfied Add candidate points to the candidate set Candidate set Indicates user The set of candidate power-bandwidth pairs, Indicates user The There are 10 candidate points.

[0096] In one specific embodiment of the present invention, the step of performing Pareto filtering on the candidate power-bandwidth pair set and initializing the resource allocation results for each user includes:

[0097] For users candidate set If for candidate points There is another candidate point ,satisfy Then the candidate point is considered As the dominated point;

[0098] Candidate set After removing all dominated points, we obtain the Pareto optimal set, denoted as . ;

[0099] Will All points are sorted in ascending order of power level. For each user... Let its power and bandwidth allocation result be denoted as point. Let the point be in the set. The serial number in is ;

[0100] For users Select the candidate point with the lowest power level as the initial point. The value is assigned to the initial point index, i.e. ;

[0101] After initialization for all users, the current resource allocation set is obtained. .

[0102] In one specific embodiment of the present invention, adjusting the resource allocation results for each user based on the discrete marginal utility update rule includes:

[0103] Repeat the preset steps until the current total bandwidth percentage is no greater than 1, or there are no more users who can continue to update. The preset steps include:

[0104] Calculate the current total bandwidth percentage Determine if the current total bandwidth percentage is less than 1. If it is less than 1, then... The final power and bandwidth allocation results for the user are determined; otherwise, the following steps are performed.

[0105] If the current total bandwidth percentage is greater than 1, then for each condition that satisfies... For users, calculate their distance from the current point. Switch to the next point Marginal utility of time : ,in, Indicates user The change in joint cost caused by reducing the proportion of bandwidth per unit area. They represent the candidate level selection. The power and bandwidth allocation results at that time They represent the candidate level selection. The power and bandwidth allocation results at that time Represents a set The number of candidate points is determined by selecting the user with the lowest marginal utility from all updatable users, denoted as . ;

[0106] If user After updating to the next candidate point, the total transmit power limit is met, i.e. Then execute the update. and update synchronously. If the user If the total transmit power limit is exceeded after updating to the next candidate point, then the current user... No updates.

[0107] In one specific embodiment of the present invention, the step of proportionally compressing the bandwidth ratio and outputting the final resource allocation result includes:

[0108] After adjusting the resource allocation results for each user based on the discrete marginal utility update rule, if the following still exist... Then the set of current bandwidth percentages for all users Perform proportional compression so that the sum of the compressed bandwidth proportions meets the following requirements. After proportional compression is completed, the final power and allocation results for all users are as follows: .

[0109] The following describes in detail the power and bandwidth joint allocation method for multi-user downlink virtual reality services in an embodiment of the present invention, with reference to a specific implementation method.

[0110] Consider as Figure 2 The specific process in the scenario shown in this embodiment of the invention can be found by referring to... Figure 1 This includes the following steps:

[0111] Step 1: Establish as follows Figure 2 The system model shown is for a multi-user downlink virtual reality service. The system model includes resource variables and link variables.

[0112] In this step, a base station is denoted as... A user performs downlink virtual reality service transmission, and the user is tagged as... For the first For each user, the effective channel gain is denoted as . The effective noise plus interference power is The base station is assigned to this user (the first one) The transmit power of (each user) is Then its downlink signal-to-interference-plus-noise ratio is denoted as The corresponding spectral efficiency is denoted as .

[0113] In this step, the discrete transmit power set is denoted as... , It includes M candidate power levels; the maximum total transmit power of the base station is [value missing]. Then the total power constraint is .

[0114] In this step, record the total bandwidth. , No. The bandwidth allocated to each user is Then the total bandwidth constraint .

[0115] Step 2: Establish a virtual reality service data package model.

[0116] In this step, for the first individual users, This indicates the first step in the user's service flow. Each data packet sequence number , record the The size of each data packet is It follows a truncated Gaussian distribution: ,in, Indicates the first Average data packet size per user Indicates the first Variance of data packet size per user and These represent the lower and upper truncation boundaries of the data packet size distribution, respectively. Let the service data rate be... The frame generation rate is denoted as ,but .

[0117] In this step, the average arrival interval of the data packets is denoted as . , No. The actual arrival interval of each data packet is ,but ,in Indicates the jittering item. Indicates the jitter variance. and Let these represent the lower and upper truncation boundaries of the jitter, respectively, and satisfy the following conditions: .

[0118] In this step, record the first... The arrival time of each data packet is , Figure 3A schematic diagram of the virtual reality service arrival model provided in an embodiment of the present invention is shown. Random variable of the delay of any data packet for a user The data packet delay threshold is The threshold for the probability of default due to time delay (i.e., the target probability of default due to time delay) is: Then the user's latency constraint is written as .

[0119] Step 3: Based on the virtual reality service data packet model, calculate the moment generation function for the service arrival process, such as... Figure 1 As shown in the image.

[0120] In this step, for the first Individual users, time intervals recorded. The cumulative number of bits arriving within the range is ,in, Represents a time variable; records the cutoff time. The number of arriving data packets is ,but The corresponding data packet counting process satisfies .

[0121] In this step, based on the average arrival interval of data packets and jitter variance By modeling the average arrival interval and the actual arrival interval of data packets, a counting process for approximating the update process is obtained. Furthermore, based on the central limit theorem of the update process, for large-scale time intervals (such as...),... ), will arrive at the number of data packets It is approximately a Gaussian random variable with a mean of The variance is Under the above approximation, for any statistical index ,remember The moment generating function is ,calculate .

[0122] In this step, the data packet size is calculated. Moment generating function ,in , , , The cumulative distribution function represents the standard normal distribution.

[0123] In this step, the number of bits is accumulated. Moment generating function for , bring in Calculated .

[0124] Step 4: Construct arrival rate expressions for each user based on the moment generation function, and construct service rate expressions for each user under the time delay default probability constraint, such as... Figure 1 As shown in the image.

[0125] In this step, for the first Let there be a user, represented by an affine moment generating function in stochastic network calculus. for ,in Indicates the arrival rate parameter. This represents the burstiness parameter. Based on the arrival approximation used in step 3, the exponent should not contain any additional time-independent burst terms, i.e. ,therefore .

[0126] In this step, an exponential approximation is used to characterize the probability of time-delay default, i.e. ,in Indicates a constant service rate. This represents a statistical index. For a given... and Let the corresponding service rate be . ,satisfy .

[0127] Step 5: Traverse the discrete power set and construct a candidate power-bandwidth pair set based on the system model, such as... Figure 1 As shown in the image.

[0128] In this step, for each user Traverse the discrete transmit power set Each candidate power level For the selection of number 1 Users at each level The power is denoted as Calculate the corresponding signal-to-interference-plus-noise ratio. Furthermore, the spectral efficiency is obtained. .

[0129] In this step, the effective arrival rate parameter obtained in step 4 is used as a basis. Service speed and constraints For each candidate power level, the minimum feasible service rate that makes the delay default probability constraint hold is on the boundary, i.e. Solving this equation yields the optimal statistical index. .

[0130] In this step, for each candidate power level Calculate the corresponding minimum service rate Minimum bandwidth usage and corresponding minimum bandwidth percentage Candidate power levels The corresponding candidate points are denoted as .

[0131] In this step, all those that meet the requirements are... Add candidate points to the set .gather Indicates user The set of candidate power-bandwidth pairs, Indicates user The There are 10 candidate points.

[0132] Step 6: Perform Pareto filtering on the candidate power-bandwidth pair set and initialize the resource allocation results for each user, such as... Figure 1 As shown in the image.

[0133] In this step, for each user candidate set If for candidate points There is another candidate point ,satisfy Then the candidate point is considered The dominated point. The set After removing all dominated points from the set, we obtain the Pareto optimal set, denoted as . .

[0134] In this step, All points are sorted in ascending order of power level. For each user Record its final power-bandwidth ratio In the set The serial number in is .

[0135] In this step, for each user Select the candidate point with the lowest power level as the initial point. The value is assigned to the initial point index, i.e. After initializing for all users, the current resource allocation set is obtained. .

[0136] Step 7: Adjust the resource allocation results for each user based on the discrete marginal utility update rule (i.e., adjust the allocation points for each user based on the discrete marginal utility update rule), such as... Figure 1 As shown in the image.

[0137] In this step, the current percentage of total bandwidth is calculated. Determine if the current total bandwidth percentage is less than 1. If it is less than 1, then... The final power and bandwidth allocation results for the user are determined; otherwise, the following steps are performed.

[0138] In this step, if the current total bandwidth percentage is greater than 1, then for each condition that satisfies... For users, calculate their distance from the current point. Switch to the next point Marginal utility of time: ,in Indicates user The change in joint cost caused by reducing the proportion of bandwidth per unit area. Represents a set Number of candidate points. The user with the lowest marginal utility is selected from all updatable users, denoted as _____. .

[0139] In this step, if the user After updating to the next candidate point, the total transmit power limit is met, i.e. Then execute the update. and update synchronously. If the user If the total transmit power limit is exceeded after updating to the next candidate point, then the current user... No update will be performed.

[0140] In this step, repeat the above part of the step until the current total bandwidth percentage is no greater than 1, or there are no users who can continue to update.

[0141] Step 8: Compress the bandwidth percentage proportionally and output the final resource allocation result (i.e., compress the bandwidth percentage proportionally and output the final allocation result).

[0142] In this step, if after step 7 there are still [problems / issues]... Then the set of current bandwidth percentages for all users Perform proportional compression so that the sum of the compressed bandwidth proportions meets the following requirements. After proportional compression is completed, the final power and allocation results for all users are as follows: .

[0143] like Figure 4 As shown, after completing steps 1 to 8 as described above, resources are allocated to all users, and the probability of packet failure under different delays for all users is calculated. Figure 4The probability of packet delay default for all users is lower than a given threshold before reaching the delay threshold, thus verifying the feasibility of the established business model and the proposed allocation method. Through the above method, this invention can effectively perform joint power and bandwidth allocation for multi-user downlink virtual reality systems under latency requirements.

[0144] Figures 5 to 7 An example is provided to illustrate the application of the proposed resource allocation method to a general multi-user scenario. First, a system model and a business model are established according to steps 1 and 2. Then, the moment generation function representation, arrival rate parameter, and minimum service rate of the service arrival process are calculated according to steps 3 and 4. Next, a candidate power-bandwidth pair set is constructed according to step 5. Pareto filtering is performed and the resource allocation results are initialized according to step 6. Discrete marginal utility updates are then performed according to step 7, and proportional compression is performed as necessary according to step 8 to obtain the final allocation result.

[0145] Figure 5 The changes in the system's total bandwidth ratio and total power consumption as the number of users varies under different total transmit power limits are presented. In this process, resource allocation results with guaranteed delay constraints are obtained according to steps 1 to 7. These results demonstrate that the allocation results obtained according to steps 5 to 7 can reflect the coupling relationship between bandwidth and power. Figure 6 The impact of arrival jitter and latency thresholds on allocation results is examined, and the changes in the system's total bandwidth ratio and total power consumption as the standard deviation of arrival jitter varies under different packet latency thresholds are presented. In this process, the arrival jitter parameters are first determined according to step 2, and then the resource allocation results with latency constraints are obtained according to steps 3 to 7. The results demonstrate that steps 3 and 4 of this invention, which characterize and map service randomness, can effectively reflect the impact of service statistical characteristics on resource requirements.

[0146] at last, Figure 7 The proposed method (corresponding) is given. Figure 7The proposed method (as described in the previous section) compares its performance with various baseline methods under different system bandwidth conditions, specifically comparing the proportion of users satisfying the delay default probability constraint and total power consumption. In this process, the proposed method still allocates power and bandwidth to each user according to steps 1 to 8. The baseline methods include: B1, a continuous relaxation method that relaxes the discrete transmit power set into a continuous power domain for allocation; B2, a random allocation method that randomly selects power levels from a higher power range for allocation; B3, a consistent scaling method that assigns the same power values ​​to users, ensuring consistent scaling; and B4, a proportional allocation method that allocates power based on the user's signal-to-interference-plus-noise ratio (SNR) weight. The comparison results show that the candidate point construction, Pareto screening, discrete marginal utility update, and proportional compression processing performed in steps 5 to 8 achieve a better balance between meeting user needs and power consumption in terms of delay default probability.

[0147] This example demonstrates that the proposed method can effectively meet the joint bandwidth and power requirements of multiple users under latency constraints.

[0148] Example 2

[0149] This invention provides a power and bandwidth joint allocation system for multi-user downlink virtual reality services, including a storage medium and a processor;

[0150] The storage medium is used to store instructions;

[0151] The processor is configured to operate according to the instructions to execute the method according to any one of Embodiment 1.

[0152] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0153] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this application. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart... Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0154] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0155] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0156] The embodiments of the present invention have been described above with reference to the accompanying drawings. However, the present invention is not limited to the specific embodiments described above. The specific embodiments described above are merely illustrative and not restrictive. Those skilled in the art can make many other forms under the guidance of the present invention without departing from the spirit and scope of the claims. All of these forms are within the protection scope of the present invention.

[0157] The foregoing has shown and described the basic principles, main features, and advantages of the present invention. Those skilled in the art should understand that the present invention is not limited to the above embodiments. The embodiments and descriptions in the specification are merely illustrative of the principles of the invention. Various changes and modifications can be made to the invention without departing from its spirit and scope, and all such changes and modifications fall within the scope of the present invention as claimed. The scope of protection of this invention is defined by the appended claims and their equivalents.

Claims

1. A method for joint power and bandwidth allocation for multi-user downlink virtual reality services, characterized in that, include: Obtain a pre-built system model of a multi-user downlink virtual reality service, the system model including resource variables and link variables; Obtain a pre-built virtual reality service data packet model, which includes data packet size, arrival interval, and latency constraints; Based on the virtual reality service data packet model, the moment generation function of the service arrival process is calculated; Based on the moment generation function, an arrival rate expression for each user is constructed, and a service rate expression for each user is constructed under the time delay default probability constraint. Traverse the discrete power set and construct a candidate power-bandwidth pair set based on the system model, arrival rate expression, and service rate expression; Perform Pareto filtering on the candidate power-bandwidth pair set and initialize the resource allocation results for each user; Adjust the resource allocation results for each user based on the discrete marginal utility update rule; The bandwidth percentage in the adjusted resource allocation result is proportionally compressed, and the final resource allocation result is output.

2. The power and bandwidth joint allocation method for multi-user downlink virtual reality services according to claim 1, characterized in that, Let a base station be... A user performs downlink data transmission for virtual reality services. The user index is... ; The resource variables include those allocated by the base station to users. Transmission power The maximum total transmit power of a base station is Total bandwidth and users allocated bandwidth The total power constraint is: The total bandwidth constraint is ; The link variables include: users The effective channel gain is ,user The effective noise plus interference power is ,user downlink signal-to-interference-plus-noise ratio ,user spectral efficiency and discrete transmit power set ,in, , , Including Candidate power levels.

3. The power and bandwidth joint allocation method for multi-user downlink virtual reality services according to claim 1, characterized in that: The method for constructing the virtual reality service data packet model includes: For users ,by This indicates the first step in the user's service flow. The sequence number of each data packet. , record the The size of each data packet is It follows a truncated Gaussian distribution: ,in, Indicates user Average data packet size , For business data rate, For frame generation rate; Indicates user The variance of the data packet size and Representing users respectively The lower and upper truncation boundaries of the data packet size distribution; Let the average arrival interval of data packets be . , , No. The actual arrival interval of each data packet is , ,in, Indicates the jittering item. Indicates the jitter variance. and Let these represent the lower and upper truncation boundaries of the jitter, respectively, and satisfy the following conditions: ; Record No. The arrival time of each data packet is , ,user The random variable for the delay of any data packet is ,user The data packet latency threshold is Then the user Delay constraint is In the formula, Represents probability symbols. Indicates user The target delay default probability.

4. The power and bandwidth joint allocation method for multi-user downlink virtual reality services according to claim 3, characterized in that: The method for calculating the moment generation function of the service arrival process includes: For users Record the time interval The cumulative number of bits arriving within the range is ,in, Represents a time variable; records the cutoff time. The number of arriving data packets is ,but The corresponding data packet counting process satisfies , Denotes the least upper bound of a set; Based on average packet arrival interval and jitter variance Modeling the average arrival interval and actual arrival interval of data packets yields a counting process for approximate updating. Furthermore, based on the central limit theorem of the updating process, for large-scale time intervals, the number of arriving data packets is... It is approximately a Gaussian random variable with a mean of 1 / 2. The variance is Under the above approximation, for any statistical index Calculate the number of arriving data packets Moment generating function , ; Calculate packet size Moment generating function , ,in , , , The cumulative distribution function representing the standard normal distribution; Calculate the cumulative number of bits Moment generating function , , bring in Calculated , which serves as the moment generation function for the business arrival process.

5. The power and bandwidth joint allocation method for multi-user downlink virtual reality services according to claim 4, characterized in that: The process of constructing arrival rate expressions for each user based on the moment generation function, and constructing service rate expressions for each user under the time delay default probability constraint, includes: For users Let be represented by the affine moment generating function form in stochastic network calculus. for ,in, Indicates arrival rate, Indicates the degree of suddenness; The index should contain no additional time-independent sudden events, i.e. Therefore, ; The probability of time-delay default is represented by an exponential approximation, i.e. ,in, Indicates a constant service rate. Represents a statistical index, for a given... and Let the corresponding service rate expression be: ,satisfy .

6. The power and bandwidth joint allocation method for multi-user downlink virtual reality services according to claim 2, characterized in that: The process of traversing the discrete power set and constructing a candidate power-bandwidth pair set based on the system model, arrival rate expression, and service rate expression includes: For users Traverse the discrete transmit power set Each candidate power level For selecting candidate power levels users The power is denoted as Calculate the corresponding signal-to-interference-plus-noise ratio. , Furthermore, the corresponding spectral efficiency is obtained. , ; Based on arrival rate Service speed and delay default probability constraints For each candidate power level, the minimum feasible service rate that makes the delay default probability constraint hold is on the boundary, i.e. Solving this equation yields the optimal statistical index. ; For each candidate power level Calculate the corresponding minimum service rate , Minimum bandwidth usage , and the corresponding minimum bandwidth percentage , Candidate power levels The corresponding candidate points are denoted as ; All satisfied Add candidate points to the candidate set Candidate set Indicates user The set of candidate power-bandwidth pairs, Indicates user The There are 10 candidate points.

7. The power and bandwidth joint allocation method for multi-user downlink virtual reality services according to claim 6, characterized in that: The Pareto screening of the candidate power-bandwidth pair set and the initialization of resource allocation results for each user include: For users candidate set If for candidate points There is another candidate point ,satisfy Then the candidate point is considered As the dominated point; Candidate set After removing all dominated points, we obtain the Pareto optimal set, denoted as . ; Will All points are sorted in ascending order of power level. For each user... Let its power and bandwidth allocation result be denoted as point. Let the point be in the set. The serial number in is ; For users Select the candidate point with the lowest power level as the initial point. The value is assigned to the initial point index, i.e. ; After initialization for all users, the current resource allocation set is obtained. .

8. The power and bandwidth joint allocation method for multi-user downlink virtual reality services according to claim 7, characterized in that: The adjustment of resource allocation results for each user based on the discrete marginal utility update rule includes: Repeat the preset steps until the current total bandwidth percentage is no greater than 1, or there are no more users who can continue to update. The preset steps include: Calculate the current total bandwidth percentage Determine if the current total bandwidth percentage is less than 1. If it is less than 1, then... The final power and bandwidth allocation results for the user are determined; otherwise, the following steps are performed. If the current total bandwidth percentage is greater than 1, then for each condition that satisfies... For users, calculate their distance from the current point. Switch to the next point Marginal utility of time : ,in, Indicates user The change in joint cost caused by reducing the proportion of bandwidth per unit area. They represent the candidate level selection. The power and bandwidth allocation results at that time They represent the candidate level selection. The power and bandwidth allocation results at that time Represents a set The number of candidate points is determined by selecting the user with the lowest marginal utility from all updatable users, denoted as . ; If user After updating to the next candidate point, the total transmit power limit is met, i.e. Then execute the update. and update synchronously. If the user If the total transmit power limit is exceeded after updating to the next candidate point, then the current user... No updates.

9. A power and bandwidth joint allocation method for multi-user downlink virtual reality services according to claim 8, characterized in that: The process of proportionally compressing the bandwidth and outputting the final resource allocation result includes: After adjusting the resource allocation results for each user based on the discrete marginal utility update rule, if the following still exist... Then the set of current bandwidth percentages for all users Perform proportional compression so that the sum of the compressed bandwidth proportions meets the following requirements. After proportional compression is completed, the final power and allocation results for all users are as follows: .

10. A power and bandwidth joint allocation system for multi-user downlink virtual reality services, characterized in that, Including storage media and processor; The storage medium is used to store instructions; The processor is configured to operate according to the instructions to perform the method according to any one of claims 1-9.

Images