CN108540964B - Spectrum resource allocation method - Google Patents

Spectrum resource allocation method Download PDF

Info

Publication number
CN108540964B
CN108540964B CN201810305616.8A CN201810305616A CN108540964B CN 108540964 B CN108540964 B CN 108540964B CN 201810305616 A CN201810305616 A CN 201810305616A CN 108540964 B CN108540964 B CN 108540964B
Authority
CN
China
Prior art keywords
user
cellular
users
channel
cellular user
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
CN201810305616.8A
Other languages
Chinese (zh)
Other versions
CN108540964A (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.)
Shenyang Aerospace University
Original Assignee
Shenyang Aerospace University
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 Shenyang Aerospace University filed Critical Shenyang Aerospace University
Priority to CN201810305616.8A priority Critical patent/CN108540964B/en
Publication of CN108540964A publication Critical patent/CN108540964A/en
Application granted granted Critical
Publication of CN108540964B publication Critical patent/CN108540964B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • 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]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/02—Services making use of location information
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/541—Allocation or scheduling criteria for wireless resources based on quality criteria using the level of interference

Landscapes

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

Abstract

The invention discloses a frequency spectrum resource allocation method, belonging to the technical field of wireless network resource allocation, which is applied to the frequency spectrum resource allocation method under the coexistence of heterogeneous communication modes in the downlink direction of a mobile communication network and comprises the following steps: (1) cellular user side spectrum allocation; (2) performing user pairing by using a Hungarian algorithm; (3) D2D user side spectrum resource allocation; the three steps are circulated in sequence until all the spectrum resources are distributed; and through simulation results, compared with the traditional frequency distribution method, the algorithm provided by the invention brings certain gain to the system frequency spectrum efficiency.

Description

