CN115209554A - Internet of vehicles semi-positive definite resource allocation method based on network slice and NOMA - Google Patents
Internet of vehicles semi-positive definite resource allocation method based on network slice and NOMA Download PDFInfo
- Publication number
- CN115209554A CN115209554A CN202210729292.7A CN202210729292A CN115209554A CN 115209554 A CN115209554 A CN 115209554A CN 202210729292 A CN202210729292 A CN 202210729292A CN 115209554 A CN115209554 A CN 115209554A
- Authority
- CN
- China
- Prior art keywords
- noma
- slice group
- users
- user
- frequency resource
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 24
- 238000013468 resource allocation Methods 0.000 title claims abstract description 21
- 206010042135 Stomatitis necrotising Diseases 0.000 title claims abstract 27
- 201000008585 noma Diseases 0.000 title claims abstract 27
- 230000005540 biological transmission Effects 0.000 claims abstract description 102
- 238000001228 spectrum Methods 0.000 claims abstract description 39
- 238000004891 communication Methods 0.000 claims abstract description 17
- 230000003068 static effect Effects 0.000 claims abstract description 17
- 238000005457 optimization Methods 0.000 claims description 25
- 230000006855 networking Effects 0.000 claims description 7
- 101100313471 Streptomyces sp getA gene Proteins 0.000 claims description 5
- 239000011159 matrix material Substances 0.000 claims description 5
- 238000007726 management method Methods 0.000 claims description 3
- 230000003190 augmentative effect Effects 0.000 claims description 2
- 238000010276 construction Methods 0.000 claims description 2
- 230000001105 regulatory effect Effects 0.000 claims description 2
- 230000006870 function Effects 0.000 description 5
- 230000008901 benefit Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 3
- 238000011160 research Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 238000013528 artificial neural network Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000002372 labelling Methods 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 230000035945 sensitivity Effects 0.000 description 1
- 238000012549 training Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
- H04W4/44—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P] for communication between vehicles and infrastructures, e.g. vehicle-to-cloud [V2C] or vehicle-to-home [V2H]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
- H04W4/46—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P] for vehicle-to-vehicle communication [V2V]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a semi-definite resource allocation method of an internet of vehicles based on network slices and NOMA. Firstly, the base station initializes the time-frequency resource block RB allocation of each V2I slice group by using a static spectrum resource pool according to the QoS index transmission rate of each V2I slice group, and simultaneously adjusts the RB allocation of each V2I slice group in the current SPS period by using a dynamic spectrum resource pool according to the data transmission rate of each V2I slice group in the last SPS period, thereby maximizing the transmission energy efficiency of V2I users while considering the fairness of each V2I slice group. In addition, assuming that the spectrum sharing mode of the V2I slice group and the vehicle-to-vehicle communication V2V NOMA cluster is known, under the condition of considering the interference of the V2I slice group, the optimal power control of the V2V Tx users in each V2V NOMA cluster is obtained by adopting a distributed iterative algorithm. The network slice and the NOMA are applied to a broadcast communication downlink scene of the Internet of vehicles, and the transmission energy efficiency of the V2I user and the V2VTx user is improved on the basis of ensuring the QoS of the V2I user.
Description
Technical Field
The invention belongs to the technical field of wireless communication, and particularly relates to a vehicle networking semi-definite resource allocation method based on network slices and NOMA (non-orthogonal multiple access).
Background
The different requirements of V2X (vehicle-to-all) communication in the internet of vehicles for the data transmission rate, transmission delay and reliability of the network may lead to suboptimal utilization of the 5G network. The difference of vehicle user service types in the internet of vehicles puts different demands on network resources, such as: services such as media streaming, information exchange, etc. require a large amount of data exchange, while navigation-like services have delay sensitivity. Meanwhile, with the rapid development of the internet of vehicles, more and more vehicle users have network access requirements, and the scale of the network space interface is challenged. Application of Network slice and resource allocation of NOMA based on SDN (software defined Network) and NFV (Network Functions Virtualization) in the internet of vehicles has a necessity of research.
The high speed mobility of the vehicle users makes centralized resource allocation by acquiring CSI (channel state information) of the users no longer applicable, and multiple service types place differentiated demands on network resources. In addition, the problems of air interface resource shortage, low frequency spectrum benefit and the like still exist in the internet of vehicles. Therefore, a semi-definite resource allocation method for the internet of vehicles based on network slicing and NOMA is needed to be developed. Most of the research resource allocation based on network slices in the existing literature estimates the channel of the vehicle user on the premise that the base station knows the CSI of the user, and the resource allocation optimization method mainly comprises exhaustive search, greedy algorithm and the like. The NOMA has the potential in the aspects of improving the frequency spectrum benefit and the energy efficiency, the existing combination of the vehicle networking resource allocation based on the NOMA and the network slice has the condition of insufficient research, machine learning and a neural network are mostly used as optimization methods, a large amount of training is needed for finding the optimal solution, the efficiency is not high, and therefore the application of the network slice and the NOMA in the vehicle networking resource allocation still needs to be fully researched.
Disclosure of Invention
The technical problem is as follows: the invention aims to provide a vehicle networking semi-positive resource allocation method based on network slices and NOMA, and aims to solve the problem.
The technical scheme is as follows: in order to solve the technical problem, the method for allocating semi-definite resources of the internet of vehicles based on the network slice and the NOMA comprises the following steps:
step 1, recording vehicle users communicating with infrastructure as V2I users, assuming that a V2I user group in the same network slice is called as a V2I slice group, and performing time-frequency Resource Block (RB) allocation initialization on each V2I slice group by using a static spectrum resource pool under the condition that the number of each V2I slice group and the transmission rate of user communication quality QoS (quality of service) indexes in each V2I slice group are known; furthermore, a semi-persistent scheduling (SPS) period is recorded, wherein one SPS period comprises a resource reservation management stage and a data transmission stage; recording an allocable time-frequency resource with the minimum granularity as a time-frequency resource block RB, and finely adjusting the time-frequency resource block RB allocation of each V2I slice group by using a dynamic spectrum resource pool according to the downlink data transmission rate fed back by each V2I slice group in the previous SPS period data transmission stage until the QoS index transmission rate of each V2I slice group is met by the base station; if the redundant time frequency resource blocks RB are not distributed completely, distributing the residual sub-channels one by one according to the data transmission rate of each V2I slice group with different probabilities until the residual sub-channels are completely distributed;
step 2, recording a transmitting party user group of vehicle and vehicle communication in the same non-orthogonal multiple access cluster to form a V2V NOMA cluster, and recording vehicle users of the vehicle and vehicle communication as V2V users; recording a transmitting user of vehicle-to-vehicle communication as a V2V Tx user; recording a receiving party user of vehicle-to-vehicle communication as a V2V Rx (receiving party) user; in the data transmission phase of the current SPS period, under the condition that the V2V NOMA cluster and each V2I slice group frequency spectrum sharing mode are assumed, and a V2V Tx user in each V2V NOMA cluster is known, the V2V Rx is regulated to receive a broadcast signal of the V2V Tx in a specific receiving range; the V2V Tx users and the V2V Rx users in the receiving range perform distributed transmission power control updating on the V2V Tx users through an iterative algorithm, and the transmission energy efficiency of the V2V users is improved under the condition that the time delay requirement is met.
Wherein,
the step 1 specifically comprises the following steps:
step 1.1, assuming that the transmission power of the base station on each time-frequency resource block RB is fixed, assuming that M V2I users coexist in the coverage area of the base station, recording the mth V2I user as V2I M, and recording the QoS index transmission rate of each V2I user as V2I user
The number of the V2I slice groups is denoted as S, and an attribution discriminant matrix Affi _ NS, affi _ NS (M, S) =1, which defines M × S dimensions of the V2I user and the V2I slice group, represents that V2I M attribution and the V2I slice group S, otherwise, affi _ NS (M, S) =0;
defining an S-dimensional vector aveQoSrate, wherein the S-th element represents the average QoS index transmission rate of the V2I slice group S, i.e.:
step 1.2, the allocable time frequency resources in the base station are divided into static time frequency resource pool and dynamic time frequency resourceAnd two parts of the pool, according to the vector aveQoSrate in the step 1.1, determining the static spectrum resource Chi Shipin resource block RB proportion of each V2I slice group, and recording the static time-frequency resource block proportion of the V2I slice group s as
The sum of the bandwidths of the time-frequency resource blocks in the static spectrum resource pool is recorded as
The bandwidth of the V2I slice group s obtained from the static spectrum resource pool in the initialization stage is
Step 1.3, recording the actual transmission power of V2Im as
Each V2I user uploads an SPS period downlink transmission rate through an SPS period uplink
In case, the base station performs statistics on the QoS index transmission rate satisfaction conditions of each V2I slice group, defines that the S-dimensional QoS index transmission rate satisfies the discrimination vector meetQoS, initializes all zeros, where the S-th element may represent the satisfaction condition of the QoS index transmission rate of the V2I slice group S, that is:
wherein sgn (x) is a sign function, sgn (x) =1 when x > 0; when x =0, sgn (x) =0; when x <0, sgn (x) = -1; if meetQoS(s) =1, all the V2I user QoS index transmission rates in the V2I slice group s are met, otherwise, the V2I user QoS index transmission rates in the V2I slice group s are not met;
step 1.4, if the meetQoS(s) of the last SPS period is less than 1 for any V2I slice group s, allocating RB to the V2I slice group s from the dynamic spectrum resource pool by using the minimum granularity, namely a single time-frequency resource block RB, and repeating the step 1.4 until the meetQoS is a full 1 vector in the current SPS period;
step 1.5, setting an S-dimension dynamic allocation variable mu, if idle time-frequency resource blocks RB still exist in the dynamic spectrum resource pool, for each idle time-frequency resource block RB, in order to properly consider fairness, tending to allocate the idle time-frequency resource block RB to a V2I slice group which can enable the mu value to be maximum under the current SPS period, and using probability to allocate the idle time-frequency resource block RB to the V2I slice group which can enable the mu value to be maximum under the current SPS period
Allocating a time-frequency resource block RB to a V2I slice group s, wherein:
wherein | RB s I represents the number of time-frequency resource blocks RB of the V2I slice group s, RB s Representing a time-frequency resource block RB set of a V2I slice group s; and (5) repeating the step 1.5 until no idle time frequency resource block RB exists in the dynamic frequency spectrum resource pool.
The step 2 specifically comprises the following steps:
step 2.1, assuming that J V2V NOMA clusters are totally arranged in the coverage area of the base station, P V2V Tx users and Q V2V Rx users are totally arranged, defining a P × J dimensional matrix Affi _ NOMA, wherein Affi _ NOMA (P, J) =1 indicates that V2V Txp belongs to a V2V NOMA cluster J; otherwise, affi _ NOMA (p, j) =0; recording the time-frequency resource block set in the V2V NOMA cluster j as RB j For power control of V2V Tx in a single V2V NOMA cluster, the following optimization problem is constructed, taking V2V NOMA cluster j as an example, and the optimization problem P * The construction was as follows:
optimization problem P * The method comprises five constraint conditions of C1-C5, and the p-th V2V Tx user is recorded as V2V Tx p; recording the q-th V2V Rx user as V2V Rx q; marking the nth time frequency resource block RB as RB n, wherein variable
Representing the transmit power of V2V Tx p on RB n,
for the channel gains on RB n for V2V Tx p and V2V Rx q,
for the channel gain on RB n from the base station to V2V Rx q,
for channel gain to be weaker than on RB n
V2V Tx p' and V2V Rx q.
The downlink power of a V2I user which is nearest to the V2V Rx q and shares spectrum resources with the V2V NOMA cluster j;
for the maximum transmit power of each V2V Tx user,
for the transmission rates of V2V Tx p and V2V Rx q on RB n, R pq Is the transmission rate between V2V Tx p and V2V Rx q, L is the broadcast packet length, D is the maximum tolerable delay, B is the maximum tolerable delay RB Is the bandwidth of a single RB. Sigma 2 Is the noise power;
step 2.2, recording the communicable distance between the V2V users as D Tx Then at V2V Tx p radius D Tx The V2V Rx users in the range can receive the broadcast data packet of the V2V Tx p, so the power control of the V2V Tx p is considered to be jointly optimized only for the V2V Rx users and the V2V Tx p which can receive the V2V Tx p signal, if the radius D is equal to the V2V Tx p Tx In, there is only one V2V Rx q, and the radius D of the V2V Rx q Tx If there are no other V2V Tx users in the same cluster with V2V Tx P and V2V NOMA in the range, a temporary power variable Temp1_ P is set p ,Temp2_P p ；
Step 2.3, radius D if at V2V Tx p Tx Within, there is only one V2V Rx q, and at the radius D of this V2V Rx q Tx Other V2V Tx users in the same V2I slice group with the V2V Tx p exist in the range, and the radius D of the V2V Rx q is optimized by adopting a rotation alternation strategy Tx Power control of each V2V Tx p in the inner;
step 2.4, radius D if at V2V Tx p Tx In is present with L p V2V Rx, defining a counting variable L, then L p Each V2V Rx is denoted as q l 
Through this L p The V2V Rx jointly optimizes the V2V Tx p transmission power.
The step 2.2 specifically comprises the following steps:
step 2.2.1, initialize State, temp1_ P p ＝0，
Remember | RB j I is the number of time-frequency resource blocks RB of the V2V NOMA cluster j, and is taken as follows:
step 2.2.2, according to the optimization problem P * The transmission rate R of V2V Rx q and V2V Tx p is calculated according to the constraint conditions C2 and C3 pq ；
Step 2.2.3, if
Then update
If it is
Then update
Step 2.2.4, setting the error precision belonging to the E, if | Temp1_ P p -Temp2_P p |>Belongs to E, repeating the steps 2.2.1 to 2.2.3 until the value is | Temp1_P p -Temp2_P p |<E, final total transmission power update of V2V Tx p to
And get
As the transmission power of V2V Tx p on RB n.
The step 2.3 is specifically as follows:
step 2.3.1, assume V2V Rx q radius D Tx In the interior, there is K j V2V Tx user of V2V NOMAj cluster, for K j The channel gains between the V2V Tx users and the V2V Rx q are sorted in descending order, i.e.
To this K j Setting 2K for V2V Tx user j Temporary variable of power, note
Wherein k is a number of variables of the count,
step 2.3.2, is
Initialization
Taking:
step 2.3.3, K =1, according to the constraint conditions C2, C3, no other K is changed j Calculating the transmission rate of V2V Rx q and V2V Tx p under the condition of 1V 2V Tx user transmission powerRate R pq ；
Step 2.3.4, if
Then update
If it is
Then update
Updating
As the transmission power of V2V Tx p on RB n, the total transmission power of V2V Tx p is
Step 2.3.5, K = K +1, repeating step 2.3.3-step 2.3.4, repeating the steps until K j The V2V Tx users are traversed;
step 2.3.6, taking step 4.4.2-step 4.4.5 as a cycle, and repeating multiple cycles until the cycle is finished
The loop is ended.
The step 2.4 is specifically as follows:
step 2.4.1, define L for V2V Tx p p A temporary power optimization variable, denoted as P pl ，
Initialization
An iteration round number counting variable t is set,initializing t =0;
further, to the optimization problem P * The target function of (2) is modified as follows:
and add new constraints:
constructing an augmented Lagrangian function:
wherein v is l For lagrange multipliers, initialisation to v l (t)，
Is a penalty item; the above formula is equivalent to:
step 2.4.2, when l =1, by P pl And V2V Rx q l If at the V2V Rx q l Radius D of Tx If there are no other V2V Tx users in the same cluster with V2V Tx p and V2V NOMA, step 2.2.1-step 2.2.4 are implemented, such as updating
After make
If the number is reduced, the updating result is reserved, otherwise, the step 2.2.1 to the step 2.2.4 are repeatedly carried out, and the user can find the position
Reduced size
And update
Step 2.4.3 if at the V2V Rx q l Radius D of Tx If there are other V2V Tx users in the same V2I slice group as V2V Tx p, step 2.3.1 to step 2.3.5 are performed, such as updating
After make
If the number is reduced, the updating result is reserved, otherwise, the step 2.3.1 to the step 2.3.5 are repeatedly implemented to find the number
Reduced size
And update
Step 2.4.4, update
So that
At a minimum, according to the principle of least squares, it is known
Step 2.4.5, updating Lagrange multiplier:
step 2.4.6, i = L +1, repeating step 2.4.1-step 2.4.5 until L temporary power optimization variables are traversed;
step 2.4.7, using step 2.4.1-step 2.4.6 as one round, repeating multiple rounds, defining the fine reading element 2 Up to L equal Is less than e 2 Stopping updating and fetching
As a result of the power allocation.
Table 1 index table of main symbols in this text
Has the beneficial effects that: compared with the prior art, the invention is improved from the following aspects:
(1) Aiming at the condition that the implementation of resource allocation based on network slices in the Internet of vehicles is difficult to rely on obtaining vehicle user CSI, in V2I users, the QoS requirement of the V2I users on the data transmission rate is considered, and the distribution of the time-frequency resource blocks RB of the V2I slice groups based on the condition that the QoS meets the requirement in the continuous SPS period is carried out on each V2I slice group in the coverage range of a base station.
(2) In order to meet the requirement of QoS index transmission rate of V2I users in each V2I slice group in as short time as possible, a frequency spectrum resource pool of a base station is divided into a static frequency spectrum resource pool and a dynamic frequency spectrum resource pool. The static spectrum resource pool can initialize the time-frequency resource block RB allocation of each V2I slice group, and after initialization, the base station finely adjusts the time-frequency resource block RB allocation of each V2I slice group according to the condition that the QoS index transmission rate of each V2I slice group meets the requirement by using the dynamic spectrum resource pool. And after the QoS of each V2I slice group is ensured, the fairness allocation is carried out on the residual resources of the static spectrum resource pool, and the condition that the individual V2I slice group occupies most of time frequency resource blocks RB is avoided. The time-frequency resource block RB allocation of the whole V2I slice group ensures the transmission energy efficiency of the V2I user and also considers the spectrum resource allocation fairness of the V2I slice group.
(3) In the NOMA-based transmission power control optimization process of V2V Tx, considering that a vehicle user channel has a fast time-varying characteristic in an internet of vehicles scenario, it is difficult for a base station to acquire CSI of a V2V user to implement centralized resource allocation management. Meanwhile, the reasonable V2V user communication distance D is set in consideration of the actual transmission condition of the broadcast signals in the Internet of vehicles Tx The power control of the V2V Tx is effectively realized by a distributed iterative algorithm. In addition, based on V2V user communication distance D Tx The number of V2V Rx users within the transmission range of each V2V Tx user is discussed. For V2V Tx user, only one V2V Rx user is in the transmission range of the V2V Rx user, and the radius D of the V2V Rx user is Tx If no other V2V Tx is clustered with the V2V Tx, searching an optimal solution meeting constraint conditions by adopting a bisection method; for V2V Tx users, the transmission range has only one V2V Rx user and the radius D of the V2V Rx user Tx If the V2V Tx in the same cluster with the V2V Tx exists, optimizing the power control of the V2V Tx by adopting a rotation alternation strategy; for the condition that a plurality of V2V Rx exist in the V2V Tx user transmission range, a plurality of auxiliary variables are utilized, a penalty term is introduced into a Lagrangian function, and finally the power control of the V2V Tx is realized. The method has the advantages of few iteration rounds and high calculation efficiency.
Based on the improvement, the algorithm provided by the invention can effectively meet the transmission rate of the QoS index of the V2I, and simultaneously, NOMA is used in the V2V users, so that the following greater benefits are obtained: firstly, the operation speed can be greatly improved; secondly, the frequency spectrum utilization rate can be effectively improved; thirdly, the system transmission energy efficiency can be greatly improved.
Description of the drawings:
FIG. 1 is a schematic diagram of a vehicle networking flat road resource allocation optimization scene based on network slices and NOMA;
fig. 2 is a schematic diagram of a network slice and NOMA-based resource allocation process of the internet of vehicles.
Detailed Description
The invention provides a semi-definite resource allocation method of a vehicle networking based on network slices and NOMA, which comprises the steps that firstly, a base station initializes RB time-frequency resource block allocation of each V2I slice group by using a definite frequency spectrum resource pool according to QoS index transmission rate of each V2I slice group, and meanwhile, the base station adjusts frequency resource block RB allocation of each V2I slice group in a current SPS period according to data transmission rate of each V2I slice group in the last SPS period so as to maximize transmission energy efficiency of a V2I user.
For example, there are 3V 2I slice groups within the coverage of the base station, i.e., S =3, and the V2I users in each V2I slice group have their own QoS index transmission rate. There are 9V 2I users in the coverage area of the base station. For convenience of labeling, assume:
Affi_NS(1,1)＝1；Affi_NS(2,1)＝1；Affi_NS(3,1)＝1；
that is, when m =1, 2, 3, the corresponding V2I 1, V2I 2, V2I 3 belongs to the V2I slice group 1 (s = 1);
Affi_NS(4,2)＝1；Affi_NS(5,2)＝1；Affi_NS(6,2)＝1；
i.e. m =4, 5, 6, the corresponding V2I 4, V2I 5, V2I 6 belongs to V2I slice group 2 (s = 2);
Affi_NS(7,3)＝1；Affi_NS(8,3)＝1；Affi_NS(9,3)＝1；
when m =7, 8, 9, the corresponding V2I 7, V2I 8, V2I 9 belongs to V2I slice group 3 (s = 3).
Suppose the QoS index transmission rate of a V2I user within V2I slice group 1 is
Assuming within V2I slice group 2The QoS index transmission rate of the V2I user is
Suppose the QoS index transmission rate of a V2I user within V2I slice group 3 is
Then according to step 1.1, the average QoS indicator transmission rate of the 3V 2I slice groups is:
then, according to step 1.2, the bandwidths that each V2I slice group is divided from the static spectrum resource pool are obtained as follows:
according to step 1.3, the base station can know the condition that the transmission rate of the QoS index of each V2I network slice meets according to the downlink transmission rate of the previous SPS period, that is:
if the meetQoS(s) of the last SPS period is less than 1 for any V2I slice group s, it indicates that the transmission rate of the V2I user QoS index in the V2I slice group s is not met, then the RB is allocated to the V2I slice group s from the dynamic spectrum resource pool with the minimum granularity, namely a single time-frequency resource block RB, and the step is repeated until the meetQoS is a vector of all 1 in the current SPS period, namely 3 elements in the vector are all 1;
at this time, the actual transmission rate of each V2I slice group is used for transmission, and if there is no allocated time-frequency resource block RB in the dynamic spectrum resource pool, the average transmission rate of each V2I slice group in its video resource block RB set can be obtained according to step 1.5, that is:
the base station tends to assign it to the set of V2I slices that maximizes the value of μ for the current SPS period, with probability
And allocating the time-frequency resource block RB to the V2I slice group s. And repeating the process until the time-frequency resource blocks RB in the dynamic spectrum resource pool are not left. And thus, semi-definite allocation of time-frequency resource blocks of the V2I slice group is completed.
Further, it is assumed that there are 3V 2V NOMA clusters, 12V 2V Tx users, and 20V 2V Rx users in the coverage area of the base station. And the 12 × 3-dimensional V2V Tx and the attribute matrix Affi _ NOMA of the V2V NOMA cluster are known. The spectrum sharing pattern of the three V2V NOMA clusters and the V2I slice group is known, i.e. the time-frequency resource block RB set RB of the three V2V NOMA clusters 1 、RB 2 、RB 3 Are known. Suppose that the communication distance between V2V users is D Tx =30 m.
According to steps 2.2-2.4, the classification is performed according to the number of V2V Rx users in each V2V Tx transmission range, for example, if V2V Tx 1 has 1V 2V Rx 10 in its transmission range and there are no other V2V Tx users in the same V2V NOMA cluster as V2V Tx 1 in the reception range of V2V Rx 10 when p =1, if V2V Tx 1 belongs to V2V NOMA cluster 2, i.e., affi _ NOMA (1,2) =1. The temporary power variable Temp1_ P is set 1 ,Temp2_P 1 。
Step S1: initialization State, temp1_ P 1 ＝0，
Remember | RB 2 L is V2VAnd (3) taking the number of time-frequency Resource Blocks (RB) of the NOMA cluster 2:
step S2: optimization problem P according to step 2.1 of claim 3 * The transmission rate R of V2V Rx 10 and V2V Tx 1 is calculated according to the constraints C2 and C3 1,10 ；
And step S3: assuming that the broadcast packet length is 296 bits and the acceptable delay time is 0.1 ms, the lower limit of the transmission rate is 2.96Mb/s. If R is 1,10 If the number of Mb/s is more than or equal to 2.96Mb/s, updating
If R is 1,10 <2.96Mb/s, then update
And step S4: setting the error accuracy E =10 -3 If | Temp1_ P 1 -Temp2_P 1 |>10 -3 Repeating the steps S2 and S3 until | Temp1_ P 1 -Temp2_P 1 |<10 -3 Finally, the total transmission power of V2V Tx 1 is updated to
And get
As the transmission power of V2V Tx 1 on RBn.
For example, if when p =5, if V2V Tx 5 has 1V 2V Rx 12 in its transmission range and there are other V2V Tx users in the same V2V NOMA cluster as V2V Tx 5, e.g. V2V Tx 6, in the reception range of V2V Rx 12, if V2V Tx 5 belongs to V2V NOMA cluster 3, i.e. Affi _ NOMA (5,3) =1. The temporary power variable Temp1_ P is set 5 、Temp2_P 5 、Temp1_P 6 、Temp2_P 6 。
Step S5: to pair
And (3) initializing:
step S6: optimization of problem P according to step 2.1 * The transmission rate R of V2V Rx 12 and V2V Tx 5 is calculated according to the constraints C2 and C3 5,12 ；
Step S7: if R is 5,12 If the number of Mb/s is more than or equal to 2.96Mb/s, updating
If R is 5,12 <2.96Mb/s, then update
Step S8: optimization of problem P according to step 2.1 * The transmission rates R of V2V Rx 12 and V2V Tx 6 are calculated according to the constraints C2 and C3 6,12 ；
Step S9: if R is 6,12 If the number of Mb/s is more than or equal to 2.96Mb/s, updating
If R is 6,12 <2.96Mb/s, then update
Step S10: repeating steps S6-S9 until | Temp1_ P 5 -Temp2_P 5 |<10 -3 And | Temp1_ P 6 -Temp2_P 6 |<10 -3 When it is determined
And get
As V2V Tx 1 on RB nA transmission power; determining
And get
As the transmission power of V2V Tx 1 on RB n.
For example, if when p =10, if V2V Tx 10 has 2V Rx 15, V2V Rx 16 in its transmission range, and there are other V2V Tx users in the same V2V NOMA cluster as V2V Tx 10, e.g., V2V Tx 11, in the reception range of V2V Rx 15, if V2V Tx 10 belongs to V2V NOMA cluster 2, i.e., affi _ NOMA (10,2) =1. There are no other V2V Tx users in the same V2V NOMA cluster as V2V Tx 10 in the acceptance range of V2V Rx 16.
The method of claim 6 wherein step 2.4.1 sets 2 temporary power optimization variables, denoted as P 10,1 、P 10,2 Temporary power optimization variables corresponding to V2V Rx 15 and V2V Rx 16, respectively.
Step S11: for P 10,1 According to the steps S5-S9, completing a temporary power optimization variable P 10,1 Optimized updating of (e.g. update P) 10,1 And then, causing:
decreasing, keeping the updating result, otherwise repeating the steps S5-S9 to find P 10,1 If the value of the above expression can be reduced, the updating result is reserved;
step S12: updating according to the least square principle
Updating Lagrange multiplier:
step S11: for P 10,2 According to the steps S1-S3, completing a temporary power optimization variable P 10,2 Optimized updating of (e.g. update P) 10,2 And then, causing:
if the P value is reduced, the updating result is reserved, otherwise, the steps S1 to S3 are repeated, so that the found P value is 10,2 If the value of the above expression can be reduced, the updating result is reserved;
step S12: updating according to the least square principle
Updating Lagrange multipliers:
step S15: repeating steps S11-S14 until P 10,1 、P 10,2 The updated accurate reading meets the requirement, and finally the accurate reading is obtained
As a result of the power allocation.
Claims (6)
1. A semi-positive resource allocation method of a vehicle networking based on network slices and NOMA is characterized by comprising the following steps:
step 1, recording vehicle users communicating with infrastructure as V2I users, recording a V2I user group in the same network slice as a V2I slice group, and performing time-frequency Resource Block (RB) allocation initialization on each V2I slice group by using a static spectrum resource pool under the condition that the number of each V2I slice group and the transmission rate of user communication quality QoS (quality of service) indexes in each V2I slice group are known; furthermore, a semi-fixed resource allocation time period is recorded as an SPS period, and the SPS period comprises a resource reservation management stage and a data transmission stage; recording an allocable time-frequency resource with the minimum granularity as a time-frequency resource block RB, and finely adjusting the time-frequency resource block RB allocation of each V2I slice group by using a dynamic spectrum resource pool according to the downlink data transmission rate fed back by each V2I slice group in the previous SPS period data transmission stage until the QoS index transmission rate of each V2I slice group is met by the base station; if the redundant time frequency resource blocks RB are not distributed completely, distributing the residual sub-channels one by one according to the data transmission rate of each V2I slice group with different probabilities until the residual sub-channels are completely distributed;
step 2, recording a transmitting party user group of vehicle and vehicle communication in the same non-orthogonal multiple access cluster to form a V2V NOMA cluster, and recording vehicle users of the vehicle and vehicle communication as V2V users; recording a transmitting user of vehicle-to-vehicle communication as a V2V Tx user; recording a receiving party user of vehicle-to-vehicle communication as a V2V Rx user; in the data transmission phase of the current SPS period, under the condition that the V2V NOMA cluster and each V2I slice group frequency spectrum sharing mode are assumed, and a V2V Tx user in each V2V NOMA cluster is known, the V2V Rx is regulated to receive a broadcast signal of the V2V Tx in a specific receiving range; the V2V Tx users and the V2V Rx users in the receiving range perform distributed transmission power control updating on the V2V Tx users through an iterative algorithm, and the transmission energy efficiency of the V2V users is improved under the condition that the time delay requirement is met.
2. The method for allocating semi-positive resources of the internet of vehicles based on the network slice and the NOMA as claimed in claim 1, wherein the step 1 specifically comprises:
step 1.1, assuming that the transmission power of the base station on each time-frequency resource block RB is fixed, assuming that M V2I users coexist in the coverage area of the base station, defining a counting variable M, wherein M is more than or equal to 1 and less than or equal to M, recording the mth V2I user as V2Im, and recording the QoS index transmission rate of each V2I user as V2Im
The number of the V2I slice groups is recorded as S, a counting variable S is defined, S is larger than or equal to 1 and is smaller than or equal to S, an attribution discriminant matrix Affi _ NS of the V2I users and the V2I slice groups with dimension of M multiplied by S is defined, and Affi _ NS (M, S) =1 represents that V2I M is attributed toBelongs to the V2I slice group s, otherwise Affi _ NS (m, s) =0;
defining an S-dimensional vector aveQoSrate, wherein the S-th element represents the average QoS index transmission rate of the V2I slice group S, i.e.:
step 1.2, the allocable time frequency resource in the base station is divided into a static time frequency resource pool and a dynamic time frequency resource pool, the static frequency spectrum resource Chi Shipin resource block RB proportion of each V2I slice group is determined according to the vector aveQoSrate in the step 1.1, and the static time frequency resource block proportion of the V2I slice group s is recorded as
The sum of the bandwidths of the time-frequency resource blocks in the static spectrum resource pool is recorded as
The bandwidth of the V2I slice group s obtained from the static spectrum resource pool in the initialization stage is
Step 1.3, let V2I m actual transmission power be
Each V2I user uploads an SPS period downlink transmission rate through an SPS period uplink
And the base station counts the condition that the QoS index transmission rate of each V2I slice group meets the condition, and decidesDefining that the transmission rate of the S-dimensional QoS index meets the requirement of a discrimination vector meetQoS, initializing all zeros, wherein the S-th element can represent the requirement of the transmission rate of the QoS index of a V2I slice group S, namely:
wherein sgn (x) is a sign function, and when x >0, sgn (x) =1; when x =0, sgn (x) =0; when x <0, sgn (x) = -1; if meetQoS(s) =1, all the V2I user QoS index transmission rates in the V2I slice group s are met, otherwise, the V2I user QoS index transmission rates in the V2I slice group s are not met;
step 1.4, if the meetQoS(s) of the last SPS period is less than 1 for any V2I slice group s, allocating RB to the V2I slice group s from the dynamic spectrum resource pool by using the minimum granularity, namely a single time-frequency resource block RB, and repeating the step 1.4 until the meetQoS is a full 1 vector in the current SPS period;
step 1.5, setting an S-dimension dynamic allocation variable mu, if after step 1.4, the meetQoS is a full 1 vector and idle time-frequency resource blocks RB still exist in the dynamic spectrum resource pool, for each idle time-frequency resource block RB, in order to properly consider fairness, the idle time-frequency resource block RB tends to be allocated to a V2I slice group which can enable the mu value to be maximum under the current SPS period, and the probability is used for the resource block to be the maximum
Allocating a time-frequency resource block RB to a V2I slice group s, wherein:
wherein | RB s I represents the number of time-frequency resource blocks RB of the V2I slice group s, RB s Representing a time-frequency resource block RB set of a V2I slice group s; and (4) repeating the step 1.5 until no idle time frequency resource block RB exists in the dynamic spectrum resource pool.
3. The Internet of vehicles semi-definite resource allocation method based on network slices and NOMA as claimed in claim 1, wherein the step 2 specifically comprises:
step 2.1, assuming that there are J V2V NOMA clusters in the coverage area of the base station, there are P V2V Tx users and Q V2V Rx users, defining a counting variable P,
defining a P × J dimensional matrix Affi _ NOMA (P, J) =1, which means that V2V Tx P belongs to V2V NOMA cluster J; otherwise, affi _ NOMA (p, j) =0; recording the time-frequency resource block set in the V2V NOMA cluster j as RB j For power control of V2V Tx in a single V2V NOMA cluster, the following optimization problem is constructed, taking V2V NOMA cluster j as an example, and the optimization problem P * The construction was as follows:
P * ：
s.t.C1：
C2：
C3：
C4：
C5：
optimization problem P * The method comprises five constraint conditions of C1-C5, and the p-th V2V Tx user is recorded as V2V Tx p; recording the qth V2V Rx user as V2V Rx q; defining a counting variable n, and recording the nth time-frequency resource block RB as RB n, wherein the variable n
Representing the transmit power of V2V Tx p on RB n,
for the channel gains on RB n for V2V Tx p and V2V Rx q,
for the channel gain on RB n from the base station to V2V Rx q,
for channel gain to be weaker than on RB n
The channel gain between V2V Tx p' and V2V Rx q;
the downlink power of a V2I user which is nearest to the V2V Rx q and shares spectrum resources with the V2V NOMA cluster j;
for the maximum transmit power of each V2V Tx user,
for the transmission rates of V2V Tx p and V2V Rx q on RB n, R pq Is the transmission rate between V2V Txp and V2V Rxq, L is the broadcast packet length, D is the maximum tolerable delay, B is the maximum tolerable delay RB Is the bandwidth of a single RB. Sigma 2 Is the noise power;
step 2.2, recording the communicable distance between the V2V users as D Tx At a radius D of V2V Tx p Tx The V2V Rx users in the range can receive the broadcast data packet of the V2V Tx p, so the power control of the V2V Tx p is considered to be jointly optimized only for the V2V Rx users and the V2V Tx p which can receive the V2V Tx p signal, if the radius D is at the V2VTx p Tx In, there is only one V2V Rx q, and the radius D of the V2V Rx q Tx Setting a temporary power variable Temp1_ P if no other V2V Tx users with the same V2V NOMA cluster as the V2V Tx P are in the range p ，Temp2_P p ；
Step 2.3, radius D if at V2V Tx p Tx In, there is only one V2V Rx q, and the radius D of the V2V Rx q Tx Other V2V Tx users in the same V2I slice group with the V2V Tx p exist in the range, and the radius D of the V2V Rx q is optimized by adopting a rotation alternation strategy Tx Power control of each V2V Tx p in the inner;
step 2.4, if at V2V Tx p radius D Tx In is present with L p V2V Rx, defining a counting variable L, then L p Each V2V Rx is denoted by q l 
Through this L p The V2V Rx jointly optimizes the V2V Tx p transmission power.
4. The method for allocating semi-positive resources of the internet of vehicles based on the network slice and the NOMA as claimed in claim 3, wherein the step 2.2 is specifically as follows:
step 2.2.1, initialize State, temp1_ P p ＝0，
Remember | RB j I is the number of time-frequency resource blocks RB of the V2V NOMA cluster j, and is taken as follows:
step 2.2.2, according to the optimization problem P * The transmission rate R of V2V Rx q and V2V Tx p is calculated according to the constraint conditions C2 and C3 pq ；
Step 2.2.3, if
Then update
If it is
Then update
Step 2.2.4, setting the error precision belonging to the E, if | Temp1_ P p -Temp2_P p If is larger than e, repeat step 2.2.1-step 2.2.3 until if is Temp1_ P p -Temp2_P p L < ∈, the final total transmission power of V2V Tx p is updated to
And get
As the transmission power of V2V Tx p on RB n.
5. The method for allocating semi-positive resources of the internet of vehicles based on the network slice and the NOMA as claimed in claim 3, wherein the step 2.3 is specifically as follows:
step 2.3.1, assume V2V Rx q radius D Tx In the interior, there is K j V2V Tx users of a V2V NOMA j cluster, for which K j The channel gains between the V2V Tx users and the V2V Rx q are sorted in descending order, i.e.
To this K j Setting 2K for V2V Tx user j Temporary variable of power, noted
Wherein k is a count variable, and k is a count variable,
step 2.3.2, for
Initialization
Taking:
step 2.3.3, K =1, according to the constraint conditions C2, C3, without changing other K j -calculating the transmission rate R of V2V Rx q and V2V Tx p for 1V 2V Tx user transmission power pq ；
Step 2.3.4, if
Then update
If it is
Then update
Updating
As the transmission power of V2V Tx p on RB n, the total transmission power of V2V Tx p is
Step 2.3.5, K = K +1, repeating step 2.3.3-step 2.3.4, repeating the steps until K j The V2V Tx users are traversed;
step 2.3.6, using the step 4.4.2 to the step 4.4.5 as a round of circulation, and repeating the round of circulation until the step is finished
The loop is ended.
6. The method for allocating semi-positive resources of the internet of vehicles based on the network slice and the NOMA as claimed in claim 3, wherein the step 2.4 is specifically as follows:
step 2.4.1, define Lp temporary power optimization variables for V2V Tx P, denoted as P pl ，
Initialization
Setting an iteration round number counting variable t, and initializing t =0;
further, to the optimization problem P * The target function of (2) is modified as follows:
and add new constraints:
constructing an augmented Lagrangian function:
wherein v is l For lagrange multipliers, initialisation to v l (t)，
Is a penalty item; the above formula is equivalent to:
step 2.4.2, when l =1, by P pl And V2V Rx q l If at V2 VRxq l Radius D of Tx If there are no other V2V Tx users in the same cluster with V2V Tx p and V2V NOMA, step 2.2.1-step 2.2.4 are implemented, such as updating
Rear messenger
If the number is reduced, the updating result is reserved, otherwise, the step 2.2.1 to the step 2.2.4 are repeatedly carried out, and the user can find the position
Reduced size
And update
Step 2.4.3 if at the V2V Rx q l Radius D of Tx If there are other V2V Tx users in the same V2I slice group as V2V Tx p, step 2.3.1 to step 2.3.5 are performed, such as updating
Rear messenger
If the number is reduced, the updating result is reserved, otherwise, the step 2.3.1 to the step 2.3.5 are repeatedly implemented to find the number
Reduced size
And update
Step 2.4.4, update
So that
At a minimum, according to the principle of least squares, it is known
Step 2.4.5, updating Lagrange multiplier:
step 2.4.6, i = L +1, repeating step 2.4.1-step 2.4.5 until L temporary power optimization variables are traversed;
step 2.4.7, taking step 2.4.1-step 2.4.6 as one round, repeating multiple rounds, and defining the accurate reading epsilon 2 Up to L equal Is less than e 2 Stopping updating and fetching
As a result of the power allocation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210729292.7A CN115209554A (en) | 2022-06-24 | 2022-06-24 | Internet of vehicles semi-positive definite resource allocation method based on network slice and NOMA |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210729292.7A CN115209554A (en) | 2022-06-24 | 2022-06-24 | Internet of vehicles semi-positive definite resource allocation method based on network slice and NOMA |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115209554A true CN115209554A (en) | 2022-10-18 |
Family
ID=83577949
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210729292.7A Pending CN115209554A (en) | 2022-06-24 | 2022-06-24 | Internet of vehicles semi-positive definite resource allocation method based on network slice and NOMA |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115209554A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109479300A (en) * | 2016-09-29 | 2019-03-15 | Oppo广东移动通信有限公司 | Method, network device and terminal device for transmitting information |
| CN110418399A (en) * | 2019-07-24 | 2019-11-05 | 东南大学 | A kind of car networking resource allocation methods based on NOMA |
| CN111132083A (en) * | 2019-12-02 | 2020-05-08 | 北京邮电大学 | NOMA-based distributed resource allocation method in vehicle formation mode |
| CN112055335A (en) * | 2020-09-18 | 2020-12-08 | 深圳恩步通信技术有限公司 | Uplink vehicle-mounted communication resource allocation method and system based on NOMA |
| CN113490275A (en) * | 2021-07-07 | 2021-10-08 | 东南大学 | NOMA-based vehicle networking broadcast communication resource allocation method |
| WO2022121985A1 (en) * | 2020-12-10 | 2022-06-16 | 北京邮电大学 | Static and dynamic combined millimeter wave beam resource allocation and optimization method |
-
2022
- 2022-06-24 CN CN202210729292.7A patent/CN115209554A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109479300A (en) * | 2016-09-29 | 2019-03-15 | Oppo广东移动通信有限公司 | Method, network device and terminal device for transmitting information |
| CN110418399A (en) * | 2019-07-24 | 2019-11-05 | 东南大学 | A kind of car networking resource allocation methods based on NOMA |
| CN111132083A (en) * | 2019-12-02 | 2020-05-08 | 北京邮电大学 | NOMA-based distributed resource allocation method in vehicle formation mode |
| CN112055335A (en) * | 2020-09-18 | 2020-12-08 | 深圳恩步通信技术有限公司 | Uplink vehicle-mounted communication resource allocation method and system based on NOMA |
| WO2022121985A1 (en) * | 2020-12-10 | 2022-06-16 | 北京邮电大学 | Static and dynamic combined millimeter wave beam resource allocation and optimization method |
| CN113490275A (en) * | 2021-07-07 | 2021-10-08 | 东南大学 | NOMA-based vehicle networking broadcast communication resource allocation method |
Non-Patent Citations (1)
| Title |
|---|
| 蒋伟;宋铁成;王聪;胡静: "基于NOMA的车联网资源分配算法", 东南大学学报(英文版), no. 001, 31 December 2020 (2020-12-31) * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yoshida et al. | Hybrid-FL for wireless networks: Cooperative learning mechanism using non-IID data | |
| Xu et al. | Deep deterministic policy gradient (DDPG)-based resource allocation scheme for NOMA vehicular communications | |
| CN110418399B (en) | NOMA-based Internet of vehicles resource allocation method | |
| CN111277437A (en) | Network slice resource allocation method for smart power grid | |
| Ko et al. | Joint client selection and bandwidth allocation algorithm for federated learning | |
| CN113504999A (en) | Scheduling and resource allocation method for high-performance hierarchical federated edge learning | |
| CN110800359B (en) | Relay station operation in cellular networks | |
| Balakrishnan et al. | Resource management and fairness for federated learning over wireless edge networks | |
| CN108123828B (en) | Ultra-dense network resource allocation method based on access user mobility prediction | |
| CN112887999B (en) | Intelligent access control and resource allocation method based on distributed A-C | |
| CN113506040B (en) | Scheduling and resource allocation method for high-performance federal learning in UAV swarm | |
| CN104219190B (en) | The subchannel and power distribution method of a kind of cognitive ofdm system | |
| CN109548161A (en) | A kind of method, apparatus and terminal device of wireless resource scheduling | |
| CN111328146B (en) | Service scheduling method for optimizing transmission rate weight based on genetic algorithm | |
| Yang et al. | Utility optimization of grouping-based uplink OFDMA random access for the next generation WLANs | |
| Lin et al. | CFLIT: Coexisting federated learning and information transfer | |
| CN113382414B (en) | Non-orthogonal multiple access system resource allocation method and device based on network slice | |
| CN113490275B (en) | NOMA-based Internet of vehicles broadcast communication resource allocation method | |
| CN115086964A (en) | Dynamic spectrum allocation method and system based on multi-dimensional vector space optimization | |
| CN115190544B (en) | QoS-based Internet of vehicles network slice and NOMA clustering joint optimization method | |
| CN115209554A (en) | Internet of vehicles semi-positive definite resource allocation method based on network slice and NOMA | |
| CN108811143A (en) | Uplink based on user activity is exempted to authorize the CTU distribution methods of SCMA | |
| CN112954806A (en) | Chord graph coloring-based joint interference alignment and resource allocation method in heterogeneous network | |
| CN110062360B (en) | Resource allocation method based on mMTC service classification | |
| CN114760646B (en) | Link decision method based on multi-layer aggregation context MAB |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |