CN106550409A - Compound relaying motivational techniques in coordination downlink communication - Google Patents
Compound relaying motivational techniques in coordination downlink communication Download PDFInfo
- Publication number
- CN106550409A CN106550409A CN201611136983.7A CN201611136983A CN106550409A CN 106550409 A CN106550409 A CN 106550409A CN 201611136983 A CN201611136983 A CN 201611136983A CN 106550409 A CN106550409 A CN 106550409A
- Authority
- CN
- China
- Prior art keywords
- user
- relaying
- enode
- data rate
- enode enb
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
- H04W28/18—Negotiating wireless communication parameters
- H04W28/22—Negotiating communication rate
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- 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
Abstract
The present invention proposes the compound relaying motivational techniques in a kind of coordination downlink communication, for solving the low technical problem of the level of resources utilization present in the relaying return for participating in cooperation and instant method for returning cannot be definitely given present in existing long-term method for returning, realize that step is：Arbitrarily in time slot, enode obtains which with the channel coefficients between user and candidate relay and k-th user；Enode determines the relaying matched with k-th user；Enode calculates the dispatch weight of k-th user；In enode traversal cell, the dispatch weight of whole users, determines purpose user；After DTD, enode updates the Mean Speed of whole users in cell according to improved proportional fair algorithm；In next time slot, above step is repeated.The present invention can give via node and reasonably return, and realize the improvement of system spectral efficiency, life span and relaying energy efficiency.
Description
Technical field
The invention belongs to communication technical field, be related to a kind of relaying motivational techniques, and in particular to one kind will return immediately with
The relaying motivational techniques for combining are returned for a long time, are returned to participating in the via node for cooperating in can be used for coordination downlink communication
Excitation.
Background technology
5G wireless communication systems need efficiently to provide further types of Mobile solution for substantial amounts of smart machine, in order to
Higher data rate is realized on the basis of reducing administration overhead and energy expenditure and preferably covering, collaboration communication will obtain general
All over application.The core concept of collaboration communication is using cooperating between multiple nodes in wireless network, realizing route transmission
It is shared, so as to improve the handling capacity of whole wireless network.Relay the important component part as collaboration communication, including fixed relay
With two class of mobile relay, wherein, the deployment of the latter and select more flexibly, to complicated wireless transmission environments better adaptability.
Mobile device is served as relaying and can be carried out the transfer of data by equipment to equipment D2D links.However, can produce due to serving as relaying
Energy expenditure, the use time and battery life of equipment will be affected.Particularly, the mobile station generally presence for serving as relaying is logical
Letter demand.If the node to participating in cooperation lacks rational return, will be unable to set up and maintain cooperation relation.Therefore, it is good
Motivational techniques are significant in collaboration communication.
Existing relaying motivational techniques can be divided into two classes of return immediately and long-term return.In instant method for returning, in
Deterministic return is obtained after node, return is only participated in the behavior decision of cooperation by node, and further, return is to participating in immediately
The excitation of the node of cooperation is embodied in the chance distributed certain communication resource for which immediately and give its transmission its data.Its
In, LI Zhao and CAI Shenjin.Relay Incentive in Cooperative Communication by
Exploiting Link Imbalance [J/OL] .Journal of Xidian University, 2016 (06), propose one
Plant based on the unbalanced relaying motivational techniques of link, by the transmission power for adjusting via node, to bottleneck in double bounce transmission
Position and size are controlled, so as to using the data rate difference of two-hop link as relaying return.The method is set up in
It is secondary penetrate power adjustable on the basis of, on the other hand on the one hand increased the complexity of control, as the transmission power for relaying is deposited
In the upper limit, when adjustment repeat transmitted power cannot ensure that the first jump data rate is jumped better than second, the motivational techniques fail.
SIMEONE O,STANOJEV I,SAVAZZI S,et al.Spectrum leasing to cooperating
secondary ad hoc networks[J].IEEE Journal of Selected Areas in
Communications,2008,26(1):203-213, proposes for cooperative cognitive radio net a kind of based on time slot division
3 stage cooperation transmission methods, authorized user broadcasted in the 1st stage, and cognitive user carries out relay forwarding in the 2nd stage,
Whole authorized bandwidths transmit its data for cognitive user as return in the 3rd stage.But, due to the time-varying spy of channel
Property, the method cannot ensure that cognitive user has preferable channel status in the 3rd stage, so as to cause the drop of system transfer rate
It is low.To sum up, using return immediately, via node can obtain deterministic return, but which cannot be ensured when channel condition is preferable
Communication opportunity is obtained, the reduction of communication resource utilization ratio may be caused.
In long-term method for returning, via node is returned with certain probability, and return is by relay node cooperation tribute
The impact of other node states in the size offered and system, further, relays the excitation for obtaining and is mainly reflected in scheduling power
The lifting of weight.Wherein, WEI H Y, and GITLIN R D.Incentive scheduling for cooperative
relay in WWAN/WLAN two-hop-relay network[C]//IEEE Wireless Communications and
Networking Conference(WCNC),New Orleans,2005:1696-1701, base of this article in proportional fair algorithm
On plinth, by increasing cooperative node by the weight of base station scheduling, the return of the user to participating in cooperation is realized.GUEGUEN C,
RACHEDI A,and GUIZANI M.Incentive scheduler algorithm for cooperation and
coverage extension in wireless networks[J].IEEE Transactions on Vehicular
Technology,2013,62(2):797-808 proposes a kind of covering extension mechanism based on excitation, is handled up by considering
Amount, cooperation contribution and credit parameter design dispatching algorithm, make cooperation contribute big mobile station with higher probability by base station scheduling.
However, in above-mentioned long-term method for returning, can relaying obtain returns not only relevant with the cooperation contribution of relaying, also by system
In other user equipmenies channel quality impact, therefore long-term method for returning cannot ensure that relaying is returned with probability 1.
In sum, return immediately can give and relay the return for determining, but not consider the dynamic of channel status, may
Cause the reduction of communication resource utilization ratio；The long-term method for returning adjusted based on dispatch weight can be in the channel of via node
Its communication opportunity is given when condition is preferable, so as to better profit from channel resource, but cannot definitely be given and be participated in cooperation
Relaying return.
The content of the invention
Present invention aims to above-mentioned the deficiencies in the prior art, it is proposed that compound in a kind of coordination downlink communication
Relaying motivational techniques, for solving the relaying return for participating in cooperation cannot be definitely given present in existing long-term method for returning
The technical problem low with the level of resources utilization present in instant method for returning, on the basis for not affecting purpose user's transmission performance
On give via node and reasonably return, to realize system spectral efficiency and life span, and the improvement of relaying energy efficiency.
The technical thought of the present invention is the bottleneck for producing uneven first with link, i.e., due to the randomness of channel, deposit
In the situation that the first hop link speed is jumped more than second, the data rate portion that now the first hop link can be jumped more than second is made
To return immediately, for the transmission of via node its data；It is present in for instant return amount deficiency, excess or bottleneck simultaneously
First jumps the situation for causing immediately return failure, using the long-term return of improved proportional fair algorithm as supplement, further
The dispatch weight of adjustment via node, so as to realizing return immediately and returning the complex incentive for combining for a long time.
According to above-mentioned thinking, the technical scheme that the object of the invention is taken is realized, is comprised the steps：
(1) in any one time slot t, into cell, all user UE send comprising training sequence enode eNB
Signal, user UE are estimated with the channel coefficients between enode eNB to which by the training sequence in signal, and incite somebody to action
The channel coefficient feedback for arriving gives enode eNB；
(2) enode eNB by cell with k-th user UEkCentered on, ρ is the user's UE conducts in the circle of radius
Candidate relay, obtains candidate relay set ΩR, while candidate relay is by itself and k-th user UEkThe channel system obtained during interaction
Number, feeds back to enode eNB；
(3) enode eNB is according to itself and candidate relayBetween channel coefficients, calculate enode eNB to time
Choose afterReachable data rate, obtain the reachable data rate of the first hop linkSimultaneously according to candidate relay
With k-th user UEkBetween channel coefficients, calculate candidate relayTo k-th user UEkReachable data rate, obtain
The reachable data rate of the second hop link
(4) enode eNB calculates the reachable data rate of the first hop linkWith the reachable data of the second hop link
SpeedIn minima, obtain k-th user UEkVia candidate relay UElAssist the data rate for obtainingCount simultaneously
Calculate the reachable data rate of the first hop linkMore than the reachable data rate of the second hop linkPart, obtain candidate
RelayingInstant response rate
(5) enode eNB is according to itself and k-th user UEkBetween channel coefficients, calculate enode eNB and kth
Individual user UEkReachable data rate during direction communication
(6) enode eNB calculates candidate relayConsumed to the t-1 time slot from initial slot t=1
Energy and candidate relayThe ratio of the energy of initial slot t=1 initial times, obtains candidate relayInstant return
Weight
(7) enode eNB is first from candidate relay set ΩRIn, select k-th user UEkObtainable data rateMore than or equal to enode eNB and k-th user UEkReachable data rate during direction communicationAnd return is weighed immediately
WeightSpan for [0, then candidate relay 1) calculates k-th user UEkAssist to obtain via the candidate relay selected
Data rateWith instant response rateWeighted sumFoundation is to the maximum with weighted sum finally,
Obtain and k-th user UEkL-th relaying UE of matchingl, and judge enode eNB to k-th user UE according to the value of lk
Data transfer whether need relaying to assist, if l=0, enode eNB is to k-th user UEkData transfer be not required to
Relay assistance, t-th time slot, k-th user UEkReachable data rate be equal to enode eNB and k-th user UEkDirectly
Connect reachable data rate during letterIf l ≠ 0, enode eNB is to k-th user UEkData transfer need
Relaying is assisted, t-th time slot, k-th user UEkReachable data rate be equal to k-th user UEkVia relaying UElAssistance is obtained
The data rate for obtaining
(8) enode eNB calculates t-th time slot, k-th user UEkReachable data rate arrive with initial slot t=1
K-th user UE till the t-1 time slotkMean data rate ratio, obtain k-th user UEkIn the scheduling of time slot t
Weight wk；
(9) enode eNB travels through the dispatch weight w of whole users in cellk, with dispatch weight wkValue is foundation to the maximum
Determine purpose user UEd；
(10) enode eNB according to the judged result of l values in step (7) to purpose user UEdTransmission data, if l
=0, then enode eNB and purpose user UEdDirection communication, if l ≠ 0, enode eNB is used to purpose by relaying
Family UEdTransmission data；
(11) comparative example fair algorithm is improved, and enode eNB updates cell according to improved proportional fair algorithm
The mean data rate of middle whole user UE, obtains the average of initial slot t=1 all user UE to t-th time slot
According to speed；
(12) in next time slot t+1, repeat step (1)～step (11).
The present invention is compared with the prior art, with following features：
1st, the present invention is due to, during the relaying excitation to coordination downlink communication is realized, producing first with link is uneven
Raw bottleneck, the data rate portion that the first hop link is jumped more than second are returned as instant, for the data transfer of relaying；
Cause the situation that return is failed immediately while being directed to not enough instant return amount, excess or bottleneck and being present in the first jump, adopt and be based on
The long-term return of improved proportional fair algorithm further adjusts the dispatch weight of via node, with prior art as supplement
Compare, compensate for tradition relaying motivational techniques defect --- based on dispatch weight adjust long-term return cannot ensure relay with
Probability 1 is returned, and return immediately does not consider the dynamic of channel status, causes communication resource utilization ratio to reduce.
2nd, the present invention is due to during the relaying excitation to coordination downlink communication is realized, enode eNB is relaying
Immediately response rate and user are used as object function from candidate relay by the data rate weighted sum maximum that relay forwarding is obtained
The relaying matched with user is determined in set, so as to ensure that system spectral efficiency, in maximum, compared with prior art, improves
System spectral efficiency.
3rd, the present invention is as, during the relaying excitation to coordination downlink communication is realized, enode eNB is from candidate
Return weight immediately is introduced when the relaying matched with user is determined in set, the dump energy of user equipment is examined
Consider, the probability of relaying is served as by reducing the less node of dump energy, it is to avoid the excessive energy expenditure of its generation, with existing skill
Art is compared, and improves system time and relaying energy efficiency.
Description of the drawings
Fig. 1 is the structural representation of the communication system that the present invention is used；
Fig. 2 be the present invention realize FB(flow block)；
Fig. 3 is that, as number of users K=20, the system spectral efficiency of the present invention and prior art is with enode and cluster center
The distance between d situations of change analogous diagram；
Fig. 4 is that, as number of users K=15, the system time of the present invention and prior art is with user equipment primary power
The analogous diagram of situation of change.
Specific embodiment
In order that the objects, technical solutions and advantages of the present invention become more apparent, below in conjunction with drawings and Examples pair
The present invention is described in further detail, it will be appreciated that specific embodiment described herein only to explain the present invention, and
It is not used in the restriction present invention.
With reference to Fig. 1, the present invention is using single cell LTE-A downlink communication system.System include an enode eNB and
K user equipment (for sake of simplicity, 6 user equipmenies are only drawn in Fig. 1 to illustrate), configures single antenna.Enode eNB's
Coverage is that, with which as the center of circle, circles of the R for radius, i.e. radius of society are R.The distance of enode eNB and cluster central user
Represented with d.In figure, solid line filled arrows represent cellular communication link, and dotted line filled arrows represent information feedback chain
Road, can obtain its channel coefficients with user by link enode eNB, i.e., h as described in Figures,d、hs,lDeng slightly
Solid line hollow arrow represents D2D communication links.D2D telex network scopes are less, and using cluster distributed model, i.e., D2D user is with ρ
To be uniformly distributed in the circle of radius, the size of ρ is determined by D2D communication ranges.There are multiple clusters in cell (for sake of simplicity, in Fig. 1 only
2 clusters are drawn to illustrate), the UE in cluster not only can be with eNB direction communications, it is also possible to switch to D2D patterns, carry out equipment room
Communication.Ω represents the user's set in cell, has card (Ω)=K, card () to represent the number of element in set.Positioned at same
UE in cluster constitutes set omegaR, haveWith card (ΩR)=KR<K.The distribution of channel resource is based on the thing in LTE-A
Reason Resource Block PRB (Physical resource block), Physical Resource Block PRB are comprising 12 subcarriers and continue one
Individual time slot TsThe combination of resources of (length is 0.5ms), a PRB distribute to a user.In any given time slot, evolution section
Point eNB is communicated with UE by downlink, and other UE in cluster can serve as relaying to strengthen enode eNB to purpose
The data transfer of UE.System adopts double bounce collaboration communication model, via node to use half-duplex operation, forward using decoding and lead to
Cross D2D modes and be sent to purpose user.Channel between UE and enode eNB and UE has frequency-flat decline and block decline
Characteristic, channel parameter in a block (comprising continuous several transmission time slots) keep stable, the change at random between block and block.
Different from fixed relay, the UE for serving as relaying also has the communication requirement of itself, waits evolution in each time slot together with other UE
The scheduling of node eNB.Limited in view of D2D communication ranges, the investigation to candidate relay only need to be carried out in same cluster.
With reference to Fig. 2, the present invention's realizes that step is as follows：
In step 1, cell, all user UE estimate which with the channel coefficients between enode eNB and feed back enode
eNB：
Enode eNB sends the signal comprising training sequence, UE to K UE in cell in any one time slot t
Itself and the channel coefficients between enode eNB are estimated by the training sequence in signal, and is fed back in being encapsulated in acknowledgment packet
Give enode eNB；
Step 2, enode eNB determine k-th user UEkCandidate relay set ΩR, while candidate relay estimates which
With k-th user UEkChannel coefficients, feed back to enode eNB：
(2a) usually, enode eNB by cell with k-th user UEkCentered on, ρ is the use in the circle of radius
Family UE obtains candidate relay set Ω as candidate relayR, the value of ρ is determined by the communication range of user, in this embodiment
In, cluster distributed model is employed, so radiuses of the ρ for cluster, specific implementation process is k-th user UEkPeripherad UE sends
The packet of solicited message is recruited comprising relaying, the packet includes UEkInformation and equipment place cluster mark, receive the request and
Cluster mark identical UE returns relaying acknowledgment packet, becomes candidate relay, so as to obtain candidate relay set ΩR；
(2b) candidate relay is by itself and k-th user UEkThe channel coefficients obtained during interaction, feed back to enode eNB.
Step 3, enode eNB determine and k-th user UEkThe relaying UE of matchinglIf, l=0, enode
ENB and k-th user UEkDirection communication：
(3a) enode eNB is according to itself and candidate relayBetween channel coefficients, calculate enode eNB to time
Choose afterReachable data rate, obtain the reachable data rate of the first hop linkSimultaneously according to candidate relay
With k-th user UEkBetween channel coefficients, calculate candidate relayTo k-th user UEkReachable data rate, obtain
The reachable data rate of the second hop linkComputing formula is：
Wherein,Subscript x represent that enode eNB is sent to k-th user UEkData, z represents enode
ENB is sent to candidate relayData, PRFor relaying transmission power,For enode eNB and candidate relay
Between channel coefficients, the coefficient in two formulasBe due toIt is operated in semiduplex mode, it is impossible to while carrying out the reception of data
And transmission, and candidate relay carries out data receiver and the duration of decoding forwarding stage distribution is equal；
(3b) enode eNB calculates the reachable data rate of the first hop linkWith the reachable data of the second hop link
SpeedIn minima, obtain k-th user UEkVia candidate relayAssist the data rate for obtainingCount simultaneously
Calculate the reachable data rate of the first hop linkMore than the reachable data rate of the second hop linkPart, obtain candidate
RelayingInstant response rateComputing formula is：
(3c) enode eNB is according to itself and k-th user UEkBetween channel coefficients, calculate enode eNB and the
K user UEkReachable data rate during direction communicationComputing formula is：
Wherein, PTFor the transmission power of enode eNB,For the power of additive white Gaussian noise, hs,kUse for k-th
Family UEkWith the channel coefficients between enode eNB；
(3d) enode eNB calculates candidate relayConsumed to the t-1 time slot from initial slot t=1
Energy and candidate relayThe ratio of the energy of initial slot t=1 initial times, obtains candidate relayInstant return
WeightComputing formula is：
Wherein, the instant return weight of candidate relaySpan for [0,1), by candidate relayIt is surplus according to itself
The situation determination of complementary energy, reflects candidate relayPreference to returning excitation types,WithRepresent respectively
Initial slot t=1 initial times energy and it the initial time of time slot t dump energy,It is bigger,It is less,
Show that candidate relay is higher in the dump energy of the initial time of time slot t, therefore its requirement to instant return is relatively low, with being
The increase of system run time,Reduce, causeIncrease, candidate relay would be more inclined to obtain return immediately, when
When, representIt is maximum in the dump energy of the initial time of time slot t, equal to the energy of initial slot t=1 initial times, whenWhen, representIt is minimum in the dump energy of the initial time of time slot t, equal to 0；
(3e) enode eNB is first from candidate relay set ΩRIn, select k-th user UEkObtainable data speed
RateMore than or equal to enode eNB and k-th user UEkReachable data rate during direction communicationAnd return immediately
WeightSpan for [0, then candidate relay 1) calculates k-th user UEkAssist to obtain via the candidate relay selected
The data rate for obtainingWith instant response rateWeighted sumIt is last with weighted sum be to the maximum according to
According to obtaining and k-th user UEkL-th relaying UE of matchingl, and judge enode eNB to k-th user according to the value of l
UEkData transfer whether need relaying to assist, computing formula is as follows：
Above formula withWithWeighted sum it is maximum as object function, so as to ensure system spectral efficiency in higher value,
If l=0, enode eNB and k-th user UEkDirection communication, t-th time slot, k-th user UEkReachable data speed
Rate is equal to enode eNB and k-th user UEkReachable data rate during direction communicationIf l ≠ 0, evolution section
Point eNB is to k-th user UEkData transfer need relaying assist, and with k-th user UEkThe relaying of matching is UEl, the
K-th user UE of t time slotkReachable data rate be equal to k-th user UEkVia relaying UElAssist the data rate for obtaining
Step 4, enode eNB calculate k-th user UEkDispatch weight wk：
Enode eNB calculates t-th time slot, k-th user UEkReachable data rate and initial slot t=1 to the
K-th user UE till t-1 time slotkMean data rate ratio, obtain k-th user UEkWeigh in the scheduling of time slot t
Weight wk, computing formula is：
Wherein RkT () is represented in t-th time slot, k-th user UEkReachable data rate, when enode eNB and kth
Individual user UEkDuring direction communication,When enode eNB adopts cooperation mode to k-th user UEkSend data
When,Expression k-th user UE to the t-1 transmission time slot from initial slot t=1kIt is average
Data rate；
Step 5, enode eNB determine purpose user UEd：
The dispatch weight w of whole users in enode eNB traversal cellsk, with dispatch weight wkValue is to the maximum according to determination
Purpose user UEd；
Step 6, enode eNB and purpose user UEdDirection communication passes through to relay UElTo purpose user UEdTransmission
Data：
Enode eNB is according to the judged result of l values in step (3e) to purpose user UEdTransmission data, if l=0,
Then enode eNB and purpose user UEdDirection communication, if l ≠ 0, enode eNB is by relaying to purpose user UEd
Transmission data, when enode eNB adopts cooperation mode to purpose user UEdSend data when, if with purpose user UEd
The relaying UE for matching somebody with somebodylInstant response rateEnode eNB is in the 1st stage in a time division manner to relaying UElSend mesh
User UEdWith relaying UElExpected data, relay UElThe data that enode eNB issues oneself are received, to purpose
User UEdData enter row decoding forwarding, if relaying UElInstant response rateEnode eNB is only to relaying
UElSend purpose user UEdData；
Step 7, comparative example fair algorithm are improved, and enode eNB updates little according to improved proportional fair algorithm
The mean data rate of whole user UE in area, obtain initial slot t=1 to t-th time slot all user UE it is average
Data rate, the computing formula of the improved proportional fair algorithm are as follows：
Wherein, RkT () is represented in t-th transmission time slot, k-th user UEkAchievable rate, when enode eNB and kth
Individual user UEkDuring direction communication,When enode eNB adopts cooperation mode to k-th user UEkSend data
When,Expression UE to the t-1 transmission time slot from initial slot t=1kMean data rate,For the instant return that relaying is obtained, clFor the instant return weight of relaying, δc∈ [0,1), UE in reflection time slot tkData
Speed RkThe influence degree of (t) to its Mean Speed, if UE is in time window TcInterior renewal Mean Speed, then δc=1-1/Tc,
TcBigger, the renewal of Mean Speed and dispatch weight is slower, takes δ hereinc=0.99, the Section 1 of the computing formula is to mesh
User's Mean Speed renewal, as current time slots purpose user obtains data transport service, the increment of its Mean Speed is
(1-δc)RkT (), will cause the reduction of the purpose user scheduling weight in next time slot, the Section 2 of the computing formula is right
The renewal of relaying Mean Speed, to guarantee fairness, the via node to obtaining instant return, by incrementIncrease
Plus its mean data rate, meanwhile, with cooperation contribution(relaying assistance under purpose user reachable data rate) add
WeightsAs the long-term return (reduce mean data rate, and then increase dispatch weight) to relaying, the computing formula
Section 3 be to other be not selected as purpose or relaying equipment Mean Speed renewal；
Step 8, in next time slot t+1, repeat step 1～step 7.
The technique effect of the present invention is described further below in conjunction with emulation experiment：
1st, simulated conditions and content
The parameter that emulation experiment is related to is set to, radius of society R=2km, cluster radius ρ=250m, enode eNB and use
The transmission power of family equipment UE is respectively PT=20W and PR=0.2W, user equipment (UE) carry out the electricity of data is activation and data receiver
Mean power P that road consumesc=0.1W, noise powerFor -104dBm.Path losses of the enode eNB to user equipment
LeNB-UE(D) path loss L with user equipment (UE) to user equipment (UE)UE-UE(D), computing formula is respectively：
LeNB-UE(D)=128.1+37.6lg (D/1000) is (dB)
LUE-UE(D)=16.5+37.6lg (D) is (dB)
Wherein, D is the distance between communication entity, and unit is m.Channel coefficients are produced using Dent phantoms, most mostly
The frequency displacement of general Le takes 7Hz, and synthesis path number is 32.
Emulation experiment is the system spectrum to the compound relaying motivational techniques in coordination downlink communication proposed by the invention
The performance of two aspects of efficiency and life span is emulated, and with two kinds of non-cooperating transmission methods and two kinds of cooperation transmission methods
It is compared, its result is as shown in Figure 3 and Figure 4.
Two kinds of non-cooperating transmission methods and two kinds of cooperation transmission methods for comparing include：
(1) transmitted using the non-cooperating of poll, in turn each user is scheduled；
(2) non-cooperating based on equitable proportion is transmitted, and adoption rate equity criterion selects purpose user；
(3) cooperation transmission dispatched based on speed optimal user, user equipment serve as relaying, the choosing of purpose user and relaying
Take and target is turned to system and speed maximum；
(4) cooperation transmission of non-relay excitation, is that each user matches optimal mobile relay, then according to ratio is public
Flat criterion selects user-relaying right, to participating in the mobile subscriber of cooperation without return.
2nd, analysis of simulation result
Fig. 3 is given as number of users K=20, and the system spectral efficiency of the present invention and prior art is with enode and cluster
The situation of the distance between center d changes.
With reference to Fig. 3, affected by path loss, methodical spectrum efficiency reduce with the increase of d.Cooperation transmission side
The system spectral efficiency of method is better than non-cooperating method.Wherein, the cooperation transmission based on the scheduling of speed optimal user is maximum with speed
Turning to target carries out user's selection, and spectrum efficiency is better than other methods.It is compound in coordination downlink communication proposed by the invention
Relaying motivational techniques improve the data rate of via node by providing compound return to relaying, and its system spectral efficiency is only
Inferior to the cooperation transmission dispatched based on speed optimal user.The cooperation transmission of non-relay excitation is to relaying without return, therefore which is
System spectrum efficiency is less than the compound relaying motivational techniques in coordination downlink communication proposed by the invention.Based on the non-of equitable proportion
Cooperation transmission adoption rate fair algorithm dispatches user, but relaying is not used, and system spectral efficiency is further reduced, but better than wheel
Inquiry method, this is cannot to ensure the channel status that scheduled user has had due to poll.
Fig. 4 is given as number of users K=15, and the system time of the present invention and prior art is initial with user equipment
The situation of energy variation.
As a example by this sentences certain intelligent terminal, its battery capacity is 1340mAh.Research shows, distributes to radio communication group
The energy of part accounts for the 35%～40% of battery gross energy, therefore can obtain the energy content of battery of this terminal and distribute to channel radio
The part of letter component is about 7139.52J (E=40%* (3.7V*1340mA) * 1h), in order to simple, by user equipment in emulation
Initialization energy is set to 7000J.Meanwhile, the statistical interval using 50s as the cycle as energy expenditure.For non tie up system,
The energy expenditure that user is produced in not existing because serving as then, therefore only the system time of cooperation transmission mode is imitated
Very.Equipment be scheduled as purpose user or in idle state when energy expenditure much smaller than energy consumption when serving as relaying.Reference
Fig. 4, is returned immediately as the compound relaying motivational techniques in coordination downlink communication proposed by the invention are introduced in relay selection
Report weight, the few equipment of dump energy can just participate in cooperation only when higher instant return is obtained in that, so as to reduce this
Class user is chosen as the compound relaying motivational techniques system in the probability for relaying, therefore coordination downlink communication proposed by the invention
Life span is optimum.The cooperation transmission of non-relay excitation does not consider the dump energy of node when selecting and relaying for purpose user,
Therefore system time is less than the compound relaying motivational techniques in coordination downlink communication proposed by the invention.Based on speed most
The cooperation transmission of excellent user scheduling turns to target with system velocity maximum, during the good user of channel status will be chosen as with high probability
After so as to cause substantial amounts of energy expenditure, reducing system time.
Above simulation result shows, relative to existing relaying motivational techniques, coordination downlink communication proposed by the invention
In compound relaying motivational techniques can realize the improvement of system spectral efficiency and life span.
Presently preferred embodiments of the present invention is the foregoing is only, not to limit the present invention, all essences in the present invention
Any modification, equivalent and improvement made within god and principle etc., should be included within the scope of the present invention.
Claims (9)
1. the compound relaying motivational techniques in a kind of coordination downlink communication, comprise the steps：
(1) in any one time slot t, into cell, all user UE send the signal comprising training sequence to enode eNB,
User UE estimated with the channel coefficients between enode eNB to which by the training sequence in signal, and will be obtained
Channel coefficient feedback gives enode eNB；
(2) enode eNB by cell with k-th user UEkCentered on, ρ is the user UE in the circle of radius as in candidate
After obtaining candidate relay set ΩR, while candidate relay is by itself and k-th user UEkThe channel coefficients obtained during interaction, feedback
Give enode eNB；
(3) enode eNB is according to itself and candidate relayBetween channel coefficients, calculate enode eNB to candidate relayReachable data rate, obtain the reachable data rate of the first hop linkSimultaneously according to candidate relayWith kth
Individual user UEkBetween channel coefficients, calculate candidate relayTo k-th user UEkReachable data rate, obtain second
The reachable data rate of hop link
(4) enode eNB calculates the reachable data rate of the first hop linkWith the reachable data rate of the second hop linkIn minima, obtain k-th user UEkVia candidate relayAssist the data rate for obtainingThe is calculated simultaneously
The reachable data rate of one hop linkMore than the reachable data rate of the second hop linkPart, obtain candidate relayInstant response rate
(5) enode eNB is according to itself and k-th user UEkBetween channel coefficients, calculate enode eNB with k-th use
Family UEkReachable data rate during direction communication
(6) enode eNB calculates candidate relayFrom the energy consumed to the t-1 time slot by initial slot t=1
With candidate relayThe ratio of the energy of initial slot t=1 initial times, obtains candidate relayInstant return weight
(7) enode eNB is first from candidate relay set ΩRIn, select k-th user UEkObtainable data rate
More than or equal to enode eNB and k-th user UEkReachable data rate during direction communicationAnd return immediately weight
Span for [0, then candidate relay 1) calculates k-th user UEkAssist what is obtained via the candidate relay selected
Data rateWith instant response rateWeighted sumFoundation is to the maximum with weighted sum finally, is obtained
To with k-th user UEkL-th relaying UE of matchingl, and judge enode eNB to k-th user UE according to the value of lk's
Whether data transfer needs relaying to assist, if l=0, enode eNB is to k-th user UEkData transfer need not
Relaying is assisted, t-th time slot, k-th user UEkReachable data rate be equal to enode eNB and k-th user UEkDirectly
Reachable data rate during communicationIf l ≠ 0, enode eNB is to k-th user UEkData transfer need in
After assistance, t-th time slot, k-th user UEkReachable data rate be equal to k-th user UEkVia relaying UElAssist to obtain
Data rate
(8) enode eNB calculates t-th time slot, k-th user UEkReachable data rate and initial slot t=1 to t-1
K-th user UE till individual time slotkMean data rate ratio, obtain k-th user UEkIn the dispatch weight of time slot t
wk；
(9) enode eNB travels through the dispatch weight w of whole users in cellk, with dispatch weight wkValue is to the maximum according to determination
Purpose user UEd；
(10) enode eNB according to the judged result of l values in step (7) to purpose user UEdTransmission data, if l=0,
Enode eNB and purpose user UEdDirection communication, if l ≠ 0, enode eNB is by relaying to purpose user UEdPass
Transmission of data；
(11) comparative example fair algorithm is improved, and enode eNB updates complete in cell according to improved proportional fair algorithm
The mean data rate of portion user UE, obtains the average data speed of initial slot t=1 all user UE to t-th time slot
Rate；
(12) in next time slot t+1, repeat step (1)～step (11).
2. the compound relaying motivational techniques during coordination downlink according to claim 1 communicates, it is characterised in that step (3)
Described in the first hop link reachable data rateAnd second hop link reachable data rateComputing formula
For：
Wherein,Subscript x represent that enode eNB is sent to k-th user UEkData, z represent enode eNB send out
Give candidate relayData, PRFor relaying transmission power,For enode eNB and candidate relayBetween
Channel coefficients.
3. the compound relaying motivational techniques during coordination downlink according to claim 1 communicates, it is characterised in that step (4)
Described in k-th user UEkVia candidate relayAssist the data rate for obtainingAnd candidate relayI.e.
When response rateComputing formula is：
。
4. the compound relaying motivational techniques during coordination downlink according to claim 1 communicates, it is characterised in that step (5)
Described in enode eNB calculate which with k-th user UEkReachable data rate during direction communicationComputing formula
For：
Wherein, PTFor the transmission power of enode eNB,For the power of additive white Gaussian noise, hs,kFor k-th user UEk
With the channel coefficients between enode eNB.
5. the compound relaying motivational techniques during coordination downlink according to claim 1 communicates, it is characterised in that step (6)
Described in candidate relayInstant return weightComputing formula is：
Wherein,WithRepresent respectivelyInitial slot t=1 initial times energy and it time slot t starting
The dump energy at moment, candidate relayInstant return weightSpan for [0,1).
6. the compound relaying motivational techniques during coordination downlink according to claim 1 communicates, it is characterised in that step (7)
Described in obtain and k-th user UEkL-th relaying UE of matchingl, computing formula is：
。
7. the compound relaying motivational techniques during coordination downlink according to claim 1 communicates, it is characterised in that step (8)
Described in obtain k-th user UEkIn the dispatch weight w of time slot tk, computing formula is：
Wherein RkT () is represented in t-th time slot, k-th user UEkReachable data rate, when enode eNB and k-th use
Family UEkDuring direction communication,When enode eNB adopts cooperation mode to k-th user UEkWhen sending data, Expression k-th user UE to the t-1 transmission time slot from initial slot t=1kAverage data
Speed.
8. the compound relaying motivational techniques during coordination downlink according to claim 1 communicates, it is characterised in that step (10)
Described in enode eNB according to the judged result of l values in step (7) to purpose user UEdTransmission data, works as enode
ENB adopts cooperation mode to purpose user UEdSend data when, if with purpose user UEdThe relaying UE of matchinglImmediately return
Report speed rl (z)>0, enode eNB are in the 1st stage in a time division manner to relaying UElSend purpose user UEdWith relaying UEl's
Expected data, relays UElThe data that enode eNB issues oneself are received, to purpose user UEdData translated
Code forwarding, if relaying UElInstant response rate rl (z)=0, enode eNB are only to relaying UElSend purpose user UEd
Data.
9. the compound relaying motivational techniques during coordination downlink according to claim 1 communicates, it is characterised in that step (11)
Described in enode eNB the mean data rate of whole user UE in cell is updated according to improved proportional fair algorithm,
The improved proportional fair algorithm computing formula is as follows：
Wherein, RkT () is represented in t-th transmission time slot, k-th user UEkAchievable rate, when enode eNB and k-th use
Family UEkDuring direction communication,When enode eNB adopts cooperation mode to k-th user UEkWhen sending data, Expression UE to the t-1 transmission time slot from initial slot t=1kMean data rate, rl (z)For
The instant return that relaying is obtained, clTo relay UElInstant return weight, δc∈ [0,1), δ is taken hereinc=0.99.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611136983.7A CN106550409A (en) | 2016-12-12 | 2016-12-12 | Compound relaying motivational techniques in coordination downlink communication |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611136983.7A CN106550409A (en) | 2016-12-12 | 2016-12-12 | Compound relaying motivational techniques in coordination downlink communication |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106550409A true CN106550409A (en) | 2017-03-29 |
Family
ID=58397428
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611136983.7A Pending CN106550409A (en) | 2016-12-12 | 2016-12-12 | Compound relaying motivational techniques in coordination downlink communication |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106550409A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107070515A (en) * | 2017-04-13 | 2017-08-18 | 东南大学 | A kind of D2D cooperation transmission methods under the conditions of rician fading channel |
| CN110167100A (en) * | 2019-05-27 | 2019-08-23 | 重庆邮电大学 | The selection method of relay node in a kind of Internet of Things |
| CN114900825A (en) * | 2022-04-12 | 2022-08-12 | 中国电信股份有限公司 | Terminal cross-region cooperative relay switching communication method, system, equipment and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104244437A (en) * | 2014-10-13 | 2014-12-24 | 西安电子科技大学 | Dynamic relaying incentive fair-share dispatching method for cooperative downlink transmission |
| CN105228237A (en) * | 2015-10-08 | 2016-01-06 | 西安电子科技大学 | Based on the unbalanced relaying motivational techniques of link in coordination downlink link |
-
2016
- 2016-12-12 CN CN201611136983.7A patent/CN106550409A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104244437A (en) * | 2014-10-13 | 2014-12-24 | 西安电子科技大学 | Dynamic relaying incentive fair-share dispatching method for cooperative downlink transmission |
| CN105228237A (en) * | 2015-10-08 | 2016-01-06 | 西安电子科技大学 | Based on the unbalanced relaying motivational techniques of link in coordination downlink link |
Non-Patent Citations (2)
| Title |
|---|
| O. SIMEONE等: "Spectrum Leasing to Cooperating Secondary Ad Hoc Networks", 《IEEE》 * |
| WEI XU等: "Beamforming and Interference Cancellation for D2D Communication Underlaying Cellular Networks", 《IEEE》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107070515A (en) * | 2017-04-13 | 2017-08-18 | 东南大学 | A kind of D2D cooperation transmission methods under the conditions of rician fading channel |
| CN107070515B (en) * | 2017-04-13 | 2020-04-24 | 东南大学 | D2D cooperative transmission method under Rice fading channel condition |
| CN110167100A (en) * | 2019-05-27 | 2019-08-23 | 重庆邮电大学 | The selection method of relay node in a kind of Internet of Things |
| CN114900825A (en) * | 2022-04-12 | 2022-08-12 | 中国电信股份有限公司 | Terminal cross-region cooperative relay switching communication method, system, equipment and storage medium |
| CN114900825B (en) * | 2022-04-12 | 2024-03-19 | 中国电信股份有限公司 | Terminal cross-zone cooperative relay switching communication method, system, equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhang et al. | Energy-balanced cooperative transmission based on relay selection and power control in energy harvesting wireless sensor network | |
| CN102638872B (en) | Relay selection method based on load balancing in cooperation relay network | |
| CN101827418B (en) | Energy optimization-based cognitive radio multicast routing method | |
| CN102098746B (en) | Multi-cell resource allocation method introducing mobile resource reserve mechanism | |
| US8098609B2 (en) | Integrated scheduling of unicast and multicast traffic in relay-enabled wireless networks | |
| CN104640141B (en) | A kind of motivational techniques of more relay node cooperative games | |
| CN105979598A (en) | Traffic flow dynamic grouping based LTE-D2D Internet of vehicles resource distribution method | |
| CN101877918A (en) | Equipment and method for dynamic clustering of base station in mobile communication | |
| CN104244437B (en) | A kind of method of dynamic trunking excitation equity dispatching for coordination downlink transmission | |
| CN104954970B (en) | A kind of method and system of the resource allocation of D2D | |
| Hussain et al. | Energy efficient virtual MIMO communication for wireless sensor networks | |
| CN103024921A (en) | Scheduling method based on CQI (channel quality indicator) feedback parameter and SINR (signal to interference plus noise ratio) numerical grouping | |
| Song et al. | Energy efficient cooperative coalition selection in cluster-based capillary networks for CMIMO IoT systems | |
| Yang et al. | DISCO: Interference-aware distributed cooperation with incentive mechanism for 5G heterogeneous ultra-dense networks | |
| CN109067511A (en) | The communication means and device of dual-mode communications network | |
| CN106550409A (en) | Compound relaying motivational techniques in coordination downlink communication | |
| CN108200581A (en) | Multi-user resource distributing method in the wireless power communication network of selective user cooperation | |
| CN108811023A (en) | A kind of SWIPT cooperation communication system relay selection methods based on glowworm swarm algorithm | |
| CN104159279B (en) | A kind of base station and relaying ON/OFF selection system and method based on efficiency criterion | |
| Cheng et al. | QoS-driven MAC-layer resource allocation for wireless mesh networks with non-altruistic node cooperation and service differentiation | |
| CN106028416B (en) | The improvement clustering method of communication pattern double adaptive between a kind of cluster range and cluster | |
| Li et al. | A lightweight decentralized reinforcement learning based channel selection approach for high-density LoRaWAN | |
| CN104010344A (en) | Wireless sensor network virtual MIMO communication strategy based on cooperative groups | |
| Zhang et al. | Selective spectrum leasing in internet of things via nash bargaining solutions | |
| CN103152807A (en) | Method for distributing power between multiple base stations and multiple antennae of TDD (Time Division Duplex) cooperative wireless 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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20170329 |
|
| WD01 | Invention patent application deemed withdrawn after publication |