Spectrum resource allocation method
Technical Field
The invention relates to a frequency spectrum resource allocation method, and belongs to the technical field of wireless network resource allocation.
Background
With the rapid development of mobile internet services and the great popularity of smart phones, the requirement of people on data transmission capacity is increasing, however, limited resources cannot meet the requirement. Therefore, to improve resource utilization, overall performance of the network, and user experience, a direct-to-Device (D2D) technique based on peer-to-peer direct communication is applied to the fifth generation communication system. The use of the D2D technology can reduce the load of the conventional base station and provide high-speed data service for users in some application scenarios, and can solve the problem of coverage black holes of the system to some extent by using the relay communication capability of the terminal. As one of the key technologies of the fifth generation mobile communication system, the D2D technology has the following advantages: (1) data transmission among D2D users is not transferred by the base station any more, so that transmission delay of the system is reduced, and user experience is improved; (2) because the direct link transmission distance is relatively short, a user can obtain a high transmission rate under a small sending power, and meanwhile, the service time of a battery is prolonged, so that the energy efficiency of system transmission is improved; (3) D2D communication can utilize the frequency spectrum of the existing mobile communication system, so that the utilization rate of the frequency spectrum is improved; (4) due to the characteristic of point-to-point peer-to-peer communication, the D2D technology can realize the framework-free rapid networking, and can still provide service under the condition that the foundation is damaged in the face of natural disasters such as earthquake and fire, thereby improving the robustness of the whole network. However, due to the introduction of the D2D technology, the interference environment of the conventional mobile communication system is more complicated, and therefore, how to find the optimal balance between the system efficiency and the interference is one of the problems to be solved by the resource allocation strategy of the 5G communication system.
At present, many scholars at home and abroad propose solutions aiming at the research of resource allocation strategies under the D2D scene. For example, in the prior art, (1) the resource allocation problem under the coexistence of the conventional cellular user transmission mode and the D2D mode is discussed in terms of power control and spectrum resource sharing modes such as non-orthogonal sharing and orthogonal resource sharing, but the spectrum resource allocation problem of two types of users is not described in detail; (2) a power distribution algorithm based on margin factors is provided to guarantee QoS requirements of users in a cell, a base station compensates SINR reduction of cellular users caused by interference of D2D users through the power margin factors, the D2D users meet the QoS requirements by adjusting transmission power, however, in an actual network, the power margin factors are difficult to select, if the values are too large, the number of cellular users capable of meeting the power margin factors is small, and if the values are too small, the QoS requirements of D2D users are difficult to meet. In order to reduce the interference of cellular users to the D2D user, (3) a base station retransmission interference coordination mechanism is designed, namely, a new receiving mode is introduced on the basis of two traditional receiving modes, so as to improve the reliability of D2D communication in an uplink on the premise of not reducing the power of cellular user equipment, and the minimum interruption probability of D2D users in three modes is taken as the basis of mode selection to respectively process the interference with different strengths; (4) a resource sharing standard with limited D2D communication distance is provided for D2D link-to-cellular user selection, interference of cellular users to D2D users is controlled by keeping the minimum distance between the cellular users and the D2D users, and the quality of D2D communication is improved. However, these methods do not simultaneously achieve the reduction of interference between D2D users and cellular users, and are usually only considered from the perspective of cellular user performance or D2D system user performance, and do not consider fairness sacrifice caused by the algorithm. In order to solve the problems existing in the above algorithm, the problem of fairness among users is considered while maximizing the overall system throughput, the matching and channel allocation problem between D2D users and cellular users is solved by using graph theory and optimization theory, and the user position, channel attenuation condition and interference condition are considered in the proposed algorithm, so as to realize the best compromise among system efficiency, interference and fairness.
Disclosure of Invention
The invention aims to provide a frequency spectrum resource allocation method applied to the coexistence of heterogeneous communication modes in the downlink direction of a mobile communication network;
the purpose of the invention can be realized by the following technical scheme: the algorithm provided by the invention firstly utilizes a greedy algorithm to carry out spectrum resource allocation on the cellular users so as to obtain the maximum system throughput rate, because the spectrum resource allocation result of the cellular users does not cause obvious influence on the interference condition of the D2D user side, otherwise, the spectrum resource allocation result is different; and then carrying out resource occupation one-to-one matching (namely searching for a cellular user and a D2D user pair which carry out signal transmission on the same spectrum resource) on the cellular user and the D2D user based on the useful signal and interference signal transmission paths of the cellular user and the D2D user, and finally carrying out spectrum resource allocation on the D2D user by using a greedy algorithm according to the cellular user resource occupation condition and the pairing condition. In addition, in order to ensure fairness among users, the proposed algorithm preselects the users to be allocated by using a round-robin algorithm so as to prevent the individual users from occupying all resources of the system.
The method comprises the following steps: (1) cellular user side spectrum allocation; (2) performing user pairing by using a Hungarian algorithm; (3) D2D user side spectrum resource allocation; the three steps are circulated in sequence until all the spectrum resources are distributed.
And the step (1) is specifically to allocate frequency spectrum resources to the cellular users by utilizing a greedy algorithm to solve the problem of maximizing the system throughput rate.
The basic flow of the Hungarian algorithm in the step (2) is as follows: a. starting; b. the coefficient matrix subtracts the minimum value and guarantees at least one 0 per column; c. drawing circles on the independent 0 elements and scratching other 0 elements in the same row or column; d. judging whether the number of the independent elements is N or not; e. if the conclusion of step d is positive, proceeding to step f; if the conclusion of the step d is negative, returning to the step c, and then sequentially going downwards; f. obtaining an optimal solution matrix; g. and (6) ending.
The step (3) is specifically related to performing spectrum resource allocation on the D2D user by using a greedy algorithm according to the cellular user resource occupation situation and the pairing situation.
The method uses round-robin algorithm to pre-select the users to be distributed so as to prevent individual users from occupying all resources of the system.
Modeling a resource allocation problem of coexistence of a traditional cellular user and a D2D user; firstly, a system model is provided, and due to the introduction of a D2D mode, an interference environment of a future mobile communication system is more complicated, a conventional cellular user will suffer additional interference from a D2D user (i.e., both the D2D user and the conventional cellular user are located within a system coverage), and a D2D user will suffer interference from a base station or a user, and a study is mainly carried out around a downlink scenario of a mobile communication network, in which an interference source in the system mainly comes from a D2D user transmitting terminal and a base station, and the interference intensity and influence thereof are far greater than those in an uplink scenario, so that the study significance is higher compared with the uplink scenario.
In order to simplify calculation and analysis, the resource allocation problem model is established based on a single base station scene, but the related model and algorithm can be directly applied to a multi-base station scene. Fig. 1 shows a simplified schematic diagram of a scenario considered herein, in which N cellular user equipments are assumed to exist under coverage of a base station, C represents a cellular user set, i.e. C ═ 1, 2.,. N }, M D2D user equipments, and S represents a D2D user set, i.e. S ═ 1, 2.,. M }, in the same communication mode (legacy base station relay transmission mode or D2D communication transmission mode), a downlink spectrum resource can be occupied by only one user, and both a system resource load and a link resource sharing rate are 100%, i.e. a cellular user and a D2D user share all spectrum resources, and the system does not separate to a cellular user or a D2D userAnd allocating the independent shared spectrum resources. The resource allocation problem caused by the introduction of the D2D mode is mainly considered herein, but the user scheduling, channel measurement and reporting problems related to resource allocation are not within the scope of this document. Wherein HB,iRepresenting the useful signal channel power gain between the ith cellular user and the base station; hjRepresenting the useful signal channel power gain of the j-th pair of D2D communication links. gB,jWhich represents the channel power gain of the base station to the interference signal at the jth D2D receiving end. gj,iIndicating the interference signal channel power gain of the jth D2D user transmitting end to the ith cellular user receiving end.
Modeling a resource allocation problem; the D2D mode enables the system spectrum resources to be simultaneously reused by the legacy cellular users and the D2D users, so the optimization problem as shown in formula (1) is established herein to maximize the throughput of the system as a whole.
Figure GDA0002897793060000051
Constraint conditions are as follows:
Figure GDA0002897793060000052
Figure GDA0002897793060000053
Figure GDA0002897793060000054
Figure GDA0002897793060000055
qf*,i·w f*,j1, then ρi,j＝1 (6)
Wherein:
Figure GDA0002897793060000056
Figure GDA0002897793060000057
in the optimization problem, equation (1) is an optimization target, where the first term is throughput of cellular users, the second term is throughput of D2D users, equation (2) is a constraint condition, in order to ensure that resources of one cellular user can only be reused by one pair of D2D users at most, and similarly equation (3) is used to ensure that one D2D user can only share system resources with one cellular user at most. Equation (4) shows the situation that if there is one f, the cellular user occupies the channel resource block, equation (5) is similar to equation (4) and shows the occupation situation (q) of the channel resource block by the D2D userf,iWhen the channel resource is 1, the cellular user i occupies the channel resource; w is af,jWhen 1, D2D user j occupies the channel resource). Formula (6) indicates that if there is one f, q is such thatf*,i＝1,wf*,jThen the cellular user and the D2D user jointly reuse this resource at 1. Rhoi,j、qf,i、wf,jIs a binary number, pi,jIndicating the channel resource multiplexing situation (when rho) of the D2D user j and the cellular user ii,j When 1, D2D user j multiplexes channel resources of cellular user i when ρ i,j0, D2D user j does not multiplex the channel resources of cellular user i), σ2Representing the power of additive white gaussian noise in the channel,
Figure GDA0002897793060000061
and
Figure GDA0002897793060000062
respectively representing the transmission power of the ith cellular user and the transmission power of the jth D2D user transmitting end. However, it is obvious that the optimization problem shown in the formula (1) is a non-convex optimization problem belonging to NP-hard, and an optimal solution cannot be directly obtained, so that a suboptimal solution is proposed by using the hungarian algorithm in the graph theory, and meanwhile, the fairness problem of users in the system is considered.
Observing the formula (1), it can be found that the channel condition and the interference condition of users on corresponding spectrum resources need to be considered simultaneously in the optimized system resource allocation strategy, and because the formula (1) belongs to the NP-hard optimization problem, it is difficult to directly allocate resources to cellular users and D2D users simultaneously, so the algorithm proposed by the present invention allocates spectrum resources to one type of users first, and then allocates spectrum resources to another type of users according to the interference influence relationship between the users, so as to find the best compromise between system throughput and interference.
By analyzing the interference situation of cellular users and D2D users in the downlink scene of the mobile communication network, we find that the cellular users mainly suffer from two kinds of interference from non-mobile base stations and D2D transmitting users, and the interference generated by the D2D transmitting users is closely related to the spectrum resource allocation result of the D2D users; in contrast, the interference suffered by the D2D user from the mobile network base station is mainly limited by channel fading conditions such as interference path loss, and is less related to the spectrum resource occupation condition of the cellular user.
Matching transmission user pairs based on the Hungarian algorithm; the introduction of D2D into the cellular network and the reuse of cellular user resources can cause interference to the cellular network, and the matching of D2D users with cellular users can effectively reduce the interference, so that it becomes especially important to find the optimal reuse partner of cellular users for D2D users with the goal of maximizing the overall performance of the network.
For any cellular user i, when its own shared channel resource, i.e. no D2D user shares the channel resource with it, the maximum throughput of the cellular user can be expressed as:
Figure GDA0002897793060000063
when the jth D2D user shares channel resources with the ith cellular user, i.e., at that time ρi,jThe sum of the maximum throughputs for both D2D and cellular users can be expressed as:
Figure GDA0002897793060000071
to achieve the goal shown in (10) by user pairing, the problem is solved herein based on the Hungarian algorithm. However, the hungarian algorithm is to solve for the minimum value of the objective function, so the solution for the maximum value needs to be converted into the solution for the minimum value, and therefore the target expression (11) equivalent to (10) and used in the hungarian algorithm is obtained by turning over (10).
Figure GDA0002897793060000072
The main idea of the hungarian algorithm is based on the Konig theory, i.e. the independent zero element theory: the maximum number of independent 0 elements in the coefficient matrix is equal to the minimum linear number capable of covering all 0 elements, and the method is used for realizing optimal matching.
In the algorithm provided by the invention, the method considers that the D2D users and the cellular users reuse the same spectrum resource as the assignment problem in the Hungarian algorithm, and mainly considers that N cellular users and M D2D users (N are present (N is the number of the cellular users and M is the number of the D2D users)>M). When the ith cellular user and the jth D2D user match and occupy the same spectrum resource, the matching coefficient on the current spectrum can be expressed as
Figure GDA0002897793060000073
Accordingly, an N-dimensional matching coefficient matrix can be established, and then the coefficient matrix is subjected to linear transformation to obtain a final solution of the assignment problem. Fig. 2 shows the basic flow of utilizing the hungarian algorithm.
The invention has the beneficial effects that:
in order to solve the problem of interference deterioration brought by a D2D communication mode in the downlink direction of a future mobile communication system, a spectrum resource allocation algorithm giving consideration to both system spectrum efficiency and fairness among users is provided based on a classical Hungarian algorithm in a graph theory, and interference introduced by a D2D mode is considered in the spectrum resource allocation problem. By computer Monte Carlo simulation and performance comparison with the traditional greedy algorithm, the algorithm provided by the invention can bring about 3% improvement to the overall throughput of the system. Furthermore, thanks to the user pairing procedure in the proposed algorithm, the interference impact introduced by the D2D mode is minimized, and we find that the proposed algorithm can provide 10.9% and 11.1% user rate and throughput gains for the cellular user side without any substantial impact on the D2D user side.
Drawings
In order to facilitate understanding for those skilled in the art, the present invention will be further described with reference to the accompanying drawings.
Fig. 1 is a schematic diagram of a mobile communication system incorporating a D2D mode according to the present invention;
FIG. 2 is a basic flow of the Hungarian algorithm of the present invention;
FIG. 3 is a schematic diagram of the algorithm flow proposed by the present invention;
FIG. 4 is a flow diagram of the system simulation of the present invention;
FIG. 5 is a diagram illustrating the matching result of the D2D user combination pair according to the present invention;
FIG. 6 is a graph showing a comparison of the cell user rate Cumulative Distribution Function (CDF) performance between the algorithm proposed in the present patent and a conventional greedy algorithm;
FIG. 7 is a comparison of CDF performance for cellular user throughput with the algorithm proposed in the patent of the present invention and a conventional greedy algorithm;
FIG. 8 is a comparison of the CDF performance of D2D user rate under the greedy algorithm proposed in the patent of the present invention;
FIG. 9 is a comparison of the CDF performance of the D2D user throughput under the algorithm proposed in the present patent with a traditional greedy algorithm;
FIG. 10 shows a comparison of the overall throughput CDF performance of the system proposed in the patent of the present invention with that of the traditional greedy algorithm.
Detailed Description
Example 1
In order to verify the performance of the proposed graph theory-based resource allocation algorithm, a computer simulation platform shown in fig. 4 is constructed, and the performance difference between the algorithm proposed herein and the traditional greedy resource allocation method in the aspects of system throughput and user rate is compared in a monte carlo simulation mode, and the specific parameter configuration is shown in table 1.
Table 1 detailed simulation parameter set-up
Figure GDA0002897793060000091
Performance analysis: in order to simplify the selection and pairing process of the D2D user and reduce the influence of the process on the resource allocation performance verification, the simulation selects the D2D link transmitting user randomly from the user set, then selects the D2D link receiving user corresponding to the D2D link transmitting user according to the maximum receiving power criterion, and simultaneously ensures that the D2D link receiving user is within the coverage range of the corresponding D2D transmitting user, or else, the selection and pairing process is performed again. Fig. 5 illustrates an example of D2D user selection and pairing.
Fig. 6 and 7 show cumulative distribution function performance comparisons of cellular user rate and cellular user-side throughput for systems using the algorithm proposed herein versus a traditional greedy algorithm, respectively. From the simulation results, it can be seen that, thanks to the user matching procedure of the algorithm proposed herein, the interference generated by the D2D user side is taken into account in the cellular user spectrum allocation process, and the average values of the cellular user rate and the cellular user side throughput are respectively increased from 2.1062Mbit/s and 187.17Mbit/s to 2.3640Mbit/s and 210.77Mbit/s, thereby providing 10.9% and 11.1% gains for the cellular user and the system, respectively.
Fig. 8 and 9 show cumulative distribution function performance comparisons of D2D user rate and D2D user side throughput for the case of a system using the algorithm proposed herein and a traditional greedy algorithm, respectively. From the simulation results we can see that the mean values of the rate and throughput of D2D users do not change significantly. Although the algorithm herein does not select the user with the best channel conditions for transmission on some resource blocks in order to reduce the interference generated by the D2D user, its impact on the performance of the D2D user is negligible.
Fig. 10 shows a cumulative distribution function performance comparison of the overall throughput (i.e., the sum of cellular user-side and D2D user-side throughput) for the case of a system using the algorithm proposed herein versus a traditional greedy algorithm. From simulation results, the average value of the overall throughput is respectively improved from 785.52Mbit/s to 810.06Mbit/s, so that the overall throughput of the system is divided into 3.0% of gain.
The preferred embodiments of the invention disclosed above are intended to be illustrative only. The preferred embodiments are not intended to be exhaustive or to limit the invention to the precise embodiments disclosed. Obviously, many modifications and variations are possible in light of the above teaching. The embodiments were chosen and described in order to best explain the principles of the invention and the practical application, to thereby enable others skilled in the art to best utilize the invention. The invention is limited only by the claims and their full scope and equivalents.

