CN106102145B - It is a kind of list honeycomb under D2D communicate energy consumption optimization method - Google Patents
It is a kind of list honeycomb under D2D communicate energy consumption optimization method Download PDFInfo
- Publication number
- CN106102145B CN106102145B CN201610399993.3A CN201610399993A CN106102145B CN 106102145 B CN106102145 B CN 106102145B CN 201610399993 A CN201610399993 A CN 201610399993A CN 106102145 B CN106102145 B CN 106102145B
- Authority
- CN
- China
- Prior art keywords
- link
- transmission link
- transmission
- time
- matrix
- 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.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
-
- 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/0473—Wireless resource allocation based on the type of the allocated resource the resource being transmission power
-
- 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/53—Allocation or scheduling criteria for wireless resources based on regulatory allocation policies
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The energy consumption optimization method that D2D is communicated under a kind of single honeycomb of the present invention, propose a kind of D2D user resources allocation strategy based on bipartite graph Optimum Matching, under the premise of being no more than power system capacity, select the suitable time, suitable cellular link and D2D transmission link is selected to match, so that system energy consumption optimizes；It is shown experimentally that, for the optimal distribution strategy based on Hungary Algorithm compares maximum power transfer, energy loss can be reduced 40%, and with the increase of number of users, energy conservation is more obvious；Further, optimal distribution strategy distributes with such as distribution recently of some common allocation strategies based on distance, farthest, is randomly assigned to compare, energy consumption be also it is minimum in various allocation strategies, can replace traditional maximum power transfer scheme and carry out the scheme of resource allocation based on distance.
Description
Technical field
The invention belongs to wireless communication field, it is related to the energy consumption optimization method that D2D is communicated under a kind of single honeycomb.
Background technique
D2D(terminal direct connection DEVICE TO DEVICE) key technology one of of the communication as next generation wireless communication, energy
Higher transmission rate is enough provided, throughput of system is increased, improves spectrum utilization efficiency, mitigates cellular base station burden, enhancing system
The advantages that stability of uniting.
The resource allocation problem of the energy consumption problem and D2D of D2D communication is closely related, the energy loss difference under difference distribution
It is very remote.A set of allocation criteria is provided for resource allocation based on the resource allocation policy of distance, can satisfy phone user and D2D
The transmission demand of user, but will cause biggish energy dissipation.If can also be expired using simple maximum power transfer strategy
The transmission demand of sufficient phone user and D2D user equally will also result in biggish energy dissipation.
In single cellular system, the interference of honeycomb interior be mainly derived from coexisted in honeycomb other with frequency terminal equipment
Communication, so interference must could improve the performance of system by optimization as far as possible.Although and maximum power transfer strategy can be with
Meet each user and complete data transmission, but co-channel interference does not consider, so as to cause biggish interference, causes energy unrestrained
Take.And a set of resource allocation policy that the Resource Allocation Formula based on distance provides not is optimal resource allocation, final
The energy loss arrived is certainly nor optimal.
An optimal resource allocation is certainly existed in D2D resource allocation, this distribution can be in control co-channel interference
Under the premise of, the energy consumption of the system made optimizes.And in the energy loss of terminal device, it sends energy and is important one
Point.Consider Shannon's theorems, linearly increasing with transmission rate, sending power is to be exponentially increased.The speed given for one
Rate demand, with the increase of transmission rate, the transmission time needed can become smaller, but the energy loss transmitted still will increase,
So needing to reduce transmission rate to reduce energy loss.But with the reduction of transmission rate, the transmission time that needs
Can be elongated, the energy loss of circuit will increase.Therefore, there is a beneficial balances between the two, this balance can
It is minimized with guaranteeing under the premise of success communication, to make in each equipment the gross energy of system to be lost.
Summary of the invention
In order to solve above-mentioned two problems, the energy consumption communicated the purpose of the present invention is to provide D2D under a kind of single honeycomb is excellent
Change method finds out the power consumption values of different links first, finds the beneficial branches between transmission rate and single-link energy loss, should
Under the premise of balance can guarantee each equipment success communication in single-link, keep single-link energy consumption minimized.
The energy consumption optimization method that D2D is communicated under a kind of single honeycomb of the present invention, includes the following steps:
In step 1, D2D communication system, be known as cellular terminal CUE with the terminal of base station communication, by D2D technology directly with
The terminal of other terminals communication, referred to as D2D terminal, it is assumed that the D2D biography there is number less than cellular link quantity in systems
Transmission link, CUE and D2D terminal are randomly present in any position in honeycomb, and D2D transmission link shares the upper line frequency of cellular link
Spectrum resource, and every D2D transmission link at most only shares the uplink frequency spectrum resource of a cellular link, CUE is to pass through TDMA
Mode send data to base station, since D2D transmission link is less than cellular link number, some inevitable cellular link has D2D
Transmission link pairing, and another part cellular link does not have the pairing of D2D transmission link；
Step 2 describes the resource allocation in single honeycomb with bipartite graph, i.e.,A cellular link andA D2D transmission link
Optimum Matching is done, further, the bipartite graph of expansion is constructed, is added in D2D link setA virtual D2D chain
Road, i.e.,Cellular link andD2D transmission link, shouldD2D transmission link includesThe true D2D transmission link of item
WithThe virtual D2D transmission link of item；It is assumed thatIt isArticle cellular uplink andD2D transmission link
With clock synchronizationArticle cellular uplink andThe total energy consumption of D2D transmission link, wherein whenD2D transmission link is
When true D2D transmission link
WhereinIt isThe transmission power of cellular uplink transmission link, i.e.,
It isThe transmission power of D2D link, i.e.,
Wherein,It isArticle cellular uplink andThe time of D2D transmission link pairing,It is power amplification
The energy conversion efficiency of device,Be circuit power,It is idle power, w is channel width,It isA phone user's hair
The rate requirement of data is sent,It isD2D transmission link data sender sends the rate requirement of data,To be
The mean power of system white Gaussian noise,It isThe channel of D2D transmission link data sender to data receiver increase
Benefit,It isA phone user to base station channel gain,It isD2D transmission link data sender is to base station
Channel gain,It isA phone user is toThe channel gain of D2D transmission link data receiver；
WhenWhen D2D transmission link is not true D2D transmission link
The wherein optimal time of each of the linksMake for what is obtained by searchIt is worth the smallest time；
Step 3 usesMatrixTo indicate this bipartite graph expanded, elementIndicate theA cellular uplink
Link andOptimal total energy consumption when a D2D transmission link shared resource,
DefinitionMatrix, element, indicate the optimal time of each link；
With0-1 matrixIndicate the optimum allocation under this system, elementIndicate theCellular uplink
Link andThe pairing of D2D transmission link, conversely,Indicate theArticle cellular uplink andD2D chain
Road is unpaired, then the total energy consumption of systemIt indicates are as follows:
Here Optimal matrixIt can be acquired by Hungary Algorithm；
Step 4, when by step 3 find optimum allocation when, since the time of each of the links is all optimal, but also not
It can guarantee the normalized time and no more than 1, if total time is greater than 1, data biography cannot be completed by certainly existing a part of user
Defeated task, when there are such situations, it is necessary to be passed by reducing the call duration time of certain link with the data for meeting each user
Defeated requirement, in line with the principle that system energy consumption optimizes, when the case where total time being greater than 1 occur, it is necessary to find those and reduce phases
Increase least link with time energy consumption, reduces system total time by reducing the data transmission period of these links.
The step 4 is specific as follows:
Each communication link parameter of step 41, input system: theA phone user sends the rate requirement of data, the
D2D transmission link data sender sends the rate requirement of data, theD2D transmission link data sender is to data
The channel gain of recipient, theChannel gain of a phone user to base station, theD2D transmission link data hair
The side of sending arrives the channel gain of base station, theA phone user is toThe channel gain of D2D transmission link data receiver, the mean power of system white Gaussian noise, the energy conversion efficiency of power amplifier, circuit power, idle function
Rate, system bandwidth w, phone user's number n, D2D chain number m, time step；
Step 42 finds out optimal weights matrix and corresponding time matrix, and optimal weights matrix is the Two-Dimensional Moment in step 3
Battle array, corresponding time matrix is matrixThe corresponding optimal time of middle each of the linksThe matrix of composition, i.e. matrix；
Step 43 finds out optimum allocation and system optimal total energy consumption according to Hungary Algorithm, optimum allocation matrix is
0-1 matrix；
Step 44 the sum of judges each cellular link optimal timeWhether 1 is greater than, if so, 45 are entered step,
If it is not, the optimum allocation that then step 43 acquiresThe condition for meeting each equipment communication, exports optimum allocation at this time, this
When distribution be exactly can enable the system to consumption optimize distribution；
Step 45 is found in all links and reduces same time, the least link of energy consumption increasing degree calculates, whereinIndicate the row for the link that searching obtains,Indicate the column of this link,
Update matrixAnd matrixEven,；
Step 46, using Hungary Algorithm to updated matrixIt solves, finds out optimum allocation at this timeAt this time
System optimal total energy consumption, return step 44.
The invention proposes a kind of D2D user resources allocation strategy based on bipartite graph Optimum Matching is being no more than system
Under the premise of capacity, the suitable time is selected, selects suitable cellular link and D2D transmission link to match, so that system energy consumption
It optimizes.It is shown experimentally that, for the optimal distribution strategy based on Hungary Algorithm compares maximum power transfer, energy loss
It can be reduced 40%, and with the increase of number of users, energy conservation is more obvious；Further, optimal distribution strategy and some common
Such as distribution recently of allocation strategy based on distance farthest distributes, is randomly assigned to compare, and energy consumption is also minimum in various allocation strategies
, it can replace traditional maximum power transfer scheme and based on apart from the scheme for carrying out resource allocation.
Detailed description of the invention
Fig. 1 is the system scenarios schematic diagram for the terminal device that surrounding is served in a base station；
Fig. 2 is the bipartite graph of cellular network D2D resource allocation in the present invention；
Fig. 3 is the bipartite graph that cellular network D2D resource allocation is expanded in the present invention；
Fig. 4 is flow diagram of the invention.
The present invention is further described below in conjunction with the drawings and specific embodiments.
Specific embodiment
As shown in Figure 1, the terminal device of surrounding is served in a base station, wherein terminal is divided to two classes, and one kind is logical with base station
The terminal of letter, i.e. cellular terminal CUE, another kind of is the terminal directly communicated with other terminals by D2D technology, i.e. D2D terminal.
The bandwidth allocation of system gives all cellular terminals (CUE), it is assumed that there is numbers less than cellular link quantity in systems
D2D transmission link, cellular terminal and D2D terminal are randomly present in any position in honeycomb, and D2D transmission link shares honeycomb chain
The uplink frequency spectrum resource on road, and every D2D transmission link at most only shares the uplink frequency spectrum resource of a cellular link, honeycomb is whole
End is all to send data to base station by way of TDMA, since D2D transmission link number is less than cellular link number, is necessarily had
A part of cellular link has the pairing of D2D transmission link, and another part cellular link does not have the pairing of D2D transmission link.
Since single cellular sharing frequency spectrum resource exists only between cellular link and D2D transmission link, then single honeycomb
In resource allocation can be described with bipartite graph, i.e.,A cellular link andA D2D transmission link does Optimum Matching, such as Fig. 2
It is shown, it is added in D2D link setA virtual D2D transmission link, as shown in figure 3, i.e.A cellular link and
A D2D transmission link, shouldA D2D transmission link includesA true D2D transmission link andA virtual D2D is passed
Transmission link；
It is assumed thatIt isArticle cellular uplink transmission link andArticle D2D transmission link is with clock synchronization theHoneycomb
Uplink link andThe total energy consumption of D2D transmission link, wherein whenD2D transmission link is that true D2D is passed
When transmission link
WhereinIt isThe transmission power of cellular uplink transmission link, i.e.,
It isThe transmission power of D2D link, i.e.,
Wherein,It isArticle cellular uplink andThe time of D2D transmission link pairing,It is power amplification
The energy conversion efficiency of device,Be circuit power,It is idle power, w is channel width,It isA phone user's hair
The rate requirement of data is sent,It isD2D transmission link data sender sends the rate requirement of data,To be
The mean power of system white Gaussian noise,It isThe channel of D2D transmission link data sender to data receiver increase
Benefit,It isA phone user to base station channel gain,It isD2D transmission link data sender is to base station
Channel gain,It isA phone user is toThe channel gain of D2D transmission link data receiver；
WhenWhen D2D transmission link is not true D2D transmission link
The wherein optimal time of each of the linksMake for what is obtained by searchIt is worth the smallest time；
UsingMatrixCome indicate this expand bipartite graph, whereinIn each element respectively indicate each link
Optimal total energy consumption, i.e. elementIndicate theA cellular uplink andWhen a D2D transmission link shared resource most
Excellent total energy consumption, has:
DefinitionMatrix, element, indicate the optimal time of each link；
With0-1 matrixIndicate the optimum allocation under this system, elementIndicate theCellular uplink
Link andThe pairing of D2D transmission link, conversely,Indicate theArticle cellular uplink andD2D chain
Road is unpaired, then the total energy consumption of systemIt indicates are as follows:
Here Optimal matrixIt can be acquired by Hungary Algorithm；
When finding optimum allocation, since the time of each of the links is all optimal, but can't guarantee normalized
Time and be not more than 1, if total time be greater than 1, certainly exist a part of user cannot complete data transmission task, work as presence
Such situation, it is necessary to by reducing the call duration time of certain link to meet the data transportation requirements of each user；In line with system
The principle that energy consumption optimizes, when there is the case where total time being greater than 1, it is necessary to find those and reduce the increases of same time energy consumption most
Few link reduces system total time by reducing the data transmission period of these links.
The energy consumption optimization method that D2D is communicated under a kind of single honeycomb of the present invention, includes the following steps:
In step 1, D2D communication system, be known as cellular terminal CUE with the terminal of base station communication, by D2D technology directly with
The terminal of other terminals communication, referred to as D2D terminal, it is assumed that the D2D biography there is number less than cellular link quantity in systems
Transmission link, CUE and D2D terminal are randomly present in any position in honeycomb, and D2D transmission link shares the upper line frequency of cellular link
Spectrum resource, and every D2D transmission link at most only shares the uplink frequency spectrum resource of a cellular link, CUE is to pass through TDMA
Mode send data to base station, since D2D transmission link is less than cellular link number, some inevitable cellular link has D2D
Transmission link pairing, and another part cellular link does not have the pairing of D2D transmission link；
Step 2 describes the resource allocation in single honeycomb with bipartite graph, i.e.,A cellular link andA D2D transmission link
Optimum Matching is done, further, the bipartite graph of expansion is constructed, is added in D2D link setA virtual D2D chain
Road, i.e.,Cellular link andD2D transmission link, shouldD2D transmission link includesThe true D2D transmission link of item
WithThe virtual D2D transmission link of item；It is assumed thatIt isArticle cellular uplink andD2D transmission link
With clock synchronizationArticle cellular uplink andThe total energy consumption of D2D transmission link, wherein whenD2D transmission link is
When true D2D transmission link
WhereinIt isThe transmission power of cellular uplink transmission link, i.e.,
It isThe transmission power of D2D link, i.e.,
Wherein,It isArticle cellular uplink andThe time of D2D transmission link pairing,It is power amplification
The energy conversion efficiency of device,Be circuit power,It is idle power, w is channel width,It isA phone user's hair
The rate requirement of data is sent,It isD2D transmission link data sender sends the rate requirement of data,To be
The mean power of system white Gaussian noise,It isThe channel of D2D transmission link data sender to data receiver increase
Benefit,It isA phone user to base station channel gain,It isD2D transmission link data sender is to base station
Channel gain,It isA phone user is toThe channel gain of D2D transmission link data receiver；
WhenWhen D2D transmission link is not true D2D transmission link
The wherein optimal time of each of the linksMake for what is obtained by searchIt is worth the smallest time；
Step 3 usesMatrixTo indicate this bipartite graph expanded, elementIndicate theA cellular uplink
Link andOptimal total energy consumption when a D2D transmission link shared resource,
DefinitionMatrix, element, indicate the optimal time of each link；
With0-1 matrixIndicate the optimum allocation under this system, elementIndicate theCellular uplink
Link andThe pairing of D2D transmission link, conversely,Indicate theArticle cellular uplink andD2D chain
Road is unpaired, then the total energy consumption of systemIt indicates are as follows:
Here Optimal matrixIt can be acquired by Hungary Algorithm；
Step 4, as shown in figure 4, when by step 3 find optimum allocation when, since the time of each of the links is all optimal
, but can't guarantee the normalized time and be not more than 1, if total time, greater than 1, certainly existing a part of user cannot
The completing data transmission of the task, when there are such situations, it is necessary to by reducing the call duration time of certain link to meet each use
The data transportation requirements at family, in line with the principle that system energy consumption optimizes, when the case where total time being greater than 1 occur, it is necessary to find
Those reduce same time energy consumption and increase least link, total to reduce system by reducing the data transmission period of these links
Time specifically comprises the following steps:
Each communication link parameter of step 41, input system: theA phone user sends the rate requirement of data, the
D2D transmission link data sender sends the rate requirement of data, theD2D transmission link data sender is to data
The channel gain of recipient, theChannel gain of a phone user to base station, theD2D transmission link data hair
The side of sending arrives the channel gain of base station, theA phone user is toThe channel gain of D2D transmission link data receiver, the mean power of system white Gaussian noise, the energy conversion efficiency of power amplifier, circuit power, idle function
Rate, system bandwidth w, phone user's number n, D2D chain number m, time step；
Step 42 finds out optimal weights matrix and corresponding time matrix, and optimal weights matrix is the Two-Dimensional Moment in step 3
Battle array, corresponding time matrix is matrixThe corresponding optimal time of middle each of the linksThe matrix of composition, i.e. matrix；
Step 43 finds out optimum allocation and system optimal total energy consumption according to Hungary Algorithm, optimum allocation matrix is
0-1 matrix；
Step 44 the sum of judges each cellular link optimal timeWhether 1 is greater than, if so, 45 are entered step,
If it is not, the optimum allocation that then step 43 acquiresThe condition for meeting each equipment communication, exports optimum allocation at this time, this
When distribution be exactly can enable the system to consumption optimize distribution；
Step 45 is found in all links and reduces same time, the least link of energy consumption increasing degree calculates, whereinIndicate the row for the link that searching obtains,Indicate the column of this link,
Update matrixAnd matrixEven,；
Step 46, using Hungary Algorithm to updated matrixIt solves, finds out optimum allocation at this timeAt this time
System optimal total energy consumption, return step 44.
The foregoing is merely preferable implementation use-cases of the invention, are not intended to limit the scope of the present invention.It is all
Within the spirit and principles in the present invention, made any modification, equivalent replacement and improvement etc., should be included in of the invention
Within protection scope.
Claims (1)
1. the energy consumption optimization method that D2D is communicated under a kind of list honeycomb, it is characterised in that include the following steps:
In step 1, D2D communication system, be known as cellular terminal CUE with the terminal of base station communication, by D2D technology directly and other
The terminal of terminal communication, referred to as D2D terminal, it is assumed that there is the D2D chains that number is less than cellular link quantity in systems
Road, CUE and D2D terminal are randomly present in any position in honeycomb, and D2D transmission link shares the uplink spectrum money of cellular link
Source, and every D2D transmission link at most only shares the uplink frequency spectrum resource of a cellular link, CUE is the side by TDMA
Formula sends data to base station, and since D2D transmission link is less than cellular link number, some inevitable cellular link has D2D transmission
Link pairing, and another part cellular link does not have the pairing of D2D transmission link；
Step 2 describes the resource allocation in single honeycomb with bipartite graph, i.e. n cellular link and m D2D transmission link do optimal
Matching, further, constructs the bipartite graph of expansion, and n-m virtual D2D transmission links, i.e. n item are added in D2D link set
Cellular link and n D2D transmission link, the n D2D transmission link include that the true D2D transmission link of m item and n-m item are virtual
D2D transmission link；It is assumed that Eij(tij) it is that i-th cellular uplink and j-th strip D2D transmission link match i-th honeycomb of clock synchronization
The total energy consumption of uplink and j-th strip D2D transmission link, wherein when j-th strip D2D transmission link is true D2D transmission link
When
WhereinFor the transmission power of i-th cellular uplink transmission link, i.e.,
For the transmission power of j-th strip D2D link, i.e.,
Wherein, tijFor the time that i-th cellular uplink and j-th strip D2D transmission link match, θ is the energy of power amplifier
Measure transfer efficiency, pαIt is circuit power, pβIt is idle power, w is channel width,The speed of data is sent for i-th of phone user
Rate requirement,The rate requirement of data, σ are sent for j-th strip D2D transmission link data sender2For system white Gaussian noise
Mean power,For the channel gain of j-th strip D2D transmission link data sender to data receiver,It is i-th of honeycomb
User to base station channel gain,For the channel gain of j-th strip D2D transmission link data sender to base station,It is i-th
Channel gain of a phone user to j-th strip D2D transmission link data receiver；
When j-th strip D2D transmission link is not true D2D transmission link
The wherein optimal time of each of the linksMake E for what is obtained by searchij(tij) the smallest time t of valueij；
Step 3 indicates this bipartite graph expanded, element D using n × n matrix DijIndicate i-th of cellular uplink and
Optimal total energy consumption when j D2D transmission link shared resource,
Define the matrix T of n × n, elementIndicate the optimal time of each link；
The optimum allocation under this system, element Z are indicated with the 0-1 matrix Z of n × nij=1 indicate i-th cellular uplink and
J-th strip D2D transmission link pairing, conversely, Zij=0 indicates that i-th cellular uplink and j-th strip D2D transmission link are unpaired,
The then total energy consumption E of systemtotalIt indicates are as follows:
Here Optimal matrix Z is acquired by Hungary Algorithm；
Step 4, when by step 3 find optimum allocation when, since the time of each of the links is all optimal, but can't protect
It demonstrate,proves the normalized time and no more than 1, if total time is greater than 1, data transmission cannot be completed by certainly existing a part of user
Task, when there are such situations, it is necessary to be wanted by reducing the call duration time of certain link with the data transmission for meeting each user
It asks, in line with the principle that system energy consumption optimizes, when there is total time greater than 1 the case where, it is necessary to when finding those and reducing identical
Between energy consumption increase least link, reduce system total time by reducing the data transmission period of these links, it is specific to walk
It is rapid as follows:
Each communication link parameter of step 41, input system: i-th of phone user sends the rate requirement of dataJ-th strip D2D is passed
The rate requirement of transmission link data sender transmission dataJ-th strip D2D transmission link data sender is to data receiver's
Channel gainChannel gain of i-th of phone user to base stationJ-th strip D2D transmission link data sender is to base
The channel gain stoodChannel gain of i-th of phone user to j-th strip D2D transmission link data receiverSystem
The mean power σ of white Gaussian noise2, energy conversion efficiency θ, the circuit power p of power amplifierα, idle power pβ, system band
Wide w, phone user's number n, D2D chain number m, time step δ；
Step 42 finds out optimal weights matrix and corresponding time matrix, and optimal weights matrix is the two-dimensional matrix D in step 3,
Corresponding time matrix is the corresponding optimal time of each of the links in matrix DThe matrix of composition, i.e. matrix T；
Step 43 finds out optimum allocation and system optimal total energy consumption E according to Hungary Algorithmtotal, optimum allocation matrix, that is, 0-1 square
Battle array Z；
Step 44 the sum of judges each cellular link optimal timeWhether 1 is greater than, if so, 45 are entered step, if not
It is that the optimum allocation Z that then step 43 acquires meets the condition of each equipment communication, exports optimum allocation Z at this time, point at this time
With the distribution that can exactly enable the system to consumption optimization；
Step 45 is found in all links and reduces same time, the least link of energy consumption increasing degree calculatesWherein l indicates to find the row of obtained link, and r indicates the column of this link, more
New matrix D and matrix T, even
Step 46 solves updated matrix D using Hungary Algorithm, finds out optimum allocation Z at this time and system at this time
Optimal total energy consumption Etotal, return step 44.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610399993.3A CN106102145B (en) | 2016-06-08 | 2016-06-08 | It is a kind of list honeycomb under D2D communicate energy consumption optimization method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610399993.3A CN106102145B (en) | 2016-06-08 | 2016-06-08 | It is a kind of list honeycomb under D2D communicate energy consumption optimization method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106102145A CN106102145A (en) | 2016-11-09 |
| CN106102145B true CN106102145B (en) | 2019-08-13 |
Family
ID=57228100
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610399993.3A Expired - Fee Related CN106102145B (en) | 2016-06-08 | 2016-06-08 | It is a kind of list honeycomb under D2D communicate energy consumption optimization method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106102145B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107347187B (en) * | 2017-06-16 | 2020-01-07 | 厦门大学 | Energy consumption optimization method for D2D link under non-full-time sharing condition |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103249007A (en) * | 2013-05-24 | 2013-08-14 | 北京邮电大学 | Method for establishing D2D multicast communication and allocating wireless source thereof in IMT-A system |
| CN103533529A (en) * | 2013-10-15 | 2014-01-22 | 北京邮电大学 | Resource reuse method and system for improving energy efficiency of D2D (device-to-device) system |
| CN103796317A (en) * | 2013-12-06 | 2014-05-14 | 南京邮电大学 | Device-to-device relay communication-based resource allocation method |
| CN104768213A (en) * | 2014-10-16 | 2015-07-08 | 浙江工业大学 | Energy efficiency optimization transmitting power control method with quality-of-service guarantee in D2D communication |
| CN105451322A (en) * | 2015-12-03 | 2016-03-30 | 南京邮电大学 | Channel allocation and power control method based on QoS in D2D network |
-
2016
- 2016-06-08 CN CN201610399993.3A patent/CN106102145B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103249007A (en) * | 2013-05-24 | 2013-08-14 | 北京邮电大学 | Method for establishing D2D multicast communication and allocating wireless source thereof in IMT-A system |
| CN103533529A (en) * | 2013-10-15 | 2014-01-22 | 北京邮电大学 | Resource reuse method and system for improving energy efficiency of D2D (device-to-device) system |
| CN103796317A (en) * | 2013-12-06 | 2014-05-14 | 南京邮电大学 | Device-to-device relay communication-based resource allocation method |
| CN104768213A (en) * | 2014-10-16 | 2015-07-08 | 浙江工业大学 | Energy efficiency optimization transmitting power control method with quality-of-service guarantee in D2D communication |
| CN105451322A (en) * | 2015-12-03 | 2016-03-30 | 南京邮电大学 | Channel allocation and power control method based on QoS in D2D network |
Non-Patent Citations (2)
| Title |
|---|
| 《D2D多播场景下面向节能的资源分配机制》;王元，赵季红，唐睿，曲桦，董姣姣;《西安电子科技大学学报》;20160519;全文 |
| 《一种LTE网络D2D通信的干扰控制方案》;王琪;《无线电工程》;20150929;全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106102145A (en) | 2016-11-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhou et al. | Energy-efficient resource allocation for energy harvesting-based cognitive machine-to-machine communications | |
| Zhang et al. | Load balancing for 5G ultra-dense networks using device-to-device communications | |
| Zheng et al. | Joint resource allocation with weighted max-min fairness for NOMA-enabled V2X communications | |
| Xiao et al. | Power allocation with energy efficiency optimization in cellular D2D-based V2X communication network | |
| CN103997740B (en) | Cognitive-Cooperation network association resource allocation methods based on optimization utility | |
| Choi et al. | Distributed transmit power control for maximizing end-to-end throughput in wireless multi-hop networks | |
| Ahmed et al. | Optimal stochastic power control for energy harvesting systems with delay constraints | |
| CN105517134A (en) | Heterogeneous convergence network joint user correlation and power distribution method supporting safe information transmission | |
| CN110149127A (en) | A kind of D2D communication system precoding vector optimization method based on NOMA technology | |
| Budhiraja et al. | Energy-delay tradeoff scheme for NOMA-based D2D groups with WPCNs | |
| He et al. | Resource allocation schemes based on coalition games for vehicular communications | |
| CN107172706A (en) | It is a kind of to be distributed and Poewr control method based on the combined wireless resource that D2D communicates | |
| CN104822170B (en) | A kind of cooperating relay system of selection based on node type | |
| CN106686679A (en) | Multihop D2D route hop count limiting method based on energy efficiency in content center network | |
| Jang et al. | Resource allocation and power control in cooperative small cell networks with backhaul constraint | |
| Sharma et al. | Coalition game-based strategy for resource allocation and transmit power control in D2D communication | |
| CN106102145B (en) | It is a kind of list honeycomb under D2D communicate energy consumption optimization method | |
| CN108174448B (en) | Resource allocation method for cellular D2D communication | |
| Alsharoa et al. | Bandwidth and power allocation for two-way relaying in overlay cognitive radio systems | |
| CN107182116A (en) | Interference control method based on power distribution in Full-duplex cellular GSM | |
| Rizk et al. | Energy efficiency of virtual multi‐input, multi‐output based on sensor selection in wireless sensor networks | |
| Kao et al. | Radio resource allocation for D2D-assisted full-duplex cellular networks | |
| Rajoria et al. | Energy efficiency optimization for MM-NOMA heterogeneous network with wireless backhauling and energy harvesting | |
| CN106102146B (en) | A kind of energy consumption optimization method of D2D communication under more honeycombs | |
| CN107105451B (en) | A kind of link scheduling method based on minimum co-channel interference |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190813 |