CN114401491B - Resource allocation method and device in device-to-device communication - Google Patents

Resource allocation method and device in device-to-device communication Download PDF

Info

Publication number
CN114401491B
CN114401491B CN202111595319.XA CN202111595319A CN114401491B CN 114401491 B CN114401491 B CN 114401491B CN 202111595319 A CN202111595319 A CN 202111595319A CN 114401491 B CN114401491 B CN 114401491B
Authority
CN
China
Prior art keywords
grouping
centers
terminal
packet
straight
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.)
Active
Application number
CN202111595319.XA
Other languages
Chinese (zh)
Other versions
CN114401491A (en
Inventor
陈谱滟
刘平
常海成
霍山松
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Telecom Corp Ltd
Original Assignee
China Telecom Corp Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by China Telecom Corp Ltd filed Critical China Telecom Corp Ltd
Priority to CN202111595319.XA priority Critical patent/CN114401491B/en
Publication of CN114401491A publication Critical patent/CN114401491A/en
Application granted granted Critical
Publication of CN114401491B publication Critical patent/CN114401491B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
    • H04W4/08—User group management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/10—Dynamic resource partitioning
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/70—Services for machine-to-machine communication [M2M] or machine type communication [MTC]

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Multimedia (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The application provides a resource allocation method and a device in device-to-device communication, and relates to the technical field of communication. The resource allocation method provides a mechanism of grouping the through terminal pairs, and in the process of grouping a plurality of through terminal pairs, a grouping center with smaller characteristic difference with the through terminal pairs is selected as much as possible, so that communication interference caused by small characteristic difference between the through terminal pairs and the grouping center is reduced, and the probability of larger characteristic difference between the plurality of through terminal pairs in one group is higher due to larger characteristic difference between the plurality of through terminal pairs in one group and the grouping center, and communication interference between the plurality of through terminal pairs in one group is reduced.

Description

Resource allocation method and device in device-to-device communication
Technical Field
The present application relates to the field of communications technologies, and in particular, to a method and an apparatus for allocating resources in device-to-device communications.
Background
Device-to-device (D2D) communication is a communication technology in which data interaction is directly performed between terminals without forwarding through a base station. With the continuous development of communication technology, D2D communication is gradually introduced in the fifth generation mobile communication (the 5th generation system,5G) network. In addition to the through terminal in D2D, the communication system corresponding to D2D communication further includes a cellular terminal. The pass-through terminal can multiplex the communication resources of the cellular terminal to realize communication with other pass-through terminals.
At present, there are two resource allocation modes, one is a random resource allocation method (random resource allocation algorithm-none power control, RA-NPC), and the main idea of the method is that no through terminal pair is grouped, and the through terminal pair randomly multiplexes cellular resources of any cellular terminal. The random resource allocation method does not take into account interference problems in the communication system. Another is a conventional resource allocation method (traditional group resource allocation algorithm-none power control, TGR-NPC) whose main idea is to divide pairs of through terminals with the same attributes into one packet and to use cellular terminals with the same attributes to provide resources for the packet. The method can reduce communication interference of a communication system by utilizing the packet, but common-frequency interference still occurs between the direct terminal and the cellular terminal, and the common-frequency interference also exists between the direct terminals. It can be seen that in the two methods, communication interference of the communication system is still larger.
Disclosure of Invention
The embodiment of the application provides a resource allocation method and a device in device-to-device communication, which are used for reducing communication interference in a communication system.
In a first aspect, an embodiment of the present application provides a method for allocating resources in device-to-device communication, including: obtaining a plurality of first grouping centers corresponding to a plurality of through terminal pairs, wherein one first grouping center is a grouping center of at least one through terminal pair of the plurality of through terminal pairs; performing at least one update iteration operation on the plurality of first packet centers, wherein one iteration operation comprises: determining a first degree of attribution between each of the plurality of through terminal pairs and each of the plurality of first packet centers, the first degree of attribution being inversely related to a first characteristic difference between one of the through terminal pairs and one of the first packet centers, and based on the determined first degree of attribution, minimizing a cost function, updating the plurality of first packet centers, obtaining a plurality of second packet centers, the cost function being inversely related to the first characteristic difference between one of the through terminal pairs and one of the first packet centers; and if the plurality of second grouping centers meet the preset conditions, determining that the plurality of through terminals respectively correspond to the grouping based on the plurality of second grouping centers to obtain at least one grouping.
In the embodiment of the application, in the process of grouping a plurality of through terminal pairs, a grouping center with larger characteristic difference with the through terminal pairs is selected as much as possible, and a grouping mechanism is provided, which is equivalent to pulling the characteristic difference between the through terminal pairs and the grouping center, so that the communication interference between the through terminal pairs and the grouping center can be reduced. And, because the characteristic difference between the plurality of through terminal pairs in one packet and the packet center is larger, the probability that the characteristic difference between the plurality of through terminal pairs in one packet is larger is also higher, so that the communication interference between the plurality of through terminal pairs in one packet is reduced.
In a possible implementation manner, obtaining a plurality of first packet centers corresponding to the plurality of through terminal pairs includes: determining a second characteristic difference between each two of the plurality of through terminal pairs; and carrying out multi-round iterative grouping on the plurality of straight-through terminal pairs according to the determined second characteristic difference, wherein one round of iterative grouping comprises the following steps: taking the center between two straight-through terminal pairs corresponding to the smallest second characteristic difference as a grouping center of the iterative grouping of the previous round, and determining the straight-through terminal pairs as the straight-through terminal pairs of the iterative grouping of the previous round; determining at least one straight-through terminal pair with a first characteristic difference larger than a threshold value from the straight-through terminal pair of the previous round of iterative grouping, and taking the at least one straight-through terminal pair as the straight-through terminal pair of the current round of iterative grouping; determining the center of two straight-through terminal pairs with the smallest second characteristic difference among the straight-through terminal pairs of the iterative grouping of the present round as the grouping center of the iterative grouping of the present round; stopping iterative grouping until the straight-through terminal pair of iterative grouping cannot be determined, and determining the grouping center determined by each round of iterative grouping as the plurality of first grouping centers.
In the embodiment, a method for determining the initial grouping centers of a plurality of straight-through terminal pairs is provided, and the method utilizes a global hierarchical search method to determine the initial grouping centers, so that the selected grouping centers are polled in a plurality of feasible domains as much as possible, the situation of selecting the locally optimal grouping centers is effectively avoided, and the accuracy of grouping the plurality of straight-through terminal pairs is improved.
In one possible implementation, determining a first degree of attribution between each pass-through terminal pair of the plurality of pass-through terminal pairs and each first packet center of the plurality of first packet centers includes: determining a first degree of attribution between one pass-through terminal of the plurality of pass-through terminal pairs and one first packet center of the plurality of first packet centers, respectively: determining a first characteristic difference between the one pass-through terminal and the one first grouping center; determining a third characteristic difference between each two first packet centers of the plurality of first packet centers; and obtaining the first attribution degree between the one through terminal and the one first grouping center based on the first attribution degree and the determined third characteristic differences.
In this embodiment, a manner is provided for calculating the first attribution degree, where the first attribution degree is inversely related to the feature difference between one through terminal and one first packet center, and is also positively related to the feature difference between every two first packet centers of the plurality of first packet centers, so that it is advantageous to determine a packet center with a larger feature difference for the through terminal, and to improve the dispersion degree between the plurality of packet centers.
In one possible implementation manner, based on the determined first attribution degree, minimizing a cost function, updating a grouping center corresponding to at least one of the plurality of through terminal pairs, and obtaining a plurality of second grouping centers includes: substituting the determined first attribution into a grouping center updating function to obtain the plurality of second grouping centers, wherein the grouping center updating function is obtained after setting the derivative of the cost function relative to one first grouping center to be zero and substituting a attribution solving function, wherein the cost function is inversely related to a third characteristic difference between every two first grouping centers and inversely related to one attribution, and the attribution solving function is a function for determining the first attribution.
In this embodiment, a derivation is provided for determining the update function of the packet center, and updating the packet center on the basis of minimizing the cost function is advantageous for determining a packet center with a greater difference in characteristics for the pass-through terminal pair.
In one possible embodiment, the method further comprises: determining a fourth characteristic difference between each two second packet centers of the plurality of second packet centers and determining a sum of the plurality of fourth characteristic differences; and if the sum of the determined fourth characteristic differences is smaller than or equal to a preset threshold value, determining that the second packet centers meet the preset condition.
In this embodiment, the preset condition is, for example, that the sum of the feature differences between every two second packet centers in the plurality of second packet centers is smaller than or equal to a preset threshold, so that the determined plurality of packet centers are prevented from being excessively scattered, which is beneficial to improving the accuracy of determining the packet centers.
In one possible implementation manner, based on the plurality of second packet centers, determining that the plurality of through terminals corresponds to each packet, and obtaining at least one packet includes: determining a second degree of attribution between each of the plurality of pass-through terminal pairs and each of the plurality of second packet centers; and determining the straight-through terminal pairs with the same second packet centers of the minimum second attribution degree as belonging to the same packet so as to obtain the at least one packet.
In this embodiment, the packet center to which the through terminal pair belongs may be determined based on the determined attribution degree according to the attribution degree between the through terminal pair and the second packet center, so that the packet of the through terminal pair is achieved, and the packet center with the smallest attribution degree is selected as the packet of the through terminal pair, which is favorable for selecting the packet center with larger characteristic difference, and is favorable for reducing communication interference between the through terminal pairs between one packet.
In one possible embodiment, the method further comprises: and under the constraint condition, maximizing the signal-to-interference ratio of the base station corresponding to each group, and determining the cellular terminal corresponding to each through terminal group.
In the embodiment, the optimal cellular terminal is searched for the packet based on the maximization of the signal-to-interference ratio, so that the communication quality among the packets is improved.
In one possible embodiment, the method further comprises: if the signal-to-interference ratio of the receiving end in the target straight-through terminal pair is greater than or equal to the first signal-to-interference ratio, reducing the initial transmitting power of the transmitting end in the target straight-through terminal pair, wherein the target straight-through terminal pair is any one of the at least one grouping; and if the signal-to-dry ratio of the receiving end in the target straight-through terminal pair is smaller than or equal to a second signal-to-dry ratio, increasing the initial transmitting power of the transmitting end in the target straight-through terminal pair, wherein the second signal-to-dry ratio is smaller than the first signal-to-dry ratio.
In this embodiment, the initial transmission power of the transmitting end in the target through terminal pair is adjusted according to the signal-to-interference ratio of the receiving end in the target through terminal pair, which is beneficial to improving the communication quality of the target through terminal pair.
In a second aspect, an embodiment of the present application provides a resource allocation apparatus in device-to-device communication, including: the acquisition module is used for acquiring a plurality of first grouping centers corresponding to the plurality of through terminal pairs, wherein one first grouping center is a grouping center of at least one through terminal pair of the plurality of through terminal pairs; an updating module, configured to perform at least one updating iteration operation on the plurality of first packet centers, where one iteration operation includes: determining a first degree of attribution between each of the plurality of through terminal pairs and each of the plurality of first packet centers, the first degree of attribution being inversely related to a first characteristic difference between one of the through terminal pairs and one of the first packet centers, and based on the determined first degree of attribution, minimizing a cost function, updating the plurality of first packet centers, obtaining a plurality of second packet centers, the cost function being inversely related to the first characteristic difference between one of the through terminal pairs and one of the first packet centers; and the determining module is used for determining the corresponding groups of the plurality of through terminals to obtain at least one group based on the plurality of second group centers if the plurality of second group centers meet the preset conditions.
In one possible implementation, the obtaining module is specifically configured to: determining a second characteristic difference between each two of the plurality of through terminal pairs; and carrying out multi-round iterative grouping on the plurality of straight-through terminal pairs according to the determined second characteristic difference, wherein one round of iterative grouping comprises the following steps: taking the center between two straight-through terminal pairs corresponding to the minimum second characteristic difference as a grouping center of the previous round of iterative grouping, determining the straight-through terminal pairs as straight-through terminal pairs of the previous round of iterative grouping, determining at least one straight-through terminal pair with the first characteristic difference larger than a threshold value from the straight-through terminal pairs of the previous round of iterative grouping, taking the at least one straight-through terminal pair as the straight-through terminal pairs of the present round of iterative grouping, and determining the center of the two straight-through terminal pairs with the minimum second characteristic difference in the straight-through terminal pairs of the present round of iterative grouping as the grouping center of the present round of iterative grouping; stopping iterative grouping until the straight-through terminal pair of iterative grouping cannot be determined, and determining the grouping center determined by each round of iterative grouping as the plurality of first grouping centers.
In a possible implementation manner, the updating module is specifically configured to: determining a first degree of attribution between one pass-through terminal of the plurality of pass-through terminal pairs and one first packet center of the plurality of first packet centers, respectively: determining a first characteristic difference between the one pass-through terminal and the one first grouping center; determining a third characteristic difference between each two first packet centers of the plurality of first packet centers; and obtaining the first attribution degree between the one through terminal and the one first grouping center based on the first attribution degree and the determined third characteristic differences.
In a possible implementation manner, the updating module is specifically configured to: substituting the determined first attribution into a grouping center updating function to obtain the plurality of second grouping centers, wherein the grouping center updating function is obtained after setting the derivative of the cost function relative to one first grouping center to be zero and substituting a attribution solving function, wherein the cost function is inversely related to a third characteristic difference between every two first grouping centers and inversely related to one attribution, and the attribution solving function is a function for determining the first attribution.
In one possible implementation manner, the determining module is specifically configured to: determining a fourth characteristic difference between each two second packet centers of the plurality of second packet centers and determining a sum of the plurality of fourth characteristic differences; and if the sum of the determined fourth characteristic differences is smaller than or equal to a preset threshold value, determining that the second packet centers meet the preset condition.
In one possible implementation manner, the determining module is specifically configured to: determining a second degree of attribution between each of the plurality of pass-through terminal pairs and each of the plurality of second packet centers; and determining the straight-through terminal pairs with the same second packet centers of the minimum second attribution degree as belonging to the same packet so as to obtain the at least one packet.
In one possible implementation, the determining module is further configured to: and under the constraint condition, maximizing the signal-to-interference ratio of the base station corresponding to each group in the at least one group, and determining the cellular terminal corresponding to each group.
In a possible embodiment, the device further comprises an adjustment module, specifically configured to: if the signal-to-interference ratio of the receiving end in the target straight-through terminal pair is greater than or equal to the first signal-to-interference ratio, reducing the initial transmitting power of the transmitting end in the target straight-through terminal pair, wherein the target straight-through terminal pair is any one of the at least one grouping; and if the signal-to-dry ratio of the receiving end in the target straight-through terminal pair is smaller than or equal to a second signal-to-dry ratio, increasing the initial transmitting power of the transmitting end in the target straight-through terminal pair, wherein the second signal-to-dry ratio is smaller than the first signal-to-dry ratio.
In a third aspect, embodiments of the present application provide a computing device comprising: at least one processor, and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor, the at least one processor implementing the method of any one of the first aspects by executing the instructions stored by the memory.
In a fourth aspect, embodiments of the present application provide a computer-readable storage medium storing computer instructions that, when run on a computer, cause the computer to perform the method according to any one of the first aspects.
The advantages achieved with respect to the above-described second to fourth aspects may be referred to the advantages discussed with respect to the first aspect and are not listed here.
Drawings
Fig. 1 is a schematic diagram of a scenario in which a through terminal pair group multiplexes cellular resources according to an embodiment of the present application;
Fig. 2 is a flow chart of a method for allocating resources in device-to-device communication according to an embodiment of the present application;
Fig. 3 is a schematic flow chart of determining a plurality of first packet centers according to an embodiment of the present application;
fig. 4 is a schematic diagram showing a comparison of the number of pairs of through terminals allowed to access according to an embodiment of the present application;
fig. 5 is a second schematic diagram comparing the number of pairs of through terminals allowed to access according to an embodiment of the present application;
FIG. 6 is a graph showing a comparison of cumulative distribution functions of total throughput provided by an embodiment of the present application;
Fig. 7 is a schematic structural diagram of a resource allocation apparatus for device-to-device communication according to an embodiment of the present application;
fig. 8 is a schematic structural diagram of a computing device according to an embodiment of the present application.
Detailed Description
In order to better understand the technical solutions provided by the embodiments of the present application, the following detailed description will be given with reference to the accompanying drawings and specific embodiments.
In order to facilitate the technical solution in the embodiments of the present application to be better understood by those skilled in the art, technical terms related to the embodiments of the present application are described below.
1. The through terminal pair in the embodiment of the application can be called as a D2D user pair, and refers to two terminals in D2D communication. The through terminal pair comprises a transmitting end and a receiving end.
2. The grouping in the embodiment of the present application may also be referred to as a pass-through terminal group or a D2D user group, and refers to all pass-through terminal pairs multiplexing cellular resources of one cellular terminal. One pass-through terminal group includes at least one pass-through terminal pair.
3. The cellular terminal in the embodiment of the present application may also be referred to as a cellular user, and refers to a terminal that does not participate in D2D communication.
4. The cellular resource in the embodiment of the application refers to the resource of the cellular terminal multiplexed by the D2D communication, and the cellular resource is, for example, a frequency band.
5. The feature difference in the embodiment of the present application refers to a difference between features of two objects, for example, a through terminal and/or a cellular terminal. The larger the value of the difference between the features A and B is, the smaller the similarity between the features A and B is, and the larger the difference between the features A and B is. For example, the feature differences between a and B may be quantified by the euclidean distance or cosine similarity between the features of a and B, and embodiments of the present application do not limit the specific manner of quantification of the feature differences.
6. The base station in the embodiment of the application refers to a base station for communicating with a cellular terminal.
An application scenario of a resource allocation method in device-to-device communication in the embodiment of the present application is described below with reference to an application scenario schematic diagram shown in fig. 1. Or fig. 1 may also be understood as a schematic architecture diagram of a communication system according to an embodiment of the present application.
As shown, the scenario includes multiple pass-through terminal pairs, base station B, and cellular terminals. A communication link may be established between the base station and the cellular terminal, and a communication link may be established between a pair of pass-through terminals, e.g., two pass-through terminals in the pair may multiplex cellular resources of the cellular terminal to enable mutual communication.
Pairs of pass-through terminals such as D 1、Dj and D n in fig. 1, the two pass-through terminals of each pair of pass-through terminals including D T and D R shown in fig. 1. Wherein D T represents a transmitting end in the through terminal pair, and D R represents a receiving end in the through terminal pair. As shown in fig. 1, the pass-through terminal pair D 1 and the pass-through terminal pair D j constitute a packet G k,Dn and a packet G 1. Cellular terminals such as C i and C m shown in fig. 1. Illustratively, the pass-through terminal in group G k may multiplex the cellular resources provided by cellular terminal C i and the pass-through terminal in group G 1 may multiplex the cellular resources provided by cellular terminal C m.
In fig. 1, one base station, two cellular terminals, and three through terminal groups are taken as an example, and the number of base stations, cellular terminals, and through terminal groups is not limited in practice.
In order to reduce communication interference of a communication system, the embodiment of the application provides a resource allocation method in device-to-device communication. The method may be performed by a computing device having computing capabilities, such as a terminal or server, for example, a virtual server or a physical server, for example, as embodiments of the application are not limited in this regard.
Fig. 2 is a flow chart of a resource allocation method in device-to-device communication according to an embodiment of the present application. The method is described below in connection with fig. 2. It should be noted that, in fig. 2, the computing device is taken as an example to execute the method.
S21, a plurality of first grouping centers corresponding to the plurality of through terminal pairs are obtained.
A first packet center includes at least one of a plurality of pass-through terminal pairs. A first packet center may be understood as the initial packet center of at least one of the plurality of pass-through terminal pairs. The number of the plurality of first packet centers is greater than 1 and less than C. C is the total number of cellular terminals and C is an integer greater than 1.
The manner in which the computing device determines the plurality of first packet centers is varied, as described by way of example below.
In one mode, the computing device randomly selects a plurality of first grouping centers according to the feature distribution conditions of the plurality of through terminal pairs.
Wherein the characteristics of a pass-through terminal pair include one or more of rate requirements, communication latency, channel quality, geographic location, and quality of service (quality of service, qoS) of a pass-through terminal pair. The geographical location includes, for example, the geographical location of the two pass-through terminals of the pass-through terminal pair or the center of the two pass-through terminals as the geographical location.
The computing device may represent the features of each of the plurality of pass-through terminal pairs as feature vectors, representing the features of each of the plurality of pass-through terminal pairs in a world coordinate system, thereby randomly determining a plurality of first group centers in the world coordinate system.
In a second mode, the computing device determines a plurality of first packet centers using a global hierarchical search method.
Fig. 3 is a schematic flow chart of determining a plurality of first packet centers according to an embodiment of the present application.
S31, determining second characteristic differences between every two of the through terminal pairs.
The computing device combines features of each of the plurality of through terminal pairs to obtain a feature matrix. For example, one feature matrix is represented as follows:
wherein the feature matrix a includes N rows and F columns, N represents the number of through terminal pairs among the plurality of through terminal pairs, F represents the number of features of one through terminal pair, a i＝[ai1 ai2 … aiF represents the ith row vector of the ith through terminal pair, that is, the feature vector of the ith through terminal pair, and a ij represents the jth feature of the ith through terminal pair.
Alternatively, the values of the features of the plurality of through terminal pairs may be determined according to actual statistics.
The computing device determines a second characteristic difference between each two through terminal pairs according to equation (1) above. A formula for calculating the second characteristic difference between every two through terminal pairs is as follows.
(dij)2＝||Ai-Aj||＝(Ai-Aj)T(Ai-Aj) (2)
Wherein a i represents the feature vector of the i-th pass-through terminal pair, and a j represents the feature vector of the j-th pass-through terminal pair.
The computing device performs the following multiple rounds of iterative grouping operations on the plurality of pass-through terminal pairs according to the determined plurality of second feature differences, wherein one round of iterative grouping operations includes the following steps S32-S34, respectively, as described below.
S32, taking the center between two straight-through terminal pairs corresponding to the smallest second characteristic difference as the grouping center of the iterative grouping of the previous round, and determining a plurality of straight-through terminal pairs as the straight-through terminal pairs of the iterative grouping of the previous round.
And the computing equipment determines two straight-through terminal pairs with the smallest second characteristic differences according to the determined second characteristic differences, and takes the centers of the two straight-through terminal pairs as the grouping centers of the previous iteration grouping.
S33, determining at least one straight-through terminal pair with the first characteristic difference larger than a threshold value from the straight-through terminal pairs of the previous round of iterative grouping, and taking the at least one straight-through terminal pair as the straight-through terminal pair of the current round of iterative grouping.
The value of the threshold may be pre-stored in the computing device. To avoid the locally optimal solution, a plurality of through terminal pairs may be determined, and at least one through terminal pair whose first characteristic difference from the packet center of the previous iteration packet is greater than a threshold value is determined, in other words, the first packet center of the through terminal pair whose first characteristic difference from the packet center of the previous iteration packet is less than or equal to the threshold value is the packet center of the previous iteration packet.
S34, determining the center of the two straight-through terminal pairs with the smallest second characteristic difference in the straight-through terminal pairs of the iterative grouping of the round as the grouping center of the iterative grouping of the round.
Similarly, the computing device determines two through terminal pairs with the smallest second feature differences among the at least one through terminal pair, and determines the centers of the two through terminal pairs as the grouping centers of the iterative grouping of the round.
And S35, stopping iterative grouping until the iterative grouping of the plurality of straight-through terminal pairs is completed, and determining the grouping center determined by each round of iterative grouping as a plurality of first grouping centers.
And so on, the computing device may repeatedly perform the steps of S32-S34 described above until all through terminal pairs have been iteratively grouped, e.g., the number of obtained group centers reaches C, and the computing device stops the iterative grouping process and determines all group centers obtained by previous iterative grouping as a plurality of first group centers.
S22, performing at least one updating iteration operation on the plurality of first grouping centers, wherein one iteration operation comprises: determining a first degree of attribution, and based on the determined first degree of attribution, minimizing a cost function, updating the plurality of first packet centers to obtain a plurality of second packet centers.
The computing device determines a first degree of attribution between one of the plurality of through terminal pairs and one of the plurality of first packet centers, respectively. The determining of the first attribution degree specifically comprises:
S1.1, determining a first characteristic difference between a straight-through terminal and a first grouping center; determining a third characteristic difference between each two first packet centers of the plurality of first packet centers;
S1.2, obtaining the first attribution degree between a straight-through terminal and a first grouping center based on the first attribution degree and the determined third characteristic differences.
For example, the computing device may determine a first degree of attribution between a pass-through terminal and a first packet center according to a degree of attribution solving function. Wherein the first degree of attribution is inversely related to a first characteristic difference of a through terminal pair to a first packet center.
The manner in which the membership solution function is determined is exemplified below.
Where μ ik＝μGi(Ak) represents the first degree of attribution of the kth through terminal pair to the ith first packet center. Wherein m represents a blur index, and the greater m is, the higher the blur degree is, and the value of m is from 1 to positive infinity.
The packet center and degree of attribution are solved using lagrangian (Lagrange) multiplier, an example of which is as follows.
Wherein d ik represents a first characteristic difference between the ith first packet center and the kth through terminal pair, λ is an intermediate variable, and no specific meaning is given.
Setting the first order partial derivative of the formula (4) to 0, the following formula can be obtained.
Further, the method comprises the steps of,
The computing device may derive a membership solution function from the above equations (4) - (6) as shown in the following equation.
Where j represents the j-th first packet center.
Note that, the above formula (7) is an example of one kind of the attribution degree solving function, but the specific expression of the attribution degree solving function is not limited.
A cost function may be pre-stored in the computing device, for example, an expression for one of the cost functions is exemplified as follows.
Where C represents the number of cellular terminals, ω= [ ω 1,ω2…ωC ] represents the packet center, d iv represents a third feature difference between the i-th first packet center and the v-th first packet center, e.g., the computing device has the euclidean distance of the feature between the i-th first packet center and the v-th first packet center as the third feature difference.
The computing device minimizes the cost function and, in conjunction with equation (7) above, may be derived by the following derivation process to obtain a group center update function, examples of which are as follows.
Where a k represents the eigenvector of the kth pass-through terminal pair.
The computing device may substitute the first degree of attribution into equation (9) to update the plurality of first packet centers to obtain a plurality of second packet centers. And similarly, stopping iteration until the determined plurality of grouping centers meet the preset conditions. And taking the last obtained plurality of grouping centers as grouping centers corresponding to the plurality of through terminal pairs. In the embodiment of the present application, the description is given by taking the case that the plurality of second packet centers meet the preset condition as an example, and if the plurality of second packet centers do not meet the preset condition, the computing device may continue to perform the iterative operation.
The computing device determines a fourth characteristic difference between each two second packet centers of the plurality of second packet centers and determines a sum of the plurality of fourth characteristic differences. And if the sum of the determined fourth characteristic differences is smaller than or equal to a preset threshold epsilon, determining that the second packet centers meet preset conditions.
Alternatively, an example of a formula representing the sum of the plurality of fourth feature differences is as follows.
S23, if the plurality of second grouping centers meet the preset conditions, determining that the plurality of through terminals correspond to the groups respectively based on the plurality of second grouping centers, and obtaining at least one group.
In the case that the plurality of second packet centers are determined to meet the preset condition, the computing device may determine a second degree of attribution between each of the plurality of through terminal pairs and each of the plurality of second packet centers, and determine that the through terminal pair having the same second degree of attribution belongs to the same packet to obtain at least one packet.
The resource allocation method in the above embodiment may be simply referred to as a method of resource allocation but reactive control (traditional group resource allocation algorithm-none power control, IGR-NPC).
After grouping the plurality of through terminal pairs, the computing device may assign a cellular terminal to each D2D user group, and in the embodiment of the present application, the computing device may find an optimal cellular terminal according to a signal-to-interference-and-noise ratio (signal to interference plus noise ratio, SINR) maximization principle user group. The resource allocation method in this case may be simply referred to as a resource allocation and power control method (improve group resource allocation algorithm power control, IGR-PC).
Specifically, if the ith packet G i shares k channel resources of the through terminal pair multiplexing cellular terminal C j, the calculation formula of the SINR at the base station side corresponding to the ith packet is illustrated as follows.
Wherein,Is the transmission power of k transmitting ends in the ith packet, H c2b represents the channel gain from the cellular terminal to the base station,/>The channel gain between the cellular terminal to the pass-through terminal pair is represented by N 0, which is an empirical value, such as gaussian white noise density.
The computing device builds an SINR matrix S and a resource allocation matrix R, examples of which are as follows.
S＝[s1s2…sC]T＝[sij]C×M (12)
R＝[rij]C×M (13)
Where s 1＝[s11s12…s1M],sij represents the SINR at the base station side when the ith packet multiplexes the jth cellular terminal, and also represents the channel quality of the channel in this case. r ij =1 indicates that the ith packet is allowed to multiplex the jth cellular user resource, otherwise indicates that multiplexing is not allowed.
To reduce interference to cellular users, guaranteeing maximum SINR requirements, the computing device introduces constraints, including the condition of r ij =1, examples of which are as follows.
Where P represents the minimum SINR for cellular terminal communications.
The computing device initializes a packet g= [ G 1,G2…GC ], a set c= [ C 1,C2…CM ] of a plurality of cellular terminals, a SINR matrix s= [ S ij]C×M ], a resource allocation matrix r= [ R ij]C×M. Further, the computing device calculates SINR value s ij of the C j (j=1, 2 … M) th cellular user according to equation (11). The computing device updates the SINR matrix. Further, the computing device determines a maximum SINR value in vector R i and updates resource matrix R according to equation (14), thereby determining a cellular terminal corresponding to each of the at least one packet.
In general, the transmitting end in the packet adopts initial transmitting power, and in the embodiment of the present application, the transmitting power of the transmitting end in the packet can be adjusted, so as to reduce communication interference in each packet in at least one packet.
The following description will take an example of adjusting the transmission power of the receiving end in any of the pair of through terminals in any of the at least one packet.
If the signal-to-interference ratio of the receiving end in the target through terminal pair is greater than the first signal-to-interference ratio, the computing device may determine to reduce the initial transmit power of the transmitting end in the target through terminal pair; and if the signal-to-interference ratio of the receiving end in the target straight-through terminal pair is smaller than or equal to the second signal-to-interference ratio, increasing the initial transmission power of the transmitting end in the target straight-through terminal pair. Wherein the second signal-to-dry ratio is less than or equal to the first signal-to-dry ratio.
Specifically, the calculation formula of the initial transmission power of the transmitting end in the target through terminal pair is exemplified as follows.
Wherein, P D is the initial power of transmission,PL is the path loss and f (Δ i) is the adjustment value, which is the path compensation factor. Alternatively, a specific calculation formula of f (Δ i) is exemplified as follows.
Where SINR R represents the signal-to-interference ratio of the receiving end in the target through terminal pair, SINR high represents the first signal-to-interference ratio, and can be understood as the highest signal-to-interference ratio of the receiving end communication in the target through terminal pair. SINR low represents the second signal-to-interference ratio, which can be understood as the lowest signal-to-interference ratio of the receiver communication in the target through terminal pair. The first signal-to-dry ratio is greater than the second signal-to-dry ratio. When SINR R≤SINRlow indicates that the channel quality is poor, the transmit power of the transmitting end should be properly increased; when SINR R≥SINRhigh is high, the channel quality is good, and the transmitting power of the transmitting end can be properly reduced under the condition of guaranteeing self service, so that the interference to other terminals is reduced.
The embodiment of the application provides a method for grouping direct terminal pairs, which improves the distribution balance of a determined first grouping center according to a minimum distance principle and a global iteration mode, and adds a cost function into an objective function, thereby improving the accuracy of grouping the direct terminal pairs. In addition, in the embodiment of the application, the direct terminals which are mutually exclusive in demand are divided into the same groups by adopting reverse thinking, so that the games of the direct terminals in the groups on the same resources are reduced, and the interference in the groups is effectively reduced. And finally, matching the optimal cellular terminal for each packet according to the principle of maximizing the SINR of the cellular link. In addition, the embodiment of the application also carries out closed-loop power control adjustment on the straight-through terminal pairs in the group after the grouping, and reduces the same-frequency interference in the group again on the basis of ensuring the requirement. In addition, the embodiment of the application can effectively improve the number of the communication system accommodating through terminal pairs, greatly improve the throughput of the communication system and improve the resource efficiency.
In order to compare the effects of the resource allocation method in the device-to-device communication in the embodiment of the present application, by simulation, the key indexes under the resource allocation and power control method (IGR-PC), the resource allocation but idle control method (IGR-NPC), the random resource allocation method (RA-NPC), and the conventional resource allocation method (TGR-NPC) in the embodiment of the present application are compared.
In the simulation, the through terminals are uniformly distributed in the cell for the cellular terminal, and simulation parameters are shown in table 1 below.
TABLE 1
Parameter name Parameter value
Cell radius/m 300
Maximum characteristic difference/m of straight-through terminal pair 20
Resource Block (RB) bandwidth/KHz 12*30＝360
Number/number of cellular terminals 10
Power transfer/dBm of base station 46
Cellular terminal power/dBm 21
Maximum transmit power of a transmitting end in a pass-through terminal pair 21
Gaussian white noise Density/(db/Hz) -174
Line-of-sight path loss (eta, alpha, delta) (61.4,2,5.8db)
Non line-of-sight path loss (nlos) (eta, alpha, delta) (72,2.92,8.7db)
Number of simulations 300
Simulation parameters as shown in table 1 above, the number of allowed access through terminal pairs under three methods of resource allocation but reactive control (IGR-NPC), random resource allocation (RA-NPC) and conventional resource allocation (TGR-NPC) is shown in fig. 4.
As shown in fig. 4, the random resource allocation method (RA-NPC) fails to consider the characteristics of the through terminal pair, it is difficult to avoid communication interference between the through terminal pair and the cellular terminal, and the through terminal is randomly matched with the cellular terminal, so that resource allocation is blind, and the number of through terminal pairs that can be accepted by the method is obviously limited.
The number of through terminal pairs that can be accessed is relatively larger under the conventional resource allocation method (TGR-NPC), but is still smaller than the number of through terminal pairs that can be accessed by the resource allocation but reactive control method (IGR-NPC) in the embodiment of the present application.
The implementation of the present application also compares the throughput of the communication system with the resource allocation and power control method (IGR-PC), the resource allocation but reactive control method (IGR-NPC) in the embodiments of the present application, the random resource allocation method (RA-NPC), and the conventional resource allocation method (TGR-NPC), and the following describes the formula for calculating the throughput in the communication system.
Wherein,
Wherein BER tar is a target bit error rate, W is a bandwidth, SINR R represents a signal-to-interference ratio of a base station side and a plurality of receiving ends in a packet, SINR c,B represents a signal-to-interference ratio of a base station with respect to all receiving ends in all packets, and SINR D,R represents a signal-to-interference ratio of all packets with respect to all receiving ends in all packets. The calculation formula of the signal-to-interference ratio (e.g., SINR of the receiving end D R j of the j-th through terminal pair in the packet G k) of one receiving end is illustrated as follows.
Where H is the channel gain, and H d2c、Hc2b represents the channel gain from the cellular terminal to the transmitting end of the through terminal pair, and the channel gain from the cellular terminal to the receiving end of the through terminal pair, respectively.H is the channel attenuation coefficient,/>Is the transmit power of the transmitting end in the j' th packet,/>Is the transmit power of the cellular terminal in the j' th packet.
Fig. 5 is a schematic diagram comparing throughput of a communication system under the resource allocation and power control method (IGR-PC), the resource allocation but idle control method (IGR-NPC), and the random resource allocation method (RA-NPC) and the conventional resource allocation method (TGR-NPC) according to an embodiment of the present application. As can be seen from fig. 5, the four methods are the same in that as the pairs of through terminals increase, the throughput of the communication system increases, but due to the increase of interference in the system, the number of accesses of the pairs of through terminals is limited, and the throughput of the communication system tends to be smooth.
The throughput of these four methods is ordered from big to small: IGR-PC > IGR-NPC > TGR-NPC > RA-NPC. Compared with the IGR-NPC in the embodiment of the application, the IGR-PC in the embodiment of the application adjusts the power of the transmitting end in the direct terminal pair, inhibits the intra-packet interference to a certain extent, and further improves the throughput of the communication system.
Compared with the IGR-NPC method in the embodiment of the application, the IGR-PC method in the embodiment of the application not only has an active control part, but also considers a plurality of special attributes of the through terminal, and more accurate description is provided for the D2D user requirement under 5G. Compared with RA-NPC, the IGR-PC in the embodiment of the application divides the direct terminals requiring mutual exclusion into one group, reduces the interference between the direct terminals in the group, searches the optimal cellular user resource for the group according to the SINR maximization principle, and greatly improves the throughput of the communication system.
Further, the embodiment of the present application compares the cumulative distribution function (cumulative distribution function, CDF) curves of the total throughput of the communication system under the four methods, specifically referring to fig. 6.
It can be seen from fig. 6 that the manner in which TGR-NPC divides the group of pass-through terminals improves the system throughput to some extent, but it is difficult to coordinate the interference between pass-through terminals within a packet. The IGR-PC in the embodiment of the application not only improves the global balance of the grouping, but also groups the direct terminal pairs according to the mutual exclusion principle, thereby effectively inhibiting the intra-grouping interference. And the SINR maximization principle adopted fully reduces the influence on the cellular users in the system, so that the throughput is obviously higher than that of other methods. Finally, the closed loop power control provided by the embodiment of the application can reduce the interference among users in the group again on the group basis, and the throughput of the communication system is improved to a certain extent compared with the IGR-NPC algorithm of reactive power control.
Based on the same inventive concept, embodiments of the present application provide a resource allocation apparatus in device-to-device communication, which may be provided in the foregoing computing device or implement the functions of the foregoing computing device. Referring to fig. 7, the apparatus includes: an obtaining module 701, configured to obtain a plurality of first packet centers corresponding to a plurality of through terminal pairs, where one first packet center is a packet center of at least one through terminal pair of the plurality of through terminal pairs; an updating module 702, configured to perform at least one updating iteration operation on the plurality of first packet centers, where one iteration operation includes: determining a first attribution degree between each of the plurality of through terminal pairs and each of the plurality of first grouping centers, the first attribution degree being inversely related to a first characteristic difference between one of the plurality of through terminal pairs and one of the first grouping centers, and based on the determined first attribution degree, minimizing a cost function, updating a grouping center corresponding to at least one of the plurality of through terminal pairs, to obtain a plurality of second grouping centers, the cost function being inversely related to the first characteristic difference between one of the plurality of through terminal pairs and one of the first grouping centers; a determining module 703, configured to determine, based on the plurality of second packet centers, that the plurality of through terminals are to respectively correspond to the packets, and obtain at least one packet, if the plurality of second packet centers meet the preset condition.
In one possible implementation, the obtaining module 701 is specifically configured to: determining a second characteristic difference between each two of the plurality of through terminal pairs; and carrying out multi-round iterative grouping on the plurality of straight-through terminal pairs according to the determined second characteristic difference, wherein one round of iterative grouping comprises the following steps: taking the center between two straight-through terminal pairs corresponding to the minimum second characteristic difference as a grouping center of the previous iteration grouping, determining a plurality of straight-through terminal pairs as straight-through terminal pairs of the previous iteration grouping, determining at least one straight-through terminal pair with the first characteristic difference larger than a threshold value from the straight-through terminal pairs of the previous iteration grouping, taking the at least one straight-through terminal pair as the straight-through terminal pair of the present iteration grouping, and determining the center of the two straight-through terminal pairs with the minimum second characteristic difference as the grouping center of the present iteration grouping; stopping iterative grouping until the straight-through terminal pair of iterative grouping cannot be determined, and determining the grouping center determined by each round of iterative grouping as a plurality of first grouping centers.
In one possible implementation, the update module 702 is specifically configured to: determining a first degree of attribution between one of the plurality of through terminal pairs and one of the plurality of first packet centers, respectively: determining a first characteristic difference between a pass-through terminal and a first grouping center; determining a third characteristic difference between each two first packet centers of the plurality of first packet centers; and obtaining the first attribution degree between the through terminal and the first grouping center based on the first attribution degree and the determined third characteristic differences.
In one possible implementation, the update module 702 is specifically configured to: substituting the determined first attribution degree into a grouping center updating function to obtain a plurality of second grouping centers, wherein the grouping center updating function is obtained after setting the derivative of a cost function relative to one first grouping center to be zero and substituting a attribution degree solving function, wherein the cost function is also inversely related to a third characteristic difference between every two first grouping centers and inversely related to one attribution degree, and the attribution degree solving function is a function for determining the first attribution degree.
In one possible implementation, the determining module 703 is specifically configured to: determining a fourth characteristic difference between every two second packet centers of the plurality of second packet centers and determining a sum of the plurality of fourth characteristic differences; and if the sum of the determined fourth characteristic differences is smaller than or equal to a preset threshold value, determining that the second packet centers meet preset conditions.
In one possible implementation, the determining module 703 is specifically configured to: determining a second degree of attribution between each of the plurality of through terminal pairs and each of the plurality of second packet centers; and determining the straight-through terminal pairs with the same second packet centers of the minimum second attribution degree as belonging to the same packet so as to obtain at least one packet.
In one possible implementation, the determining module 703 is further configured to: and under the constraint condition, maximizing the signal-to-interference ratio of the base station corresponding to each group in at least one group, and determining the cellular terminal corresponding to each group.
In a possible embodiment, the apparatus further comprises an adjustment module 704, specifically configured to: if the signal-to-interference ratio of the receiving end in the target through terminal pair is greater than or equal to the first signal-to-interference ratio, reducing the initial transmission power of the transmitting end in the target through terminal pair, wherein the target through terminal pair is any one of at least one group; and if the signal-to-dry ratio of the receiving end in the target straight-through terminal pair is smaller than or equal to the second signal-to-dry ratio, increasing the initial transmitting power of the transmitting end in the target straight-through terminal pair, wherein the second signal-to-dry ratio is smaller than the first signal-to-dry ratio.
As one example, the adjustment module 704 in the apparatus is an optional module.
As an example, the apparatus shown in fig. 7 may also implement a resource allocation method of device-to-device communication of any of the foregoing discussion, which is not listed here.
Based on the same inventive concept, embodiments of the present application provide a computing device that may be used to implement the functionality of the computing device in fig. 2, or the communication device is the computing device in fig. 2. Fig. 8 is a schematic structural diagram of a computing device according to an embodiment of the application. The computing device includes: at least one processor 801, and a memory 802 communicatively coupled to the at least one processor 801; wherein the memory 802 stores instructions executable by the at least one processor 801, the at least one processor 801 implementing a method as performed by the computing device of fig. 2 by executing the instructions stored by the memory 802.
Alternatively, the at least one processor 801 may be a central processing unit (central processing unit, CPU), or a digital processing unit, or the like. The memory 802 may be a volatile memory (RAM), such as a random-access memory (RAM); the memory 802 may also be a non-volatile memory (non-volatile memory), such as a read-only memory, a flash memory (flash memory), a hard disk (HARD DISK DRIVE, HDD) or a Solid State Disk (SSD), or the memory 802 may be any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited thereto. Memory 802 may be a combination of the above.
Optionally, the computing device in fig. 8 may also implement the functions of the apparatus in fig. 7, which are not described herein.
Based on the same inventive concept, embodiments of the present application provide a computer-readable storage medium storing computer instructions that, when run on a computer, cause the computer to perform a resource allocation method of any one of the device-to-device communications as previously discussed.
Based on the same inventive concept, embodiments of the present application provide a computer program product storing a computer program comprising program instructions which, when executed by a computer, cause the computer to perform a resource allocation method of a device-to-device communication as any one of the preceding discussion.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may 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, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may 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, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present application have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. It is therefore intended that the following claims be interpreted as including the preferred embodiments and all such alterations and modifications as fall within the scope of the application.
It will be apparent to those skilled in the art that various modifications and variations can be made to the present application without departing from the spirit or scope of the application. Thus, it is intended that the present application also include such modifications and alterations insofar as they come within the scope of the appended claims or the equivalents thereof.

Claims (12)

1. A method of resource allocation in device-to-device communication, comprising:
Obtaining a plurality of first grouping centers corresponding to a plurality of through terminal pairs, wherein one first grouping center is a grouping center of at least one through terminal pair of the plurality of through terminal pairs;
performing at least one update iteration operation on the plurality of first packet centers, wherein one iteration operation comprises:
determining a first degree of attribution between each of the plurality of pass-through terminal pairs and each of the plurality of first packet centers, the first degree of attribution being inversely related to a first characteristic difference between one of the pass-through terminal pairs and one of the first packet centers;
Based on the determined first attribution, minimizing a cost function, updating the plurality of first grouping centers, and obtaining a plurality of second grouping centers, wherein the cost function is inversely related to a first characteristic difference between a straight-through terminal pair and a first grouping center;
And if the plurality of second grouping centers meet the preset conditions, determining that the plurality of through terminals respectively correspond to the grouping based on the plurality of second grouping centers to obtain at least one grouping.
2. The method of claim 1, wherein obtaining a plurality of first packet centers for the plurality of through terminal pairs comprises:
Determining a second characteristic difference between each two of the plurality of through terminal pairs;
And carrying out multi-round iterative grouping on the plurality of straight-through terminal pairs according to the determined second characteristic difference, wherein one round of iterative grouping comprises the following steps:
Taking the center between two straight-through terminal pairs corresponding to the smallest second characteristic difference as a grouping center of the iterative grouping of the previous round, and determining the straight-through terminal pairs as the straight-through terminal pairs of the iterative grouping of the previous round;
Determining at least one straight-through terminal pair with a first characteristic difference larger than a threshold value from the straight-through terminal pair of the previous round of iterative grouping, and taking the at least one straight-through terminal pair as the straight-through terminal pair of the current round of iterative grouping;
Determining the center of two straight-through terminal pairs with the smallest second characteristic difference among the straight-through terminal pairs of the iterative grouping of the present round as the grouping center of the iterative grouping of the present round;
And stopping iterative grouping until the iterative grouping of the plurality of straight-through terminal pairs is completed, and determining the grouping center determined by each round of iterative grouping as the plurality of first grouping centers.
3. The method of claim 1, wherein determining a first degree of attribution between each of the plurality of pass-through terminal pairs and each of the plurality of first packet centers comprises:
Determining a first degree of attribution between one pass-through terminal of the plurality of pass-through terminal pairs and one first packet center of the plurality of first packet centers, respectively:
determining a first characteristic difference between the one pass-through terminal and the one first grouping center;
determining a third characteristic difference between each two first packet centers of the plurality of first packet centers;
And obtaining the first attribution degree between the one through terminal and the one first grouping center based on the first attribution degree and the determined third characteristic differences.
4. The method of claim 1, wherein minimizing a cost function based on the determined first degree of attribution, updating the plurality of first packet centers, obtaining a plurality of second packet centers, comprises:
Substituting the determined first attribution into a grouping center updating function to obtain the plurality of second grouping centers, wherein the grouping center updating function is obtained after setting the derivative of the cost function relative to one first grouping center to be zero and substituting a attribution solving function, wherein the cost function is inversely related to a third characteristic difference between every two first grouping centers and inversely related to one attribution, and the attribution solving function is a function for determining the first attribution.
5. The method of any one of claims 1-4, wherein the method further comprises:
Determining a fourth characteristic difference between each two second packet centers of the plurality of second packet centers and determining a sum of the plurality of fourth characteristic differences;
And if the sum of the determined fourth characteristic differences is smaller than or equal to a preset threshold value, determining that the second packet centers meet the preset condition.
6. The method according to any of claims 1-4, wherein determining, based on the plurality of second packet centers, the respective corresponding packets of the plurality of through terminals to obtain at least one packet comprises:
determining a second degree of attribution between each of the plurality of pass-through terminal pairs and each of the plurality of second packet centers;
and determining the straight-through terminal pairs with the same second packet centers of the minimum second attribution degree as belonging to the same packet so as to obtain the at least one packet.
7. The method of any one of claims 1-4, wherein the method further comprises:
and under the constraint condition, maximizing the signal-to-interference ratio of the base station corresponding to each group in the at least one group, and determining the cellular terminal corresponding to each group.
8. The method of claim 7, wherein the method further comprises:
If the signal-to-interference ratio of the receiving end in the target straight-through terminal pair is greater than or equal to the first signal-to-interference ratio, reducing the initial transmitting power of the transmitting end in the target straight-through terminal pair, wherein the target straight-through terminal pair is any one of the at least one grouping;
And if the signal-to-dry ratio of the receiving end in the target straight-through terminal pair is smaller than or equal to a second signal-to-dry ratio, increasing the initial transmitting power of the transmitting end in the target straight-through terminal pair, wherein the second signal-to-dry ratio is smaller than the first signal-to-dry ratio.
9. A resource allocation apparatus in device-to-device communication, comprising:
The acquisition module is used for acquiring a plurality of first grouping centers corresponding to the plurality of through terminal pairs, wherein one first grouping center is a grouping center of at least one through terminal pair of the plurality of through terminal pairs;
An updating module, configured to perform at least one updating iteration operation on the plurality of first packet centers, where one iteration operation includes: determining a first degree of attribution between each of the plurality of through terminal pairs and each of the plurality of first packet centers, the first degree of attribution being inversely related to a first characteristic difference between one of the through terminal pairs and one of the first packet centers, and based on the determined first degree of attribution, minimizing a cost function, updating the plurality of first packet centers, obtaining a plurality of second packet centers, the cost function being inversely related to the first characteristic difference between one of the through terminal pairs and one of the first packet centers;
And the determining module is used for determining the corresponding groups of the plurality of through terminals to obtain at least one group based on the plurality of second group centers if the plurality of second group centers meet the preset conditions.
10. The apparatus of claim 9, wherein the obtaining module is specifically configured to:
Determining a second characteristic difference between each two of the plurality of through terminal pairs;
And carrying out multi-round iterative grouping on the plurality of straight-through terminal pairs according to the determined second characteristic difference, wherein one round of iterative grouping comprises the following steps: taking the center between two straight-through terminal pairs corresponding to the minimum second characteristic difference as a grouping center of the previous round of iterative grouping, determining the straight-through terminal pairs as straight-through terminal pairs of the previous round of iterative grouping, determining at least one straight-through terminal pair with the first characteristic difference larger than a threshold value from the straight-through terminal pairs of the previous round of iterative grouping, taking the at least one straight-through terminal pair as the straight-through terminal pairs of the present round of iterative grouping, and determining the center of the two straight-through terminal pairs with the minimum second characteristic difference in the straight-through terminal pairs of the present round of iterative grouping as the grouping center of the present round of iterative grouping;
stopping iterative grouping until the straight-through terminal pair of iterative grouping cannot be determined, and determining the grouping center determined by each round of iterative grouping as the plurality of first grouping centers.
11. A computing device, comprising:
at least one processor, and
A memory communicatively coupled to the at least one processor;
Wherein the memory stores instructions executable by the at least one processor, the at least one processor implementing the method of any one of claims 1-8 by executing the memory stored instructions.
12. A computer readable storage medium storing computer instructions which, when run on a computer, cause the computer to perform the method of any one of claims 1-8.
CN202111595319.XA 2021-12-24 2021-12-24 Resource allocation method and device in device-to-device communication Active CN114401491B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111595319.XA CN114401491B (en) 2021-12-24 2021-12-24 Resource allocation method and device in device-to-device communication

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111595319.XA CN114401491B (en) 2021-12-24 2021-12-24 Resource allocation method and device in device-to-device communication

Publications (2)

Publication Number Publication Date
CN114401491A CN114401491A (en) 2022-04-26
CN114401491B true CN114401491B (en) 2024-05-10

Family

ID=81226605

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111595319.XA Active CN114401491B (en) 2021-12-24 2021-12-24 Resource allocation method and device in device-to-device communication

Country Status (1)

Country Link
CN (1) CN114401491B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20150086152A (en) * 2014-01-17 2015-07-27 숭실대학교산학협력단 Method of resource allocation for Device-to Device coommunication in cellular system and apparatus thereof
KR20160018244A (en) * 2014-08-08 2016-02-17 주식회사 아이티엘 Apparatus and method for determining d2d data resource for d2d communication
CN108391317A (en) * 2018-04-03 2018-08-10 吉林大学 The resource allocation methods and system that D2D is communicated in a kind of cellular network
CN110475230A (en) * 2019-06-25 2019-11-19 南京邮电大学 The resource allocation methods, storage medium and terminal of D2D user in cellular network
CN113596786A (en) * 2021-07-26 2021-11-02 广东电网有限责任公司广州供电局 Resource allocation grouping optimization method for end-to-end communication

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20150086152A (en) * 2014-01-17 2015-07-27 숭실대학교산학협력단 Method of resource allocation for Device-to Device coommunication in cellular system and apparatus thereof
KR20160018244A (en) * 2014-08-08 2016-02-17 주식회사 아이티엘 Apparatus and method for determining d2d data resource for d2d communication
CN108391317A (en) * 2018-04-03 2018-08-10 吉林大学 The resource allocation methods and system that D2D is communicated in a kind of cellular network
CN110475230A (en) * 2019-06-25 2019-11-19 南京邮电大学 The resource allocation methods, storage medium and terminal of D2D user in cellular network
CN113596786A (en) * 2021-07-26 2021-11-02 广东电网有限责任公司广州供电局 Resource allocation grouping optimization method for end-to-end communication

Also Published As

Publication number Publication date
CN114401491A (en) 2022-04-26

Similar Documents

Publication Publication Date Title
CN109729528B (en) D2D resource allocation method based on multi-agent deep reinforcement learning
CN112737837B (en) Method for allocating bandwidth resources of unmanned aerial vehicle cluster under high dynamic network topology
CN105721123B (en) A kind of user pairing and power distribution method and device
He et al. Resource allocation based on graph neural networks in vehicular communications
CN111182570A (en) User association and edge computing unloading method for improving utility of operator
CN112188503B (en) Dynamic multichannel access method based on deep reinforcement learning and applied to cellular network
Lu et al. A cross-layer resource allocation scheme for ICIC in LTE-Advanced
CN110856268B (en) Dynamic multichannel access method for wireless network
Zhang et al. A novel user pairing in downlink non-orthogonal multiple access
CN109412661B (en) User clustering method under large-scale MIMO system
CN110167176A (en) A kind of wireless network resource distribution method based on distributed machines study
CN105873214A (en) Resource allocation method of D2D communication system based on genetic algorithm
CN104254130A (en) Method, device and system for allocating D2D (Device-to-Device) user link and cellular user shared resources
Gao et al. Energy-efficient resource block assignment and power control for underlay device-to-device communications in multi-cell networks
Perlaza et al. On the base station selection and base station sharing in self-configuring networks
Tian et al. Hierarchical federated learning with adaptive clustering on non-IID data
CN108282888B (en) D2D resource allocation method based on improved fuzzy clustering
CN114401491B (en) Resource allocation method and device in device-to-device communication
CN113055860A (en) D2D many-to-many resource allocation method in cellular network
CN108601083B (en) Resource management method based on non-cooperative game in D2D communication
CN112367644B (en) D2D-based system throughput optimization method in wireless cache network
Chen et al. User association in cache-enabled ultra dense network with JT CoMP
Niu et al. Clustered small base stations for cache-enabled wireless networks
Feng et al. Random caching design for multi-user multi-antenna HetNets with interference nulling
CN113873525A (en) Task unloading method and terminal for ultra-dense edge computing network

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
GR01 Patent grant
GR01 Patent grant