Claims (1)

1. A method for allocating spectrum resources, comprising the steps of: (1) cellular user side spectrum allocation; (2) performing user pairing by using a Hungarian algorithm; (3) D2D user side spectrum resource allocation; the three steps are circulated in sequence until all the spectrum resources are distributed;
a resource allocation problem model is established based on a single base station scenario, in which N cellular user equipments are assumed to exist under the coverage of a base station, C represents a cellular user set, i.e., C ═ 1, 2.., N }, M D2D user equipments, and S represents a D2D user set, i.e., S ═ 1, 2.., M };
firstly, establishing an optimization problem shown in a formula (1) so as to maximize the overall throughput of the system;
Figure FDA0002897793050000011
constraint conditions are as follows:
Figure FDA0002897793050000012
Figure FDA0002897793050000013
Figure FDA0002897793050000014
Figure FDA0002897793050000015
qf*,i·wf*,j1, then ρi,j＝1 (6)
Wherein:
Figure FDA0002897793050000016
Figure FDA0002897793050000017
HB,irepresenting the useful signal channel power gain between the ith cellular user and the base station; hjRepresents the useful signal channel power gain of the j-th pair of D2D communication links; gB,jRepresenting the channel power gain of the interference signal of the base station to the jth D2D receiving end; gj,iIndicating the interference signal channel power gain of the j < th > D2D user transmitting end to the i < th > cellular user receiving end;
equation (1) is an optimization objective, where the first term is the throughput of cellular users, the second term is the throughput of D2D users, equation (2) is a constraint condition, in order to ensure that the resources of a cellular user can be reused by only one pair of D2D users at most, and similarly equation (3) is used to ensure that one D2D user can use at mostSystem resources can only be shared with one cellular user; equation (4) represents the situation that if there is one f, the cellular user occupies the channel resource block, equation (5) is similar to equation (4) and represents the occupation situation of the D2D user to the channel resource block, qf,iWhen the channel resource is 1, the cellular user i occupies the channel resource; w is af,jWhen the channel resource is 1, the D2D user j occupies the channel resource; formula (6) indicates that if there is one f, q is such thatf*,i＝1,wf*,jThen the cellular user co-multiplexes this resource, p, with the D2D user, 1i,j、qf,i、wf,jIs a binary number, pi,jRepresents the channel resource multiplexing situation of the D2D user j and the cellular user i when rhoi,jWhen 1, D2D user j multiplexes channel resources of cellular user i when ρi,j0, D2D user j does not multiplex the channel resources of cellular user i, σ2Representing the power of additive white gaussian noise in the channel,
Figure FDA0002897793050000021
and
Figure FDA0002897793050000022
respectively representing the transmission power of the ith cellular user and the transmission power of the jth D2D user transmitting end;
the step (1) is to allocate frequency spectrum resources to cellular users based on a formula (9) to obtain a maximum system throughput rate;
for any cellular user i, when the cellular user i shares the channel resource independently, that is, there is no D2D user sharing the channel resource with the cellular user i, the cellular user i may select the spectrum resource based on the formula (9);
Figure FDA0002897793050000023
the matching coefficient matrix established in the step (2) is as follows:
consider that there are N cellular users and M D2D users (N)>M), when the ith cellular user and the jth D2D user match and occupy the same spectrum resource, the matching system on the current spectrumThe number can be expressed as
Figure FDA0002897793050000024
Accordingly: an N-dimensional matching coefficient matrix can be established;
the step (3) is to allocate spectrum resources on the user side of D2D based on the formula (10);
when the jth D2D user shares channel resources with the ith cellular user, i.e., at this time, ρi,j1, D2D user j may select spectrum resources according to equation (10):
Figure FDA0002897793050000025
CN201810305616.8A 2018-04-08 2018-04-08 Spectrum resource allocation method Active CN108540964B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810305616.8A CN108540964B (en) 2018-04-08 2018-04-08 Spectrum resource allocation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810305616.8A CN108540964B (en) 2018-04-08 2018-04-08 Spectrum resource allocation method

Publications (2)

Publication Number Publication Date
CN108540964A CN108540964A (en) 2018-09-14
CN108540964B true CN108540964B (en) 2021-03-12

Family

ID=63482875

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810305616.8A Active CN108540964B (en) 2018-04-08 2018-04-08 Spectrum resource allocation method

Country Status (1)

Country Link
CN (1) CN108540964B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112073136B (en) * 2020-08-25 2021-10-26 华南理工大学 Dual-user cooperative cognitive spectrum sharing method based on nonlinear energy acquisition

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105992358A (en) * 2015-02-11 2016-10-05 ***通信集团公司 Resource distribution method, base station and correlation network element
CN106060872A (en) * 2016-08-18 2016-10-26 哈尔滨工业大学 D2D and cellular network coexisting heuristic proportional fairness scheduling method
CN106231620A (en) * 2016-07-22 2016-12-14 哈尔滨工业大学 In a kind of cellular network, the joint Power of D2D communication controls and the method for Proportional Fair
CN107197423A (en) * 2017-05-26 2017-09-22 国网江苏省电力公司南京供电公司 A kind of D2D multipath resource distribution methods towards capacity

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040230680A1 (en) * 2003-05-16 2004-11-18 Kamal Jain Computer-based techniques providing greedy approaches for facility location and other similar problems

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105992358A (en) * 2015-02-11 2016-10-05 ***通信集团公司 Resource distribution method, base station and correlation network element
CN106231620A (en) * 2016-07-22 2016-12-14 哈尔滨工业大学 In a kind of cellular network, the joint Power of D2D communication controls and the method for Proportional Fair
CN106060872A (en) * 2016-08-18 2016-10-26 哈尔滨工业大学 D2D and cellular network coexisting heuristic proportional fairness scheduling method
CN107197423A (en) * 2017-05-26 2017-09-22 国网江苏省电力公司南京供电公司 A kind of D2D multipath resource distribution methods towards capacity

Also Published As

Publication number Publication date
CN108540964A (en) 2018-09-14

Similar Documents

Publication Publication Date Title
Ding et al. Simple semi-grant-free transmission strategies assisted by non-orthogonal multiple access
Khan et al. Performance analysis of cloud radio access networks with distributed multiple antenna remote radio heads
CN105722236B (en) Resource allocation method for supporting full-duplex D2D communication in cellular network
CN106792451B (en) D2D communication resource optimization method based on multi-population genetic algorithm
CN104902431B (en) A kind of LTE network mid-span cell D2D communication spectrum distribution methods
Zhao et al. A two-stages relay selection and resource allocation joint method for d2d communication system
CN111586646B (en) Resource allocation method for D2D communication combining uplink and downlink channels in cellular network
Tao et al. Radio resource allocation based on greedy algorithm and successive interference cancellation in device-to-device (D2D) communication
AliHemmati et al. Multi-channel resource allocation toward ergodic rate maximization for underlay device-to-device communications
CN104918207B (en) More D2D communication resource allocation methods based on frequency spectrum resource distribution in heterogeneous network
Zhao et al. Gain-aware joint uplink-downlink resource allocation for device-to-device communications
CN106686683B (en) A kind of distribution of D2D power of communications and relay selection method based on network code
Li et al. Fog radio access network: A new wireless backhaul architecture for small cell networks
Chen et al. Dual antenna selection in self-backhauling multiple small cell networks
Modak et al. Multi-cell interference management in in-band D2D communication under LTE-A network
CN108540964B (en) Spectrum resource allocation method
Zhou et al. Train-to-train communication resource allocation scheme for train control system
Shao et al. Locally cooperative traffic‐offloading in multi‐mode small cell networks via potential games
CN107172574B (en) Power distribution method for D2D user to sharing frequency spectrum with cellular user
Kumar et al. An efficient resource allocation scheme in multiple d2d communications
Barri et al. A Mechanism for Improving the Spectral Efficiency in mu-MIMO for 5G and Beyond Networks
Kim et al. Spectrum allocation with power control in LBS based D2d cellular mobile networks
AliHemmati et al. Multi-channel power allocation for device-to-device communication underlaying cellular networks
Yang et al. Energy-efficient boundary-enabled scheduling in the downlink of multi-carrier multi-access heterogeneous network
CN108540265B (en) D2D interference elimination and cooperative forwarding method based on network coding

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